I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3757 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 171 |
2 | adamant | 164 |
3 | awoo | 163 |
4 | TheScrasse | 159 |
5 | nor | 155 |
6 | maroonrk | 154 |
7 | -is-this-fft- | 152 |
8 | Petr | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
I'm unable to do weekday rounds all summer, and there are probably others with a similar situation.
Название |
---|
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.