I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
| # | User | Rating |
|---|---|---|
| 1 | Benq | 3676 |
| 2 | Kevin114514 | 3659 |
| 3 | jiangly | 3640 |
| 4 | turmax | 3450 |
| 5 | tourist | 3408 |
| 6 | strapple | 3360 |
| 7 | Um_nik | 3354 |
| 8 | squareOf105 | 3348 |
| 9 | maroonrk | 3312 |
| 10 | idontwannadothis…e | 3191 |
| # | User | Contrib. |
|---|---|---|
| 1 | Qingyu | 155 |
| 2 | nik_exists | 151 |
| 3 | maspy | 149 |
| 4 | AmShZ | 145 |
| 5 | Um_nik | 143 |
| 6 | Errichto | 139 |
| 7 | BledDest | 136 |
| 8 | adamant | 134 |
| 9 | maroonrk | 132 |
| 10 | cry | 130 |
I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
| Name |
|---|



Well anyway, if there was a weekend round, more people would be able to participate -- including me :D
And BTW, I really like your Subset Sums problem on SPOJ, I've just started on the site about 3 or 4 days ago, and I'm trying to solve more and more problems. You know what's really cool about it? The acronyms of the approaches one may use are very similar! ( BF ( Brute Force ) + BS ( Binary Search ) ) Although I think there's a better, more efficient approach.