Pagini recente » Cod sursa (job #3333208) | Borderou de evaluare (job #3332921) | Borderou de evaluare (job #3338999) | Cod sursa (job #3304342) | Cod sursa (job #3330769)
#include <bits/stdc++.h>
using namespace std;
const int Nmax=1005;
int mat[Nmax][Nmax];
int main()
{
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int n,k,val=0;
fin>>n>>k;
for (int i=1; i<=n; ++i) {
for (int j=1; j<=k; ++j) mat[i][j]=++val;
}
for (int i=1; i<=n; ++i) {
for (int j=k+1; j<=n; ++j) mat[i][j]=++val;
}
if (k%2==1) {
if (n%2==1) swap(mat[1][k+1],mat[n][k]);
for (int i=1; i<n; i+=2) swap(mat[i][k],mat[i+1][1]);
}
for (int i=1; i<=n; ++i) {
for (int j=1; j<=n; ++j) fout<<mat[i][j]<<' ';
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}