Cod sursa(job #231316)
Utilizator | Data | 14 decembrie 2008 12:06:30 | |
---|---|---|---|
Problema | Tablete | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2009, Runda 1, Clasele 9-10 | Marime | 0.54 kb |
#include<cstdio>
using namespace std;
int n,k,a[1001][1001],i,j;
int main()
{ freopen("tablete.in","r",stdin);
freopen("tablete.out","w",stdout);
scanf("%d%d",&n,&k);
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)
a[i][j]=i*j;
if(k%2==0)
for(i=1;i<=n;i++)
{ for(j=1;j<=n;j++)
printf("%ld ",a[i][j]);
printf("\n");
}
//else
return 0;
}