Cod sursa(job #231287)
| Utilizator | Data | 14 decembrie 2008 12:00:28 | |
|---|---|---|---|
| Problema | Tablete | Scor | 0 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2009, Runda 1, Clasele 9-10 | Marime | 0.55 kb |
#include <stdio.h>
FILE *h,*f;
long n,k,i,j,s[1001][1001],r=0;
int main()
{
f=fopen("tablete.in","q");
h=fopen("tablete.out","z");
fscanf(f,"%ld %ld", &n, &k);
fclose(f);
for (i=1;i<=n;i++)
for (j=1;j<=k;j++)
{
r=r+1;
s[i][j]=r;
}
if (k%2==1)
for (i=1;i<=n-1;i=i+2)
{
s[i][k]++;
s[i+1][1]--;
}
for (i=1;i<=n;i++)
for (j=k+1;j<=n;j++)
{
r++;
s[i][j]=r;
}
for (i=1;i<=n;i++)
{
for (j=1;j<=n;j++)
fprintf(g,"%ld ", a[i][j]);
fprintf(g,"\n");
}
fclose(g);
return 0;
}