Pagini recente » Cod sursa (job #2066502) | Cod sursa (job #3246482) | Cod sursa (job #2386258) | Cod sursa (job #4072) | Cod sursa (job #1139646)
#include<fstream>
using namespace std;
int n, m, i, j, minim, l, ii, jj;
int a[501][501];
ifstream fin("piese.in");
ofstream fout("piese.out");
int main(){
fin>> n >> m;
minim = 0;
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
if(a[i][j] == 0){
l = 1;
while(i + l - 1 <= n && j + l - 1 <= m){
l *= 2;
}
l /= 2;
minim++;
for(ii = i; ii <=i + l - 1; ii++){
for(jj = j; jj <= j + l - 1; jj++){
a[ii][jj] = minim;
}
}
}
}
}
for(i = 1; i <= n; i++){
for(j = 1; j <= m; j++){
fout<< a[i][j] <<" ";
}
fout<<"\n";
}
return 0;
}