Fibonum

CodeChefOpen on judge ↗

XOXO likes to play with numbers.So,given a number N help XOXO to find whether it is a fibonacci number or not.It won't be hard! Input First line contains T denoting the number of test case. The next T line contains an integer N Output For every test case print(without quotes) "Yes" if N is a fibonacci number else output "No" Constraints - 1 ≤ T ≤ 10000 - 1 ≤ N ≤ 100000 Example Input:

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI