Pagini recente » Cod sursa (job #287673) | Cod sursa (job #1615710) | Cod sursa (job #1141788) | Cod sursa (job #921721) | Cod sursa (job #347476)
Cod sursa(job #347476)
#include <iostream>
#include <fstream>
#include <sstream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <set>
using namespace std;
ifstream fin ("tablete.in");
int N, k;
int main()
{
FILE* fout;
fopen_s( &fout, "tablete.out", "w");
int n = 0;
fin >> N >> k;
if( k%2==0 )
for(int i=0; i<N; i++)
{
for(int j=0; j<N; j++)
fprintf(fout, "%d ", ++n);
fprintf(fout, "\n");
}
else
{
n++;
for(int i=0; i<N-2; i++)
{
for(int j=0; j<N; j++)
fprintf(fout, "%d ", ++n);
fprintf(fout, "\n");
}
for(int j=0; j<N-1; j++)
fprintf(fout, "%d ", ++n);
fprintf(fout, "%d\n", n+N-1);
fprintf(fout, "1 ");
for(int j=1; j<N-1; j++)
fprintf(fout, "%d ", ++n);
fprintf(fout, "%d\n", n+2);
}
return 0;
}