| # | User | Rating |
|---|---|---|
| 1 | tourist | 4009 |
| 2 | jiangly | 3773 |
| 3 | Radewoosh | 3646 |
| 4 | ecnerwala | 3624 |
| 5 | jqdai0815 | 3620 |
| 5 | Benq | 3620 |
| 7 | orzdevinwang | 3612 |
| 8 | Geothermal | 3569 |
| 8 | cnnfls_csy | 3569 |
| 10 | gyh20 | 3447 |
| # | User | Contrib. |
|---|---|---|
| 1 | awoo | 161 |
| 2 | maomao90 | 160 |
| 3 | cry | 157 |
| 3 | nor | 157 |
| 5 | atcoder_official | 156 |
| 6 | -is-this-fft- | 155 |
| 7 | maroonrk | 154 |
| 8 | adamant | 153 |
| 9 | Um_nik | 152 |
| 10 | djm03178 | 146 |
Hi people!
Is there a way to check list of users who have added me as friend in Codeforces? I have a feeling of guilt when someone friends me, but I don't friend him/her :(
If no, is there some API that allows it or some client-side addon?
Please answer fast :D
Hello! Can you help me with this task (I came up with it myself).
Task: You get an NxN matrix consisting of zeros and ones. You also have an operation where you can 3x3 submatrix turn into zeros. Your task is to convert all ones to zeros with as few operations as possible.
The size of N is unknown, but I was aiming for N <= 2000.
Input: You get integer N and matrix of size NxN. It can only have zeros and ones.
Output: Print integer, the minimal number of operations.
Example:
5
00100
11111
00100
00100
00000
Answer: 2
