Pagini recente » Cod sursa (job #1408721) | Cod sursa (job #3218740) | Cod sursa (job #322017) | Cod sursa (job #2145547) | Cod sursa (job #469271)
Cod sursa(job #469271)
using namespace std;
#include<fstream>
ifstream f("tablete.in");ofstream g("tablete.out");
int n,k,x[1001][1001];
int main()
{
int i,j,aux;
f>>n>>k;
for(i=1;i<=n;i++)
for(j=1;j<=n;j++)x[i][j]=(i-1)*n+j;
if(n%2==0 && k%2)//n par si k impar
for(i=1;i<n;i+=2)//grupez cate doua linii si fac o rotire in sens trigonometric
{
aux=x[i][1];
for(j=1;j<n;j++)x[i][j]=x[i][j+1];
x[i][n]=x[i+1][n];
for(j=n;j>1;j--)x[i+1][j]=x[i+1][j-1];
x[i+1][1]=aux;
}
if(n%2)//n impar
if(k%2==0)//k par
for(i=1;i<n;i+=2)//grupez cate doua linii
{
aux=x[i][n];x[i][n]=x[i+1][n-1];//ultimul element din linia 1(i) se schimba cu primul din linia 2(i+1)
for(j=n-1;j>1;j--)x[i+1][j]=x[i+1][j-1];//primele n-2 din linia 2 se deplaseeaza spre dreapta
x[i+1][1]=aux;
}
//else//k impar
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)//g<<x[i][j]<<' ';
{g.width(4);g<<x[i][j]<<' ';}
g<<'\n';
}
f.close();
g.close();
return 0;
}