Cod sursa(job #2390010)
| Utilizator | Data | 27 martie 2019 18:09:29 | |
|---|---|---|---|
| Problema | Piese | Scor | 100 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.55 kb |
#include<bits/stdc++.h>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,m,k,pas;
int a[505][505];
int main()
{
fin>>n>>m;
for (int i=1;i<=n;i++)
for (int j=1;j<=m;j++)
if (a[i][j]==0)
{
k=1;
while(i+2*k-1<=n && j+2*k-1<=m)
k*=2;
pas++;
for (int l=i;l<i+k;l++)
for (int c=j;c<j+k;c++)
a[l][c]=pas;
}
fout<<pas<<'\n';
for (int i=1;i<=n;i++)
{
for (int j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<'\n';
}
return 0;
}
