Cod sursa(job #2905150)
Utilizator | Data | 19 mai 2022 20:54:31 | |
---|---|---|---|
Problema | Piese | Scor | 100 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.66 kb |
#include <fstream>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,m,i,j,l,ic,jc,cnt,a[501][501];
int main() {
fin>>n>>m;
for (i=1;i<=n;i++)
for (j=1;j<=m;j++)
if (a[i][j]==0) {
cnt++;
l=1;
while (i+2*l-1<=n && j+2*l-1<=m)
l*=2;
for (ic=1;ic<=l;ic++)
for (jc=1;jc<=l;jc++)
a[i+ic-1][j+jc-1]=cnt;
}
fout<<cnt<<"\n";
for (i=1;i<=n;i++) {
for (j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}