Pagini recente » Cod sursa (job #1536523) | Cod sursa (job #1850341) | Cod sursa (job #2595926) | Cod sursa (job #2569283) | Cod sursa (job #1412733)
#include <stdio.h>
#define MAXN 1000
int ma[MAXN][MAXN];
int main(){
FILE *in = fopen("tablete.in", "r");
int n, k, i, j, x = 1;
fscanf(in, "%d%d", &n, &k);
n--; k--;
fclose(in);
for(i = 0; i <= n; i++){
for(j = 0; j < k; j++){
ma[i][j] = x;
x++;
}
}
for(i = 0; i <= n; i++){
if(x & 1){
ma[i][k] = x + 1 + 2 * i;
ma[i][k + 1] = x + 2 * i;
}
else{
ma[i][k] = x + 2 * i;
ma[i][k + 1] = x + 2 * i + 1;
}
}
x += 2 * n;
for(i = 0; i <= n; i++){
for(j = k + 2; j <= n; j++){
ma[i][j] = x;
x++;
}
}
FILE *out = fopen("tablete.out", "w");
for(i = 0; i <= n; i++){
for(j = 0; j <= n; j++){
fprintf(out, "%d ", ma[i][j]);
}
fputc('\n', out);
}
fclose(out);
return 0;
}