Cod sursa(job #2029491)
Utilizator | Data | 30 septembrie 2017 11:03:50 | |
---|---|---|---|
Problema | Tablete | Scor | 0 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.11 kb |
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int n,a[1000][1000],c=1,k;
int main()
{
f>>n>>k;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
a[i][j]=c,c++;
for(int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
if(j==k)
if(i%2==1)
{
int aux=a[i][j];
a[i][j]=a[i][j+1];
a[i][j+1]=aux;
}
else
{
int aux=a[i][j];
a[i][j]=a[i][j-1];
a[i][j-1]=aux;
}
for(int i=1; i<=n; i++)
if(i%2==0)
{
int aux=a[i][n/2];
a[i][n/2]=a[i-1][n];
a[i-1][n]=aux;
}
for(int i=2;i<=n;i=i+2)
{
int aux=a[i][1];
a[i][1]=a[i][n/2];
a[i][n/2]=aux;
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n; j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}