DWITE '10 R1 #3 - Power tiles - Olympiads Online Judge

DWITE '10 R1 #3 - Power tiles

View as PDF

Submit solution

All submissions

Best submissions

Points: 5

Time limit: 2.0s

Memory limit: 64M

Problem type

DWITE Online Computer Programming Contest, October 2010, Problem 3

You are given a rectangular floor that is to be tiled with square tiles. The tiles come in a variety of sizes, but they all measure in some power of two: $1$ $1$ , $2$ $2$ , $4$ $4$ , $8$ $8$ , etc. A $5 \times 6$ $5 \times 6$ space can be tiled with $30$ $30$ of the smallest tile, but the minimum number of tiles required is only $9$ $9$ . Refer to the pattern below.

The input will contain 5 lines, a pair of integers $1 \le N, M \le 10\,000$ $1 \leq N, M \leq 10 000$ , separated by a space.

The output will contain 5 lines, the minimum number of tiles necessary to exactly cover the $N$ $N$ by $M$ $M$ space.

Sample Input

Copy

Sample Output

Copy

Problem Resource: DWITE

Creative Commons Attribution-NonCommercial-ShareAlike 3.0 Unported

Comments

2

Plasmatic commented on Aug. 22, 2018, 10:15 p.m.

y'all and your fancy recursion solutions :v :v