for me it wa quite a problem , since i strictly used C++ to solve it.
№ | Пользователь | Рейтинг |
---|---|---|
1 | tourist | 3690 |
2 | jiangly | 3647 |
3 | Benq | 3581 |
4 | orzdevinwang | 3570 |
5 | Geothermal | 3569 |
5 | cnnfls_csy | 3569 |
7 | Radewoosh | 3509 |
8 | ecnerwala | 3486 |
9 | jqdai0815 | 3474 |
10 | gyh20 | 3447 |
Страны | Города | Организации | Всё → |
№ | Пользователь | Вклад |
---|---|---|
1 | maomao90 | 174 |
2 | awoo | 164 |
3 | adamant | 163 |
4 | TheScrasse | 159 |
5 | nor | 157 |
6 | maroonrk | 155 |
7 | -is-this-fft- | 152 |
8 | Petr | 146 |
8 | orz | 146 |
10 | BledDest | 145 |
for me it wa quite a problem , since i strictly used C++ to solve it.
Название |
---|
my fault , sorry
actually the problem is : finding the minimum c++ variable type(byte,short,int,long etc) in which nth fibonacci number can be accomodated .
if it cant be accomodated in c++ standard var types then print "BigInteger" .
However, since Fibonacci sequence grows fast, you can write program for direct computation.
UPD: Or you mean "help me to write the program for Fibonacci sequence computation?"
After that just some if's.