Pagini recente » Cod sursa (job #2381078) | Cod sursa (job #428269) | Cod sursa (job #540290) | Borderou de evaluare (job #3159968) | Cod sursa (job #3165623)
#include <iostream>
#include <fstream>
using namespace std;
int cioco[1002][1002];
ifstream in("tablete.in");
ofstream out("tablete.out");
int main()
{
int n,k;
in>>n>>k;
long long nr=1;
for(int i=1;i<=n;i++){
for(int j=1;j<=k;j++){
cioco[i][j] = nr;
nr++;
}
}
for(int i=1;i<=n;i++){
for(int j=k+1;j<=n;j++){
cioco[i][j] = nr;
nr++;
}
}
if(k%2==1){
for(long long i=1;i<n;i=i+2){
long long aux = cioco[i][k];
cioco[i][k] = cioco[i+1][1];
cioco[i+1][1] = aux;
}
}
if(n%2==1){
long long aux = cioco[n][k];
cioco[n][k] = cioco[1][k+1];
cioco[1][k+1] = aux;
}
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
out<<cioco[i][j];
out<<" ";
}
out<<"\n";
}
}