fork download
copy 
  1. import java.util.*;
  2. import java.lang.*;
  3. import java.io.*;
  4.  
  5. class Main
  6. {
  7. 	public static int fibo(int n) {
  8. 		if (n <= 2) return n;
  9. 		else return fibo(n - 1) + fibo(n - 2);
  10. 	}
  11.  
  12. 	public static void main (String[] args) throws java.lang.Exception
  13. 	{
  14. 		Scanner sc;
  15. 		if (args.length == 1) {
  16. 			sc = new Scanner(new File(args[0])); 
  17. 		} else {
  18. 			sc = new Scanner(System.in);
  19. 		}
  20.  
  21. 		while(sc.hasNextInt()) {
  22. 			int seq = sc.nextInt();
  23. 			if (seq <= 1) System.out.println(seq);
  24. 			else System.out.println(fibo(seq - 1));
  25. 		}
  26. 	}
  27. }
Success #stdin #stdout 0.09s 380608KB
comments (?)
stdin
copy 
0
1
2
3
stdout
copy 
0
1
1
2
https://ideone.com/suhbGX
The Fibonacci series is defined as: F(0) = 0; F(1) = 1; F(n) = F(n-1) F(n-2) when n>1. Given a positive integer 'n', print out the F(n).
language:
Java (12.0.1)
created:
9 years ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!