Pagini recente » Cod sursa (job #1683953) | Cod sursa (job #505589) | Cod sursa (job #1010264) | Cod sursa (job #839949) | Cod sursa (job #233469)
Cod sursa(job #233469)
#include<fstream.h>
//using namespace std;
int x[100][100],i,j,k,l,m,n,aux;
ifstream f("tablete.in");
ofstream g("tablete.out");
int main(){
f>>n>>k;
if(n%2==0&&k%2==0)
{m=1;
for(i=1;i<=n;i++)
{for(j=1;j<=n;j++)
{g<<m<<" ";
m++;}
g<<'\n';
}}
else
if(n%2==0&&k%2!=0)
{m=1;l=k;
for(i=1;i<n;i++)
{m=n*(i-1)+1;
//aux=m+k-1;
for(j=1;j<k;j++)
{g<<m<<" ";m++;}
aux=m+n;
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;}
g<<aux;
g<<'\n';
}
g<<l<<" ";
m=n*(i-1)+1;
for(j=1;j<k;j++)
{g<<m<<" ";
m++;}
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;
}}
else
if(n%2==1&&k%2==0)
{l=n+k;
for(i=1;i<(n-1);i++)
{if(i%2==1)
{m=n*(i-1)+1;
for(j=1;j<=n;j++)
{g<<m<<" ";m++;}
}
else
{m=n*(i-1)+1;
for(j=1;j<k;j++)
{g<<m<<" ";m++;}
aux=m+2*n;
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;}
g<<aux;}
g<<'\n';
}
g<<l<<" ";
for(j=1;j<k;j++)
{g<<m<<" ";m++;}
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;}
g<<'\n';
for(j=1;j<=n;j++)
{g<<m<<" ";m++;}
}
else
{l=k;
for(i=1;i<n;i++){
if(i%2==1)
{m=n*(i-1)+1;
for(j=1;j<k;j++)
{g<<m<<" ";m++;}
aux=m+2*n;
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;}
g<<aux;}
else
{m=n*(i-1)+1;
for(j=1;j<=n;j++)
{g<<m<<" ";m++;}
}
g<<'\n';
}
g<<l<<" ";
for(j=1;j<k;j++)
{g<<m<<" ";m++;}
m++;
for(j=k;j<n;j++)
{g<<m<<" ";m++;}
}
f.close();
g.close();
return 0;
}