Pagini recente » Cod sursa (job #3194566) | Cod sursa (job #347825) | Cod sursa (job #1916638) | Cod sursa (job #963353) | Cod sursa (job #961350)
Cod sursa(job #961350)
#include <fstream>
using namespace std;
int N, M, sol;
int A[510][501];
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 (!A[i][j])
{
int where = 0;
for (int k = 8; k >= 0; k--)
if ( i + (1 << k) - 1 <= N && j + (1 << k) - 1 <= M && !A[i + (1 << k) - 1][j + (1 << k) - 1])
{
where = k;
k = -1;
}
sol++;
for (int I = i; I <= i + (1 << where) - 1; I++)
for (int J = j; J <= j + (1 << where) - 1; J++)
A[I][J] = sol;
}
fout << sol << '\n';
for (int i = 1; i <= N; i++, fout << '\n')
for (int j = 1; j <= M; j++)
fout << A[i][j] << ' ';
}