I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
# | User | Rating |
---|---|---|
1 | tourist | 3856 |
2 | jiangly | 3747 |
3 | orzdevinwang | 3706 |
4 | jqdai0815 | 3682 |
5 | ksun48 | 3591 |
6 | gamegame | 3477 |
7 | Benq | 3468 |
8 | Radewoosh | 3462 |
9 | ecnerwala | 3451 |
10 | heuristica | 3431 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | -is-this-fft- | 162 |
3 | Dominater069 | 160 |
4 | Um_nik | 158 |
5 | atcoder_official | 157 |
6 | Qingyu | 155 |
7 | djm03178 | 151 |
7 | adamant | 151 |
9 | luogu_official | 150 |
10 | awoo | 147 |
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.