Pagini recente » Cod sursa (job #1232897) | Cod sursa (job #378334) | Cod sursa (job #2062321) | Cod sursa (job #2403435) | Cod sursa (job #2188774)
#include <fstream>
using namespace std;
int n,m,i,j,k,pas,l,c,v[510][510];
int main (){
ifstream fin ("piese.in");
ofstream fout ("piese.out");
fin>>n>>m;
pas=0;
for (i=1;i<=n;i++) {
for (j=1;j<=m;j++) {
if (v[i][j]==0) {
k=1;
while (i+2*k-1<=n&&j+2*k-1<=m)
k*=2;
pas++;
for (l=i;l<i+k;l++)
for (c=j;c<j+k;c++)
v[l][c]=pas;
}
}
}
fout<<pas<<"\n";
for (i=1;i<=n;i++){
for (j=1;j<=m;j++)
fout<<v[i][j]<<" ";
fout<<"\n";
}
}