Cod sursa(job #2316488)
Utilizator | Data | 11 ianuarie 2019 20:04:13 | |
---|---|---|---|
Problema | Tablete | Scor | 50 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 2.16 kb |
#include <bits/stdc++.h>
#define Dim 1002
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int N,K,T[Dim][Dim],nr,V[Dim];
int main()
{
f>>N>>K;
if(K%2==0)
{
if(N%2==0)
{
for(int i=1;i<=N;i++) for(int j=1;j<=N;j++)
{
nr++; g<<nr<<" ";
if(j==N) g<<'\n';
}
}
}else
{
if(N%2==0)
{
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(i<N)
{
nr++;
T[i][j]=nr;
if(j==K)
{
nr++;
T[i][j]=nr;
T[i-1][N]=nr-1;
}
if(j==N) nr--;
}else
{
if(j==1) T[i][j]=K,nr=N*N-N;
else
{
nr++;
T[i][j]=nr;
if(j==K)
{
T[N-1][N]=nr+1;
nr++;
}
}
}
}else
{
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
if(i<N)
{
nr++;
T[i][j]=nr;
if(j==K&&(i%2!=0))
{
nr++;
T[i][j]=nr;
if(i!=1)
T[i-2][N]=nr-1;
}
if(j==N&&(i%2!=0)) nr--;
}else
{
if(j==1) T[i][j]=K,nr=N*N-N;
else
{
nr++;
T[i][j]=nr;
if(j==K)
{
T[N-2][N]=nr+1;
nr++;
}
}
}
}
for(int i=1;i<=N;i++)
for(int j=1;j<=N;j++)
{ V[T[i][j]]++;
g<<T[i][j]<<" ";
if(j==N) g<<'\n';
}
for(int i=1;i<=N*N;i++) cout<<V[i]<<" "<<i<<'\n';
}
return 0;
}