Cod sursa(job #2390013)
Utilizator | Data | 27 martie 2019 18:10:30 | |
---|---|---|---|
Problema | Piese | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.69 kb |
#include <bits/stdc++.h>
using namespace std;
ifstream fin("piese.in");
ofstream fout("piese.out");
int n,m,k,p,v[501][501];
int main ()
{
cin>>m>>n;
for(int i=1;i<=m;i++)
{
for(int j=1;j<=n;j++)
{
if(!v[i][j])
{
k=1;
while(i+2*k-1<=m && j+2*k-1<=n)
k=k<<1;
p++;
for(int lin=i;lin<i+k;lin++)
for(int col=j;col<j+k;col++)
v[lin][col]=p;
}
}
}
cout<<p<<'\n';
for(int i=1;i<=m;i++){
for(int j=1;j<=n;j++)
cout<<v[i][j]<<" ";
cout<<'\n';
}
}