Cod sursa(job #2009956)
| Utilizator | Data | 11 august 2017 13:08:29 | |
|---|---|---|---|
| Problema | Piese | Scor | 100 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.81 kb |
#include <iostream>
#include <fstream>
using namespace std;
ifstream si("piese.in");
ofstream so("piese.out");
int v[12];
int a[505][505];
int main()
{
int n,m;
si>>n>>m;
int cont=0;
for(int i=256;i>=1;i>>=1)
if(n>=i&&m>=i)
for(int j=1;j<=n;++j)
for(int k=1;k<=m;++k)
if(a[j][k]==0)
if(j+i-1<=n&&k+i-1<=m)
{
++cont;
for(int x=j;x<j+i;++x)
for(int y=k;y<k+i;++y)
a[x][y]=cont;
}
so<<cont<<'\n';
for(int i=1;i<=n;++i)
{
for(int j=1;j<=m;++j)
so<<a[i][j]<<" ";
so<<'\n';
}
return 0;
}
