Pagini recente » Cod sursa (job #395194) | Cod sursa (job #1066163) | Cod sursa (job #466384) | Cod sursa (job #2898576) | Cod sursa (job #920787)
Cod sursa(job #920787)
#include <cstdio>
using namespace std;
int n,m,i,j,nr,p;
int a[501][501];
bool blank(int x,int y,int leng)
{
int i,j;
for(i=x;i<=x+leng-1;i++)
for(j=y;j<=y+leng-1;j++)
if(a[i][j]!=0)
return false;
return true;
}
void umplere(int x,int y,int leng)
{
int i,j;
nr++;
for(i=x;i<=x+leng-1;i++)
for(j=y;j<=y+leng-1;j++)
a[i][j]=nr;
}
void execut(int intindere)
{
int j,i;
for(i=1;i<=n-intindere+1;i++)
for(j=1;j<=m-intindere+1;j++)
{
if(blank(i,j,intindere)==true)
umplere(i,j,intindere);
}
}
int main()
{
freopen("piese.in","r",stdin);
freopen("piese.out","w",stdout);
scanf("%d%d",&n,&m);
p=1;
while(p<=n&&p<=m)
p*=2;
p/=2;
while(p!=1)
{
execut(p);
p/=2;
}
execut(1);
printf("%d\n",nr);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
printf("%d ",a[i][j]);
printf("\n");
}
return 0;
}