# | 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 | 162 |
4 | TheScrasse | 160 |
5 | nor | 159 |
6 | maroonrk | 156 |
7 | SecondThread | 154 |
8 | pajenegod | 147 |
9 | BledDest | 145 |
9 | Um_nik | 145 |
Name |
---|
fibonacci can be done faster
there's also a closed form (Binet's Formula)
Se da un sir de cifre separate prin operatori '*' sau '+'. Avand voie sa faci maxim K interschimbari intre operatori, aflati valoarea maxima a expresiei.
Am o problema mai calitativa.
Se da un sir de cifre separate prin operatori '*', '+', '-', '/', '^', '&', 'XOR', '!' '|'. Avand voie sa faci maxim K interschimbari intre operatori, aflati valoarea maxima a expresiei.
Marinush
[Deleted]
That's not the same problem.
You are wrong, it is Romanian TST Junior problem. (Which it in of itself means it is cleeaarly not reappearing on some lost cses page)
Also I forgot: number of digits is <= 1000 and number of '*' is <= 18.