Pagini recente » Cod sursa (job #1685268) | Cod sursa (job #1138609) | Cod sursa (job #671167) | Cod sursa (job #2219757) | Cod sursa (job #2316604)
#include<fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
long v[1001][1001], n, k;
void printMatrix()
{
long i, j;
for(i = 1 ; i <= n ; i++){
for(j = 1 ; j <= n ; j++)
g<<v[i][j]<<" ";
g<<'\n';
}
}
int main()
{
long nr = 1, i, j;
f>>n>>k;
if(k % 2 == 0){
for(i = 1 ; i <= n ; i++)
for(j = 1 ; j <= k ; j++){
v[i][j] = nr;
nr++;
}
for(i = 1 ; i <= n ; i++)
for(j = k + 1 ; j <= n ; j++){
v[i][j] = nr;
nr++;
}
}
if(k % 2 == 1)
{
nr = 0;
for (i = 1; i <= n; i++)
{
for(j = 1; j <= k; j++){
nr++;
v[i][j] = nr;
}
if (i % 2 == 1)
{
v[i][k]++;
i++;
if (i <= n)
{
v[i][1] = nr;
nr ++;
for (j = 2; j <= k; j++){
nr++;
v[i][j] = nr;
}
}
}
}
if(n % 2 == 1)
{
v[1][k+1] = nr;
nr ++;
for (j = k + 2; j <= n; j++){
nr ++;
v[1][j] = nr;
}
for (i = 2; i <= n; ++i)
for (j = k + 1; j <= n; j++){
nr++;
v[i][j] = nr;
}
}
else
for (i = 1 ; i <= n ; i++)
for (j = k + 1 ; j <= n ; j++){
nr ++;
v[i][j] = nr;
}
}
printMatrix();
return 0;
}