Pagini recente » Cod sursa (job #71036) | Cod sursa (job #2032150) | Cod sursa (job #1948100) | Cod sursa (job #2778426) | Cod sursa (job #2730025)
#include <fstream>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,m,i,j,k,l,ii,jj,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) {
k++;
l=1;
while (i+2*l-1<=n && j+2*l-1<=m)
l*=2;
for (ii=1;ii<=l;ii++)
for (jj=1;jj<=l;jj++)
a[i+ii-1][j+jj-1]=k;
}
fout<<k<<"\n";
for (i=1;i<=n;i++) {
for (j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
return 0;
}