Pagini recente » Cod sursa (job #2207791) | Istoria paginii runda/4322 | Cod sursa (job #2820372) | Cod sursa (job #831252) | Cod sursa (job #2029707)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int a[1000][1000];
int main()
{
int n,k,i,j,c=2,aux;
f>>n>>k;
for(i=1; i<=n; i++)
for(j=1; j<=n; j++)
{
a[i][j]=c;
c++;
}
for(i=1;i<=n;i++)
{
if(a[i][k]%2==1)
{
aux=a[i][k];
a[i][k]=a[i][k+1];
a[i][k+1]=aux;
}
}
a[n][n]=1;
for(i=1; i<=n; i++)
{
for(j=1; j<=n; j++)
g<<a[i][j]<<" ";
g<<endl;
}
return 0;
}