Pagini recente » Cod sursa (job #3273002) | Cod sursa (job #636909) | Cod sursa (job #363142) | Cod sursa (job #1110855) | Cod sursa (job #2913701)
///#include "iostream"
#include <fstream>
using namespace std ;
ifstream cin ("piese.in") ;
ofstream cout ("piese.out") ;
int n, m, v[505][505] ;
int main()
{
int pieces = 0, lat ;
cin >> n >> m ;
for (int i = 1 ; i <= n ; i ++)
{
for (int j = 1 ; j <= m ; j ++)
{
if (v[i][j] == 0)
{
pieces ++ ;
lat = 1 ;
while (2 * lat - 1 + i <= n && 2 * lat - 1 + j <= m)
lat *= 2 ;
for (int i1 = 1 ; i1 <= lat ; i1 ++)
for (int j1 = 1 ; j1 <= lat ; j1 ++)
v[i + i1 - 1][j + j1 - 1] = pieces ;
}
}
}
cout << pieces << '\n' ;
for (int i = 1 ; i <= n ; i ++)
{
for (int j = 1 ; j <= m ; j ++)
cout << v[i][j] << ' ' ;
cout << '\n' ;
}
return 0 ;
}