| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3823 |
| 3 | Benq | 3738 |
| 4 | Radewoosh | 3633 |
| 5 | jqdai0815 | 3620 |
| 6 | orzdevinwang | 3529 |
| 7 | ecnerwala | 3446 |
| 8 | Um_nik | 3396 |
| 9 | ksun48 | 3390 |
| 10 | gamegame | 3386 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 167 |
| 2 | Um_nik | 163 |
| 3 | maomao90 | 162 |
| 3 | atcoder_official | 162 |
| 5 | adamant | 159 |
| 6 | -is-this-fft- | 158 |
| 7 | awoo | 156 |
| 8 | TheScrasse | 154 |
| 9 | Dominater069 | 153 |
| 9 | nor | 153 |
C++ Question
Hi, Codeforces Community!
I recently looked to a programm written by a participant in the contest, and I noticed this function, which is finding the greatest common devisor of two numbers.
long long int gcd(lli a, lli b) { return (b == 0LL ? a : gcd(b, a % b)); }
But I don't understand how this part (b == 0LL ? a : gcd(b, a % b)) of the function is working. Can anyone explain please?
| Rev. | Lang. | By | When | Δ | Comment | |
|---|---|---|---|---|---|---|
| en2 |
|
Vahagn_Grigoryan | 2021-04-18 10:39:55 | 20 | Tiny change: ' int gcd(lli a, lli b) { retu' -> ' int gcd(long long int a, long long int b) { retu' | |
| en1 |
|
Vahagn_Grigoryan | 2021-04-18 10:38:52 | 409 | Initial revision (published) |
