Pagini recente » Borderou de evaluare (job #195881) | Borderou de evaluare (job #1017557) | Borderou de evaluare (job #1609843) | Cod sursa (job #455997) | Cod sursa (job #1893581)
#include <iostream>
#include <fstream>
using namespace std;
const int MAX = 1000001;
bool arr[MAX];
fstream f("tablete.in",ios::in);
ofstream g("tablete.out");
int main()
{
int N,K,i,j,it1,it2,it3;
f>>N>>K;
K;
it1 = 1;
if(0==K%2 && 0==N%2)
{
for(i=0;i<N;++i)
{
for(j=0;j<N;++j)
{
g<<it1++<<" ";
}
g<<"\n";
}
}
else if(0==N%2)
{
it2 = N+N;
it1 = 2;
it3 = 1;
for(i=0;i<N;++i)
{
for(j=0;j<N-1;++j)
{
g<<it1++<<" ";
}
g<<it2<<"\n";
i+=1;
g<<it3<<" ";
for(j=1;j<N;++j)
{
g<<it1++<<" ";
}
it1+=2;
it3 = it1-1;
it2+=N*2;
g<<"\n";
}
}
else if(1==N%2 && 1 ==K%2)
{
it2 = N+N;
it1 = 2;
it3 = 1;
for(i=0;i<N-1;++i)
{
for(j=0;j<N-1;++j)
{
g<<it1++<<" ";
}
g<<it2<<"\n";
i+=1;
g<<it3<<" ";
for(j=1;j<N;++j)
{
g<<it1++<<" ";
}
it1+=2;
it3 = it1-1;
it2+=N*2;
g<<"\n";
}
--it1;
for(j=0;j<N;++j)
{
g<<it1++<<" ";
}
}
else
{
it2 = N+N;
it1 = 1;
for(i=0;i<N-1;++i)
{
for(j=0;j<N-1;++j)
{
g<<it1++<<" ";
}
g<<it2<<"\n";
i+=1;
for(j=0;j<N;++j)
{
g<<it1++<<" ";
}
it1+=1;
it2+=N*2;
g<<"\n";
}
for(j=0;j<N;++j)
{
g<<it1++<<" ";
}
}
return 0;
}