Pagini recente » Cod sursa (job #660461) | Cod sursa (job #1958053) | Cod sursa (job #3260918) | Cod sursa (job #135870) | Cod sursa (job #2777019)
#include <fstream>
using namespace std;
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int a[1001][1001];
int main()
{
int n,k,i,j,nr,c;
fin>>n>>k;
nr=1;
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
a[j][i]=nr;
nr++;
}
}
if(a[1][k]%2==1)
{
nr=3;
c=a[1][k];
a[1][k]=a[n][k-1];
a[n][k-1]=c;
}
else
{
nr=4;
c=a[2][k];
a[2][k]=a[n-1][k-1];
a[n-1][k-1]=c;
}
for(i=nr;i<=n;i=i+2)
{
c=a[i][k];
a[i][k]=a[i-((n%2)+1)][k+1];
a[i-((n%2)+1)][k+1]=c;
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
fout<<a[i][j]<<" ";
}
fout<<'\n';
}
fin.close();
fout.close();
return 0;
}