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