Pagini recente » Cod sursa (job #311185) | Cod sursa (job #1418395) | Cod sursa (job #1712611) | Cod sursa (job #1193393) | Cod sursa (job #2416012)
#include <bits/stdc++.h>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
const int NMAX = 505;
int a[NMAX][NMAX];
int main()
{
int n,m;
fin >> n >> m;
int numar=1;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
{
if(a[i][j]==0)
{
int p=1;
while(i+2*p-1<=n and j+2*p-1<=m) p*=2;
for(int l=i;l<=i+p-1;l++)
for(int c=j;c<=j+p-1;c++)
a[l][c]=numar;
numar++;
}
}
}
fout << numar-1 << '\n';
for(int i=1;i<=n;i++)
{
for(int j=1;j<=m;j++)
fout << a[i][j] << ' ';
fout << '\n';
}
return 0;
}