№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3831 |
3 | Radewoosh | 3646 |
4 | jqdai0815 | 3620 |
4 | Benq | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | gamegame | 3386 |
10 | ksun48 | 3373 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | cry | 164 |
1 | maomao90 | 164 |
3 | Um_nik | 163 |
4 | atcoder_official | 160 |
5 | -is-this-fft- | 158 |
6 | awoo | 157 |
7 | adamant | 156 |
8 | TheScrasse | 154 |
8 | nor | 154 |
10 | Dominater069 | 153 |
Название |
---|
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.