| # | User | Rating |
|---|---|---|
| 1 | tourist | 3985 |
| 2 | jiangly | 3814 |
| 3 | jqdai0815 | 3682 |
| 4 | Benq | 3529 |
| 5 | orzdevinwang | 3526 |
| 6 | ksun48 | 3517 |
| 7 | Radewoosh | 3410 |
| 8 | hos.lyric | 3399 |
| 9 | ecnerwala | 3392 |
| 9 | Um_nik | 3392 |
| # | User | Contrib. |
|---|---|---|
| 1 | cry | 169 |
| 2 | maomao90 | 162 |
| 2 | Um_nik | 162 |
| 4 | atcoder_official | 161 |
| 5 | djm03178 | 158 |
| 6 | -is-this-fft- | 157 |
| 7 | adamant | 155 |
| 8 | awoo | 154 |
| 8 | Dominater069 | 154 |
| 10 | luogu_official | 150 |
Given two integers a and b (1 <= a, b <= 1e5). m = 1e9 + 7.
There will be up to 1e5 steps. In each step-
1. Two integers t (1 <= t <= 2) and c (1 <= c <= 1e5) are given. If t = 1, multiply a by c. Else if t = 2, multiply b by c.
2. Find the value of (a % b) % m.
Note that, a or b may be changed after each step.
btw, it's not any OJ problem. I'm just interested about the solution.
SCOREBOARD
We see 69'th team solved 3 problems in 1 minute!! :O
I'm just wondered how is this possible? Were the problems very easy?
Just asking...
