# | User | Rating |
---|---|---|
1 | tourist | 3671 |
2 | jiangly | 3653 |
3 | Um_nik | 3629 |
4 | Benq | 3513 |
5 | ksun48 | 3486 |
6 | MiracleFaFa | 3466 |
7 | slime | 3452 |
8 | maroonrk | 3422 |
9 | Radewoosh | 3406 |
10 | greenheadstrange | 3393 |
# | User | Contrib. |
---|---|---|
1 | awoo | 187 |
2 | YouKn0wWho | 182 |
2 | -is-this-fft- | 182 |
4 | Um_nik | 179 |
5 | Monogon | 177 |
6 | antontrygubO_o | 171 |
7 | maroonrk | 165 |
8 | adamant | 164 |
9 | SecondThread | 163 |
10 | SlavicG | 161 |
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
if it has "*" or "+" then it is not a string of digits.
[Deleted]
That's not the same problem.
Oh my bad
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.
Спасибо за объяснение