Pagini recente » Cod sursa (job #2643517) | Cod sursa (job #3171576) | Cod sursa (job #474163) | Cod sursa (job #879566) | Cod sursa (job #1412749)
#include <stdio.h>
#define MAXN 1000
int ma[MAXN][MAXN];
inline void fill(int l, int c, int s, int x, int k){
int i, j;
for(i = 0; i < l; i++){
for(j = 0; j < k; j++){
ma[i][j + s] = x;
x++;
}
}
for(i = 0; i < l; i++){
for(j = k; j < c; j++){
ma[i][j + s] = x;
x++;
}
}
}
int main(){
FILE *in = fopen("tablete.in", "r");
int n, k, i, j, x = 1;
fscanf(in, "%d%d", &n, &k);
fclose(in);
if(k & 1){
for(i = 0; i < n; i++){
ma[i][0] = x;
x++;
}
fill(n, n - 1, 1, x, k - 1);
}
else
fill(n, n, 0, x, k);
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;
}