Cod sursa(job #230585)
Utilizator | Data | 14 decembrie 2008 09:43:38 | |
---|---|---|---|
Problema | Tablete | Scor | 10 |
Compilator | cpp | Status | done |
Runda | Algoritmiada 2009, Runda 1, Clasele 5-8 | Marime | 0.36 kb |
#include<stdio.h>
int n,k;
long long a[1001][1001];
int main()
{
FILE *f,*g;
f=fopen("tablete.in","r");
g=fopen("tablete.out","w");
fscanf(f,"%d %d",&n,&k);
if(n%2==0 && k%2==0)
{
long long contor=1;
int i,j;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{fprintf(g,"%lld ",contor);
contor++;
}
fprintf(g,"\n");}
}
return 0;}