这个求杨辉三角的程序为什么不对
#include <iostream>
using namespace std;
int main()
{cout<<1<<endl;
int i=1;
void p(int );
for (;i<10;i++)
p(i);
return 0;
}
void p(int a)
{int b;
double s[10]={0,0,0,0,0,0,0,0,0,0};
s[0]=1;
s[a]=1;
for(b=1;0<b<a;b++)
s[b]=s[b-1]/b*(1+a-b);
for(b=0;0<=b<a+1;b++)
cout<<s[b]<<' ';
cout<<endl;
}
static double s[10] = {0};
#include <iostream>
using namespace std;
void p(int);
int main()
{
cout << 1 << endl;
for (int i = 1; i < 10; i++)
{
p(i);
}
return 0;
}
void p(int a)
{
int* s = new int[a + 1];
s[0] = s[a] = 1;
for (int b = 1; b < a; b++)
{
s[b] = s[b-1] * (1 + a - b) / b;
}
for (int b = 0; b < a + 1; b++)
{
cout << s[b] << ' ';
}
cout << endl;
delete[] s;
}