CareerCup

public static int fib(int n) {
	if(n<=1)
		return 1;
	else
		fib(n-1) + fib(n-2);
}

void fibanocci();
void main(){

//int y=1;
fibanocci(0,0);

}
void fibanocci(int t,int d){
int a=t+d;
if(a==0){
a=1;}/*
if(a>144000){
return;}*/
printf("%d\n",a);
fibanocci(d,a);

}

void fibanocci();
void main(){

//int y=1;
printf("enter range of fibanocci");
int n;
scanf("%d",&n);
printf("0,");

fibanocci(0,0,n);
printf("\r");

}
void fibanocci(int t,int d,int n){
static int ky=0;

int a=t+d;
if(a==0){
a=1;}/*
if(a>144000){
return;}*/
printf("%d,",a);
ky++;
if(ky<n-1){
fibanocci(d,a,n);}
else {return;}
}

import java.io.*;
class fib
{
public static void main(String args[])throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str=br.readLine();
int n=Integer.parseInt(str);
n=fib(n);
System.out.println("Fibb is "+n);
}
public static int fib(int n){
if(n==1 | n==0)return 1;
else return fib(n-1)+fib(n-2);

}}

fibonacci_series_recursive_method_dangerous(int n) {
    exit(0);
}

import java.io.*;
class Solution
{
public static void main(String args[])throws Exception
{
BufferedReader br=new BufferedReader(new InputStreamReader(System.in));
String str=br.readLine();
int n=Integer.parseInt(str);
n=fib(n);
System.out.println("Fibb is "+n);
}
public static int fib(int n){
    if(n==1 | n==0)return 1;
    else return n + fib(n-1);
}

public class A
{
public static void main(String[] args)
{
int f = 1 ;
Scanner sc = new Scanner(System.in) ;
System.out.println("Enter Any Value");
int x = sc.nextInt() ;
for(int i = 0; i<x; i++)
{
f = m1(x) ;

}
System.out.println(f);
}

private static int m1(int x)
{
int f = 1 ;
for(int i =x; i>0; i--)
{
f = f*i ;
}
return f;
}
}

public int fibonacciNum (int index)
	{
		 if(index <= 2)
			 return 1;
		 else
			 return fibonacciNum(index -1) + fibonacciNum(index -2);		
	}

fibonacci(0,1);

void fibonacci(a,b){
  print b;
  fibonacci(b,a+b)
}

public int fib(int n) {
        if (n <= 1) {
            return n;
        }
        return fib(n - 2) + fib(n - 1);
    }