Lifelog

#include int Fibo(int N){ if(N == 1){ return 0;} else if(N == 2){ return 1;} else{ return Fibo(N - 1) + Fibo(N - 2);} } int main(void){ int i; for(i = 1; i < 15; i++){ printf("%d ", Fibo(i));} } OUTPUT0 1 1 2 3 5 8 13 21 34 55 89 144 233

// Even Fibonacci numbers//400만 미만//짝수만#include int Fibo(int N); int main(void){ int i, j, arr[100] = {0, }, sum = 0; for(i = 1; i

#include int Factorial(int N){ if(N == 0){ return 1;} else{ return N * Factorial(N - 1);}} int main(void){ printf("1! = %d\n", Factorial(1));printf("2! = %d\n", Factorial(2));printf("3! = %d\n", Factorial(3));printf("4! = %d\n", Factorial(4));printf("9! = %d\n", Factorial(9));} OUTPUT1! = 1 2! = 2 3! = 6 4! = 24 9! = 362880