Pagini recente » Cod sursa (job #2849723) | Cod sursa (job #791259) | Cod sursa (job #2651952) | Cod sursa (job #1984104) | Cod sursa (job #2905248)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n, m, l, cnt, i, j, x, y;
int a[501][501];
int main(){
fin>>n>>m;
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
if(!a[i][j]){
cnt++;
l=1;
while(i+2*l-1 <= n && j+2*l-1 <=m){
l*=2;
}
for(x=1;x<=l;x++){
for(y=1;y<=l;y++){
a[x+i-1][y+j-1]=cnt;
}
}
}
}
}
fout<<cnt<<"\n";
for(i=1;i<=n;i++){
for(j=1;j<=m;j++){
fout<<a[i][j]<<" ";
}
fout<<endl;
}
return 0;
}