Remind you that round will start in half an hour. The first thousand passes on. Link U can discuss tasks here after the end of the round, Good Luck!
# | User | Rating |
---|---|---|
1 | jiangly | 3640 |
2 | Benq | 3593 |
3 | tourist | 3572 |
4 | orzdevinwang | 3561 |
5 | cnnfls_csy | 3539 |
6 | ecnerwala | 3534 |
7 | Radewoosh | 3532 |
8 | gyh20 | 3447 |
9 | Rebelz | 3409 |
10 | Geothermal | 3408 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 173 |
2 | adamant | 164 |
3 | awoo | 161 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 152 |
8 | pajenegod | 146 |
9 | BledDest | 144 |
10 | Um_nik | 143 |
Name |
---|
World chart showing
1000 * #Remaining / #Qualification_round
taken from Google CodeJam statistics page.Chart with
#Remaining
only (colors are not the best)Can anyone tell me whats wrong with my code for problem A which passes the small input, but not the large one? My idea is, that I count for every position the number of substring which could end at this position and sum them all up in the end...
Maybe accumulate is the problem:
vector<int> v(m);
return accumulate(v.begin(),v.end(),0);
will returnint
instead oflong long
template <class InputIterator, class T>
T accumulate ( InputIterator first, InputIterator last, T init );
accumulate(v.begin(),v.end(),0**LL**);
Thank you, got it!
why the analysis for 1B round hasn't been published yet?