Hi, As you know practice tasks are published in the last week, if you know solutions can you share some hints, thanks in advance.
# | User | Rating |
---|---|---|
1 | ecnerwala | 3650 |
2 | Benq | 3582 |
3 | Geothermal | 3570 |
3 | orzdevinwang | 3570 |
5 | cnnfls_csy | 3569 |
6 | tourist | 3565 |
7 | maroonrk | 3532 |
8 | Radewoosh | 3522 |
9 | Um_nik | 3483 |
10 | jiangly | 3468 |
# | User | Contrib. |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 158 |
6 | maroonrk | 156 |
7 | -is-this-fft- | 151 |
8 | SecondThread | 147 |
9 | orz | 146 |
10 | pajenegod | 145 |
Hi, As you know practice tasks are published in the last week, if you know solutions can you share some hints, thanks in advance.
Name |
---|
problem 2 : here
problem 3 keyword: two pointers
thanks a lot
I used two pointers in third problem, but I can't get last 35 points... (If the restriction of the number of calling the row(a,b) method is 400000, it is easy...)
http://gyazo.com/5cefc933b359b884bb437c493811c89a
Yes , you should think of some trick and use the advantage that function row return the number of bridges.
this happened with me too! first coded 4*n rows calls solution then I tried not to make the pointers back one step and got 100%
I found 3*n rows calls solution but couldn't find any better algorithms...
My AC solution for 3rd problem makes exactly 2N calls to function "row" and then uses a very standard pointer walk to report bridges in order. I'd like to know what is the most interesting approach for problem "birthday".
I think it's great that practice tasks are open for anyone to submit. Does anyone know if it'll be also possible for the actual competition's tasks ? Perhaps we can hope for a live online contest ?
Euler's polynomial theorem.
please, show me example solution on pascal!!!