if it isn't regular can you tell me why i get bad verdicts a lot? 
| # | User | Rating |
|---|---|---|
| 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 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 156 |
| 2 | nik_exists | 150 |
| 2 | maspy | 150 |
| 4 | Um_nik | 142 |
| 5 | Errichto | 139 |
| 6 | adamant | 137 |
| 7 | AmShZ | 135 |
| 8 | BledDest | 132 |
| 8 | maroonrk | 132 |
| 10 | qwexd | 129 |
if it isn't regular can you tell me why i get bad verdicts a lot? 
Hey Codeforces Community! I wanted to request to update the rating after cf round 1114 (div. 3) contest usually The rate was changed a day after the contest(ig 12 hours because the contests are regularly at 18:05 at Iran Standard Time(UTC+3:30)) but for this contest, we've been waiting for longer time. Can someone explain the reason?
Hello..I was solving problems of cf round 1083 Div.2 and when i encountered problem B i was fighting with time limit error i used the famous O(sqrt(n)) algorithm to detect prime numbers..but is there an algorithm from better order or not?
Thank you for reading:)
| Name |
|---|


