Jerry and Fibonacci
All submissions for this problem are available.
Today, as usual, Jerry comes up with a new puzzle for Tom. Jerry knows very well that Tom is well aware of the concepts of fibonacci series. So he intends to present the problem with a twist. By choosing any random integer Jerry asks Tom to tell whether the given number is a fibonacci number.
- The first line of the input contains an integer T denoting the number of test cases.
- Next T lines which contain a random number N chosen by Jerry.
- For each input random integer you need to tell if the integer is fibo number or not. If the integer is fibo number output "is fibo" otherwise output "not fibo".
- 1 ≤ T ≤ 20
- 1 ≤ N ≤ 1*10^9
Input: 3 1 3 7 Output: is fibo is fibo not fibo
|Time Limit:||2 sec|
|Source Limit:||50000 Bytes|
|Languages:||C, CPP14, JAVA, PYTH, PYTH 3.6|
Fetching successful submissions