Pagini recente » Cod sursa (job #2859192) | Cod sursa (job #1757617) | Cod sursa (job #1695238) | Cod sursa (job #1333707) | Cod sursa (job #1880446)
#include <iostream>
#include <bits/stdc++.h>
using namespace std;
ifstream in("tablete.in");
ofstream out("tablete.out");
int v[1001][1001];
int v2[1001];
int main()
{
int n,k,nr;
nr=1;
in>>n>>k;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++){
v[j][i]=nr;
nr++;
}
for(int i=1;i<=n;v2[i]=v[i][k],i++){
if(v[i][k]%2==0)
continue ;
else{
int a1,a2;
a1=i-1;
a2=i+1;
while(a1>0 && v[a1][k+1]%2==1)
a1--;
if(v[a1][k+1]%2==0 && a1)
swap(v[a1][k+1],v[i][k]);
else{
while(a2<n && v[a2][k-1]%2==1)
a2++;
if(a2!=n)
swap(v[a2][k-1],v[i][k]);
}
}
}
//sort(v2+1,v2+1+n);
//for(int i=1;i<=n;i++)
// v[i][k]=v2[i];
for(int i=1;i<=n;i++,out<<endl)
for(int j=1;j<=n;j++)
out<<v[i][j]<<" ";
return 0;
}