-
Notifications
You must be signed in to change notification settings - Fork 9
/
Fibonacci.java
74 lines (74 loc) · 1.6 KB
/
Fibonacci.java
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
import java.util.*;
public class Fibonacci
{int n[],m[],c;
public void input()
{
Scanner sc=new Scanner(System.in);
System.out.println("Enter the number of inputs (>2)");
c=sc.nextInt();
n=new int[c];
m=new int[c];
System.out.println("Enter the numbers");
for (int i=0;i<c;i++)
{
n[i]=sc.nextInt();
}
}
public boolean check()
{int ch=0;
m[0]=0;
m[1]=1;
for (int i=2;i<c;i++)
{
m[i]=m[i-1]+m[i-2];
}
if (n[0]==m[0])
{
for (int i=0;i<c;i++)
{
if(n[i]==m[i])
ch=ch+1;
}
if (ch==c)
return true;
else
return false;
}
for (;m[0]<n[0];)
{
int t=m[c-2]+m[c-1];
for (int i=0;i<c-1;i++)
{
m[i]=m[i+1];
}
m[c-1]=t;
}
if (n[0]==m[0])
{
for (int i=0;i<c;i++)
{
if(n[i]==m[i])
ch=ch+1;
}
if (ch==c)
return true;
else
return false;
}
else
return false;
}
public void output()
{
if (check())
System.out.println("Numbers are in Fibonacci series");
else
System.out.println("Numbers are not in Fibonacci series");
}
public static void main(String args[])
{
Fibonacci ob=new Fibonacci();
ob.input();
ob.output();
}
}