Pagini recente » Cod sursa (job #428996) | Borderou de evaluare (job #1330982) | Cod sursa (job #306177) | Borderou de evaluare (job #1138861) | Cod sursa (job #2905408)
#include <fstream>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,m,a[502][502],l,nr;
int main()
{
fin>>m>>n;
for(int i=1; i<=n; i++)
{
for(int j=1; j<=m; j++)
{
if(a[i][j]==0)
{
nr++;
l=1;
while(2*l+i-1<=n && 2*l+j-1<=m)
{
l*=2;
}
for(int k=1;k<=l;k++)
{
for(int p=1;p<=l;p++)
{
a[i+k-1][j+p-1]=nr;
}
}
}
fout<<nr<<"\n";
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
fout<<a[i][j]<<" ";
}
fout<<"\n";
}
}
}
return 0;
}