| № | Пользователь | Рейтинг |
|---|---|---|
| 1 | jiangly | 3810 |
| 2 | Benq | 3676 |
| 3 | Kevin114514 | 3655 |
| 4 | maroonrk | 3463 |
| 5 | strapple | 3447 |
| 6 | Um_nik | 3387 |
| 7 | heuristica | 3322 |
| 8 | turmax | 3317 |
| 9 | tourist | 3307 |
| 10 | jiangbowen | 3291 |
| Страны | Города | Организации | Всё → |
| № | Пользователь | Вклад |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 141 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 136 |
| 8 | BledDest | 132 |
| 9 | maroonrk | 131 |
| 10 | qwexd | 129 |
|
0
72449591 You can look this. I hope this can help you |
|
0
For B, I think violence will time out, so I turned to finding the rule. After writing a few, I found that when I value K, the composition of strings after operation is like this. First, it is from a [k] to a [len] Then judge whether the parity of K and Len is the same, and then continue from a [1] to a [k-1] The difference is from a [k-1] to a [1]. I hope my approach can help you |
|
0
For B, I think violence will time out, so I turned to finding the rule. After writing a few, I found that when I value K, the composition of strings after operation is like this. First, it is from a [k] to a [len] Then judge whether the parity of K and Len is the same, and then continue from a [1] to a [k-1] The difference is from a [k-1] to a [1]. I hope my approach can help you |
|
0
The test data of question C in this competition does not exceed the 32-bit integer range, so do you calculate the rating this time? |
|
0
Thank you very much |
|
+1
How do I know if D Euler(m / gcd(a,m) ) |
|
0
How do you make GCD (a, m) = GCD (b, m) |
