Cod sursa(job #2255867)
Utilizator | Data | 7 octombrie 2018 17:40:56 | |
---|---|---|---|
Problema | Tablete | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.42 kb |
#include <iostream>
#include <fstream>
#define NMAX 1005
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int n,k,a[NMAX][NMAX],nr,i,j;
bool v[NMAX*NMAX];
int main()
{
f>>n>>k;
//Completez linia k
//Daca k este par atunci a[i][k]=i*k
//Daca k este impar atunci cand i este par a[i][k]=i*k iar cand i este impar a[i][k]=i*k+1;
if(k%2==0)
{
for(i=1;i<=n;i++)
{
a[i][k]=i*k;
v[i*k]=1;
}
}
else
{
for(i=1;i<=n;i++)
{
a[i][k]=i*k+i%2;
v[i*k+i%2]=1;
}
}
nr=1;
for(i=1;i<=n;i++)
{
j=1;
while(j<k)
{
if(v[nr]==0)
{
a[i][j]=nr;
v[nr]=1;
nr++;
j=j+1;
}
else
{
nr++;
}
}
}
for(i=1;i<=n;i++)
{
j=k+1;
while(j<=n)
{
if(v[nr]==0)
{
a[i][j]=nr;
v[nr]=1;
nr++;
j=j+1;
}
else
{
nr++;
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
{
g<<a[i][j]<<" ";
}
g<<"\n";
}
return 0;
}