| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3839 |
| 3 | Radewoosh | 3646 |
| 4 | jqdai0815 | 3620 |
| 4 | Benq | 3620 |
| 6 | orzdevinwang | 3612 |
| 7 | Geothermal | 3569 |
| 7 | cnnfls_csy | 3569 |
| 9 | ecnerwala | 3494 |
| 10 | Um_nik | 3396 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Um_nik | 164 |
| 2 | maomao90 | 160 |
| 3 | -is-this-fft- | 159 |
| 4 | atcoder_official | 158 |
| 4 | awoo | 158 |
| 4 | cry | 158 |
| 7 | adamant | 155 |
| 8 | nor | 154 |
| 9 | TheScrasse | 152 |
| 10 | maroonrk | 151 |
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.
if a =3 b = 4 no of step =1 ans= (3%4)%m; if no step = 2 .there is no change ? i can do the same thing or in each step you give a and b then we can do the same thing. if you want to maximize or minimize things then its an another issue.
sorry if i guess wrong. better you can clarify the problem more
Blog is updated. Hope now u can understand.