codeforces-scrape

Codeforces scraped problems and editorials
git clone git://git.laack.co/codeforces-scrape.git
Log | Files | Refs | README

371B.md (1731B)


      1 Source: https://codeforces.com/problemset/problem/371/B
      2 
      3 B. Fox Dividing Cheese
      4 
      5 time limit per test
      6 
      7 1 second
      8 
      9 memory limit per test
     10 
     11 256 megabytes
     12 
     13 input
     14 
     15 stdin
     16 
     17 output
     18 
     19 stdout
     20 
     21 Two little greedy bears have found two pieces of cheese in the forest of weight *a* and *b* grams, correspondingly. The bears are so greedy that they are ready to fight for the larger piece. That's where the fox comes in and starts the dialog: "Little bears, wait a little, I want to make your pieces equal" "Come off it fox, how are you going to do that?", the curious bears asked. "It's easy", said the fox. "If the mass of a certain piece is divisible by two, then I can eat exactly a half of the piece. If the mass of a certain piece is divisible by three, then I can eat exactly two-thirds, and if the mass is divisible by five, then I can eat four-fifths. I'll eat a little here and there and make the pieces equal".
     22 
     23 The little bears realize that the fox's proposal contains a catch. But at the same time they realize that they can not make the two pieces equal themselves. So they agreed to her proposal, but on one condition: the fox should make the pieces equal as quickly as possible. Find the minimum number of operations the fox needs to make pieces equal.
     24 
     25 Input
     26 
     27 The first line contains two space-separated integers *a* and *b* (1 ≤ *a*, *b* ≤ 109).
     28 
     29 Output
     30 
     31 If the fox is lying to the little bears and it is impossible to make the pieces equal, print -1. Otherwise, print the required minimum number of operations. If the pieces of the cheese are initially equal, the required number is 0.
     32 
     33 Examples
     34 
     35 Input
     36 
     37 ```
     38 15 20
     39 ```
     40 
     41 Output
     42 
     43 ```
     44 3
     45 ```
     46 
     47 Input
     48 
     49 ```
     50 14 8
     51 ```
     52 
     53 Output
     54 
     55 ```
     56 -1
     57 ```
     58 
     59 Input
     60 
     61 ```
     62 6 6
     63 ```
     64 
     65 Output
     66 
     67 ```
     68 0
     69 ```