Pagini recente » Cod sursa (job #1409512) | Cod sursa (job #2422960) | Cod sursa (job #1583157) | Cod sursa (job #699827) | Cod sursa (job #1549362)
#include <fstream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int const nmax=1000;
int v[nmax+1][nmax+1];
int main () {
int n,k;
fin>>n>>k;
int a=1;
for (int i=1; i<=n; i++) {
for (int j=1; j<=k; j++) {
v[i][j]=a;
a++;
}
}
for (int i=1; i<=n; i++) {
for (int j=k+1; j<=n; j++) {
v[i][j]=a;
a++;
}
}
for (int i=1; i<=n-1; i++) {
if (v[i][k]%2==1) {
int x=v[i][k];
v[i][k]=v[i+1][1];
v[i+1][1]=x;
}
}
if (v[n][k]%2==1) {
int x=v[n][k];
v[n][k]=v[1][k+1];
v[1][k+1]=x;
}
for (int i=1; i<=n; i++) {
for (int j=1; j<=n; j++) {
fout<<v[i][j]<<" ";
}
fout<<"\n";
}
return 0;
}