C# 백준 10870번 피보나치 수5

2022. 1. 3. 17:25C#/[백준] 재귀

문제

코드 :

using System;

namespace _2
{
    class Program
    {
        static void Main(string[] args)
        {
            int N = Convert.ToInt32(Console.ReadLine());
            int F = 0;
            int FMinus1 = 0;
            int FMinus2 = 1;
            int count = 1;
            int output = Fibonacci(N, F, count, FMinus1, FMinus2);

            Console.WriteLine(output);
        }

        public static int Fibonacci(int N, int F, int count, int FMinus1,  int FMinus2)
        {
            if (N == 0)
                return 0;
            else if (N == 1)
                return 1;

            if (count == N)
                return F;

            //tmp = sum;
            F = FMinus1 + FMinus2;
            FMinus1 = FMinus2;
            FMinus2 = F;
            count += 1;
            //Console.WriteLine("F : {0}, FMinus1 : {1}, FMinus2 : {2}, count : {3}", F, FMinus1 ,FMinus2, count);


            return Fibonacci(N, F, count, FMinus1, FMinus2);
        }
    }

}

 

'C# > [백준] 재귀' 카테고리의 다른 글

C# 백준 10872번 팩토리얼  (0) 2022.01.03