728x90
๋ฐ์ํ
https://programmers.co.kr/learn/courses/30/lessons/12945
def solution(n):
fibo = [0, 1, 1]
for i in range(3, n + 1):
fibo.append( ( fibo[i-1] + fibo[i-2] ) % 1234567 )
return fibo[-1]
์ด๋ ต์ง๋ง, ๋์์ ๋๋ค!
#include <string>
#include <vector>
using namespace std;
int solution(int n) {
vector<int> fibo = {0, 1, 1};
for(int i=3; i<=n; i++ )
fibo.push_back( ( fibo[i-1] + fibo[i-2] ) % 1234567 );
return fibo.back();
}
728x90
๋ฐ์ํ
'๐๊ณต๋ถ > ์ฝ๋ฉํ ์คํธ' ์นดํ ๊ณ ๋ฆฌ์ ๋ค๋ฅธ ๊ธ
๋ฐฑ์ค - ATM, ํ์ด์ฌ (0) | 2021.12.05 |
---|---|
๋ฐฑ์ค - ๋์ 0(๊ทธ๋ฆฌ๋ ์๊ณ ๋ฆฌ์ฆ), ํ์ด์ฌ & C (0) | 2021.12.05 |
ํ๋ก๊ทธ๋๋จธ์ค - ์ต๋๊ฐ๊ณผ ์ต์๊ฐ, ํ์ด์ฌ (0) | 2021.11.22 |
ํ๋ก๊ทธ๋๋จธ์ค - NULL ์ฒ๋ฆฌํ๊ธฐ, MySQL (0) | 2021.11.22 |
ํ๋ก๊ทธ๋๋จธ์ค - ์ ํ๋ฒํธ ๋ชฉ๋ก, ํ์ด์ฌ & C++ (0) | 2021.11.21 |