c++

[nametapa]

Pascal’s triangle
C(m,0) = 1 and C(m, m) = 1 for m >= 0.
C(m,n) = C(m-1, n-1) + C(m-1, n) for m > n > 0.

Enter number n: 3
Result:
1
1 1
1 2 1
1 3 3 1


我的尝试：
#include <iostream>
using namespace std;

void pascal(int);
int coe(int,int);

void main ()

{
int row;
cout<<"enter number n:"<<endl;
cin>>row;

pascal(row);
}
return 0;
}
void pascal(int row)
{
for (int i =1; i<= row; i++)
{
for {int b=1; b<=1; b++)
cout<<coe(i,m)<<'';
cout<<endl;
}
}
int coe(int m,int n)
{
if (m>=0 || n<=1)
return 1;
else
return coe(m-1,n-1) + coe(m-1,n);


return 0;


我试过了很多次了但还是不能，请问谁能脚我完整的coding?

[猫已经找不回了]

mark先

[Treazy]

#include <cstdio>
#include <assert.h>

int Fun(int m, int n)
{
	assert(m >= 0 && n >= 0);
	if(0 == n || m == n)
	{
		return 1;
	}

	return m > n ? Fun(m-1, n-1) + Fun(m-1, n) : 0;
}

int main(int argc, char** argv)
{
	for(int i = 0; i < 10; ++i)
	{
		for(int j = 0; j <= i; ++j)
		{
			printf("%4d ", Fun(i, j));
		}
		printf("\n");
	}

	return 0;
}

Please take it as a reference!