C++动态数组--用动态数组求斐波那契的前N项

///////////////////
/*动态分配数组
int *p=new int[size];
....
delete[]p;
*/
//////用动态数组求斐波那契的前N项
#include<iostream>
using namespace std;
void main()
{
int n;
cout<<"请输入要输出的个数："<<endl;
cin>>n;
cout<<"前"<<n<<"项为："<<endl;
int *p=new int
;//动态生成数组
if (p==0||p<=0)
{
return;
}
p[0]=0;
p[1]=1;
cout<<p[0]<<"\t";
cout<<p[1]<<"\t";
for (int i=2;i<n;i++)
{
p[i]=p[i-2]+p[i-1];
cout<<p[i]<<"\t";
}
cout<<endl;
delete []p;
}