Cod sursa(job #443246)
Utilizator | Data | 16 aprilie 2010 15:58:31 | |
---|---|---|---|
Problema | Pascal | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 0.42 kb |
#include<fstream>
using namespace std;
int a[100][100],n,m,i,j;
int main()
{
ifstream f("t.in");
ofstream g("t.out");
f>>n>>m;
a[0][j]=0;
a[0][m/2+1]=1;
for(i=1;i<=n;i++)
a[i][1]=a[i-1][1];
for(i=1;i<=n;i++)
for(j=1;j<=m;j++)
a[i][j]=a[i-1][j-1]+a[i-1][j+1];
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
if(a[i][j]==0)
g<<" ";
else
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}