Take a quick look at this problem.
According to the given definitions of the functions, doesn't it make f(x,y) = gcd(x,y)?!
I can't think of why it's not true but the solution using this assumption is giving wrong answer.
I think I am missing something but I don't know what it is..
| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 3690 |
| 2 | jiangly | 3647 |
| 3 | Benq | 3581 |
| 4 | orzdevinwang | 3570 |
| 5 | Geothermal | 3569 |
| 5 | cnnfls_csy | 3569 |
| 7 | Radewoosh | 3509 |
| 8 | ecnerwala | 3486 |
| 9 | jqdai0815 | 3474 |
| 10 | gyh20 | 3447 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | maomao90 | 174 |
| 2 | awoo | 164 |
| 3 | adamant | 163 |
| 4 | TheScrasse | 159 |
| 5 | nor | 157 |
| 6 | maroonrk | 156 |
| 7 | -is-this-fft- | 152 |
| 8 | Petr | 146 |
| 8 | orz | 146 |
| 10 | BledDest | 145 |
The link is not accessible . Maybe it is in gym section or it requires separate registration to accessm
Check the second example for $$$f(x, y)$$$: $$$gcd(525, 63) = 21$$$, $$$f(525, 63) = 63$$$. Another counterexample would be $$$x = 3$$$ and $$$y = 9$$$: $$$gcd(3, 9) = 3$$$, whereas $$$f(3, 9) = 9$$$.
No it is not. You should make a correct brute-force solution, then you can make a loop to check if they are the same