Cod sursa(job #1560296)
Utilizator | Data | 2 ianuarie 2016 13:54:35 | |
---|---|---|---|
Problema | Tablete | Scor | 100 |
Compilator | cpp | Status | done |
Runda | Arhiva de probleme | Marime | 1.95 kb |
#include<fstream>
using namespace std;
ifstream f("tablete.in");
ofstream g("tablete.out");
int a[1005][1005],n,k,i,j,nr,con;
int main()
{
f>>n>>k;
if(k%2==0)
{
for(i=1;i<=n;i++)
for(j=1;j<=k;j++)
{
nr++;
a[i][j]=nr;
}
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
nr++;
a[i][j]=nr;
}
}
if(k%2==1)
{
i=1;
while(con<n/2)
{
con++;
for(j=1;j<k;j++)
{
nr++;
a[i][j]=nr;
}
nr++;
a[i][k]=nr+1;
i++;
a[i][1]=nr;
nr++;
for(j=2;j<=k;j++)
{
nr++;
a[i][j]=nr;
}
i++;
}
if(n%2==0)
{
for(i=1;i<=n;i++)
for(j=k+1;j<=n;j++)
{
nr++;
a[i][j]=nr;
}
}
else if(n%2==1)
{
i=n;
for(j=1;j<k;j++)
{
nr++;
a[i][j]=nr;
}
nr++;
a[i][k]=nr+1;
a[1][k+1]=nr;
nr++;
for(j=k+2;j<=n;j++)
{
nr++;
a[1][j]=nr;
}
for(i=2;i<=n;i++)
for(j=k+1;j<=n;j++)
{
nr++;
a[i][j]=nr;
}
}
}
for(i=1;i<=n;i++)
{
for(j=1;j<=n;j++)
g<<a[i][j]<<" ";
g<<"\n";
}
return 0;
}