Viru and his Unique Series

All submissions for this problem are available.
Viru is crazy about Fibbonaci series and challenges his friend Kushu that he can solve any question related to the same. Kushu however feels jealous and after thinking for a long time he came up with a problem.He made slight changes in fibbonaci series.
By definition, the first two numbers in the Fibonacci sequence are 0 and 1, and each subsequent number is the sum of the previous two. In mathematical terms, the sequence F(n) of Fibonaci numbers is defined by the recurrence relation 
F(n) = F(n1) + F(n2), F(0) = 0, F(1) = 1.
but kushu create a new unique series in which U(n) = U(n2) U(n1) and first two numbers are 100 and 97
so sequence are the numbers in the following integer sequence: 100, 97, 3, 94, 91, 185, 176 ...
Kushu ask viru to find nth number in this series if nth number is positive then print "yipee" if it's negitive than viru is not satisfy with this so print "not a fibbonaci" .
Input
Input description.
 The first line contains T i.e. the number of test cases.
.  T lines follow, each line containing an integer,N
Output
 For each testcase, print the output that Kushu wants in one line.
Constraints
 1 ≤ T ≤ 10^9
 1 ≤ N ≤ 10^5
Example
Input: 2 1 5 Output: yipee not a fibbonaci
Code
#include<stdio.h> long long int uni[100000]={0},t,n; int main() { uni[0]=100; uni[1]=97; scanf("%ld",t); do { for(int i=2;i<100000;i) { uni[i]=uni[i2]uni[i1]; } scanf("%ld",n); if(uni[n1]<0) { printf("yipee"); } else { printf("not a fibbonaci"); } }while(t); return 0; }
Steps to be followed
1. Read the given description carefully and understand the problem.
2. Analyze the code given in the problem and find bugs(errors) in these codes..
3. The given code can be copied and compiled in an online compiler (Eg. ideone.com).
4. Once the bugs are eliminated from the code, the clean code can be submitted as the solution to the problem..
5. The solution should be a debugged version of the code provided and must satisfy the test cases to be accepted..
Author:  vipinkhushu 
Tags  cdwr2016, easy, vipinkhushu 
Date Added:  8032016 
Time Limit:  1 sec 
Source Limit:  50000 Bytes 
Languages:  C, CPP14, PYTH, PYTH 3.6, PYPY, PYP3 
Comments
 Please login at the top to post a comment.
SUCCESSFUL SUBMISSIONS
Fetching successful submissions
HELP
If you are still having problems, see a sample solution here. 