for me it wa quite a problem , since i strictly used C++ to solve it.
# | User | Rating |
---|---|---|
1 | tourist | 4009 |
2 | jiangly | 3823 |
3 | Benq | 3738 |
4 | Radewoosh | 3633 |
5 | jqdai0815 | 3620 |
6 | orzdevinwang | 3529 |
7 | ecnerwala | 3446 |
8 | Um_nik | 3396 |
9 | ksun48 | 3390 |
10 | gamegame | 3386 |
# | User | Contrib. |
---|---|---|
1 | cry | 167 |
2 | Um_nik | 163 |
3 | maomao90 | 162 |
3 | atcoder_official | 162 |
5 | adamant | 159 |
6 | -is-this-fft- | 158 |
7 | awoo | 156 |
8 | TheScrasse | 154 |
9 | Dominater069 | 153 |
9 | nor | 153 |
for me it wa quite a problem , since i strictly used C++ to solve it.
Name |
---|
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.