Cod sursa(job #2850782)
Utilizator | Data | 17 februarie 2022 15:54:35 | |
---|---|---|---|
Problema | Tablete | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.44 kb |
#include <iostream>
using namespace std;
int a[1001][1001];
int main()
{
int n,k,p;
cin>>n>>k;
if(k%2==1) p=2;
else p=1;
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
a[i][j]=p++;
}
}
if(k%2==1) a[n][n]=1,swap(a[n][1],a[n][n]);
for(int i=1;i<=n;i++){
for(int j=1;j<=n;j++){
cout<<a[i][j]<<" ";
}
cout<<endl;
}
return 0;
}