Pagini recente » Clasament preoni61b | Cod sursa (job #2327113) | Cod sursa (job #2759132) | Cod sursa (job #551651) | Cod sursa (job #2905348)
#include <fstream>
using namespace std;
ifstream fin ("piese.in");
ofstream fout("piese.out");
int n,m,a[501][501],P,i1,j1,nr,i,j;
int main()
{
fin>>n>>m;
nr=0;
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
if(a[i][j]==0)
{
nr++;
P=512;
while(i+P-1>n||j+P-1>m)
P=P/2;
for(i1=i;i1<=P+i-1;i1++)
{
for(j1=j;j1<=P+j-1;j1++)
a[i1][j1]=nr;
}
}
}
}
fout<<nr<<"\n";
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
fout<<a[i][j]<<" ";
fout<<"\n";
}
}