Pagini recente » Cod sursa (job #3179193) | Cod sursa (job #3274302) | Cod sursa (job #126193) | Cod sursa (job #70716) | Cod sursa (job #2731527)
#include <fstream>
using namespace std;
int n, m, pas, v[510][510];
int main(){
ifstream fin("piese.in");
ofstream fout("piese.out");
fin >> n >> m;
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
if (v[i][j] == 0) {
pas++;
int lg = 1;
while (i + lg * 2 - 1 <= n && j + lg * 2 - 1 <= m) {
lg *= 2;
}
for (int i2 = i; i2 <= i + lg - 1; i2++) {
for (int j2 = j; j2 <= j + lg - 1; j2++) {
v[i2][j2] = pas;
}
}
}
}
}
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) {
fout << v[i][j] << " ";
}
fout << "\n";
}
return 0;
}