I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 157 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
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.