Pagini recente » Cod sursa (job #1332396) | Cod sursa (job #2154230) | Cod sursa (job #566731) | Cod sursa (job #2256033) | Cod sursa (job #2612531)
#include <iostream>
#include <fstream>
using namespace std;
const int N = 1e3;
int a[N+1][N+1];
ifstream fin ( "tablete.in" );
ofstream fout ( "tablete.out" );
int main()
{
int n, k;
int i, j;
fin >> n >> k;
int nr = 1;
for ( i = 1; i <= n; i ++ )
for ( j = 1; j <= k; j ++ )
a[i][j] = nr ++;
for ( i = 1; i <= n; i ++ )
for ( j = k + 1; j <= n; j ++ )
a[i][j] = nr ++;
if ( k % 2 == 1 ) {
int aux;
for ( i = 1; i <= n; i += 2 ) {
aux = a[i][k];
a[i][k] = a[i+1][1];
a[i+1][1] = aux;
}
}
for ( i = 1; i <= n; i ++ ) {
for ( j = 1; j <= n; j ++ ) {
fout << a[i][j] << ' ';
}
fout << '\n';
}
return 0;
}