Pagini recente » Cod sursa (job #1515777) | Cod sursa (job #131368) | Cod sursa (job #1461238) | Cod sursa (job #1846732) | Cod sursa (job #567165)
Cod sursa(job #567165)
#include<cstdio>
using namespace std;
const char in[]="piese.in";
const char out[]="piese.out";
const int D_Max = 505;
int A[D_Max][D_Max], N, M, sol, p;
int main()
{
freopen(in,"r", stdin);
freopen(out,"w",stdout);
scanf("%d %d", &N, &M);
for(int i = 0; i < N ; ++i)
for(int j = 0 ; j < M ;++j)
{
if(!A[i][j])
{
++sol;
p = 1;
while( i + (2*p) <= N && j + (2*p) <= M)p *= 2;
for(int ii = i ; ii < i + p ; ++ii)
for(int jj = j ; jj < j + p ; ++jj)
A[ii][jj] = sol;
}
}
printf("%d\n", sol);
for(int i = 0 ; i < N ; ++i){
for(int j = 0 ; j < M ;++j)
printf("%d ", A[i][j]);
printf("\n");}
return 0;
}