Cod sursa(job #230517)
| Utilizator | Data | 14 decembrie 2008 09:14:03 | |
|---|---|---|---|
| Problema | Tablete | Scor | 10 |
| Compilator | cpp | Status | done |
| Runda | Algoritmiada 2009, Runda 1, Studenti | Marime | 0.51 kb |
#include <stdio.h>
int n, i, j, k, p, nr, x;
int v[1010];
void cit() {
freopen("tablete.in", "r", stdin);
freopen("tablete.out", "w", stdout);
scanf("%d %d", &n, &k);
}
void solve() {
for (i = 1; i <= n; i++) {
p = 0;
for (j = 1; j <= n; j++) {
v[++p] = ++nr;
if (j == k && nr % 2 == 1) {
x = v[p - 1];
v[p - 1] = v[p];
v[p] = x;
}
}
for (j = 1; j <= n; j++)
printf("%d ",v[j]);
printf("\n");
}
}
int main() {
cit();
solve();
return 0;
}
