Pagini recente » Cod sursa (job #2910941) | Cod sursa (job #2458315) | Cod sursa (job #1877159) | Cod sursa (job #1024528) | Cod sursa (job #1798931)
#include<fstream>
using namespace std;
ifstream f("piese.in");
ofstream g("piese.out");
int n,m,i,j,k,l,p,nr,a[502][502];
int main()
{
f>>n>>m;
for(i=1;i<=n;++i)
for(j=1;j<=m;++j)
if(!a[i][j])
{
p=1;
++nr;
while(i+p*2-1<=n&&j+p*2-1<=m) p*=2;
for(k=i;k<i+p;++k)
for(l=j;l<j+p;++l) a[k][l]=nr;
}
g<<nr<<'\n';
for(i=1;i<=n;++i,g<<'\n')
for(j=1;j<=m;g<<a[i][j]<<' ',++j);
return 0;
}