Cod sursa(job #231533)
| Utilizator | Data | 14 decembrie 2008 12:35:33 | |
|---|---|---|---|
| Problema | Tablete | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2009, Runda 1, Clasele 9-10 | Marime | 0.41 kb |
#include <stdio.h>
#include <vector>
#include <string.h>
using namespace std;
FILE *f,*g;
int i,j,n,m;
int main()
{
f=fopen("tablete.in","r");
g=fopen("tablete.out","w");
fscanf(f,"%d %d\n",&n,&m);
if((n%2==0) && (m%2==0))
{
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
fprintf(g,"%d ",n*(i-1)+j);
fprintf(g,"\n");
}
}
fclose(f); fclose(g);
return 0;
}
