# | 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 |
TheForces Round #29 (Clown-Forces) Editorial
Idea:wuhudsm
If $$$m=4$$$ and $$$d=1$$$ output "YES". Otherwise, output "NO".
Idea:ishat_jha
Output top $$$8$$$ in TheForce rating.
Idea:imranakki
If $$$A \oplus B=2^k-1$$$ output "YES". Otherwise, output "NO".
Idea:KitasCraft
Output the memory limit of the $$$i$$$-th problem.
Idea:KitasCraft
Print the number of a blog with at least 1000 downvote (there are currently 8 blogs in total). the value of n actually represents the order of date, not the order from most downvoted blogs.
Idea:imranakki
Google "apple codeforce" to get the link: https://codeforces.net/problemset/problem/1843/D
Rev. | Lang. | By | When | Δ | Comment | |
---|---|---|---|---|---|---|
en5 | imranakki | 2024-04-01 12:19:29 | 670 | Tiny change: 'A$ and $B$\n$A = 18,' -> 'A$ and $B$.\n\n$A = 18,' | ||
en4 | wuhudsm | 2024-04-01 11:57:10 | 7 | |||
en3 | wuhudsm | 2024-04-01 10:21:48 | 5 | Tiny change: 'us B=2^k-1$ output ' -> 'us B=2^k-1(k>0)$ output ' | ||
en2 | wuhudsm | 2024-04-01 10:02:51 | 2 | Tiny change: 'lem/1843/D .\n\n</spoi' -> 'lem/1843/D\n\n</spoi' (published) | ||
en1 | wuhudsm | 2024-04-01 10:02:32 | 1432 | Initial revision (saved to drafts) |
Name |
---|