Pagini recente » Cod sursa (job #2415718) | Cod sursa (job #795749) | Cod sursa (job #3125331) | Cod sursa (job #1414720) | Cod sursa (job #2029603)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("tablete.in");
ofstream fout("tablete.out");
int n,p=1,a[50][50],k, aux=0;
fin>>n;
fin>>k;
for( int i=1; i<=n; i++)
for(int j=1; j<=n; j++)
{
a[i][j]=p;
p++;
}
for(int j=k; j<=k; j++)
for(int i=1; i<=n; i++)
{
if(k==1)
if(a[i][j]%2!=0)
{
aux=a[i][j];
a[i][j]=a[i][j+1];
a[i][j+1]=aux;
}
if(k>1 || k==n)
if(a[i][j]%2!=0)
{
aux=a[i][j];
a[i][j]=a[i][j-1];
a[i][j-1]=aux;
}
}
for(int i=1; i<=n; i++)
{
for(int j=1; j<=n ; j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}