백준 소스코드 [C++] 14495 피보나치 비스무리한 수열

www.acmicpc.net/problem/14495

14495번: 피보나치 비스무리한 수열

백준 소스코드 [C++] 14495 피보나치 비스무리한 수열

#include <iostream>
#include <algorithm>
#include <queue>
#include <string>
#include <deque>
#include <limits.h>
#include <vector>
#include <math.h>
#include <stack>
#include <bitset>
#include <string.h>
#include <set>
#include <map>
#include <unordered_map>
#include <sstream>
#include <cstdlib>
#include <cassert>
#define all(v) v.begin(), v.end()
#define pii pair<int, int>
#define pli pair<ll, int>
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), v.end())
typedef long long ll;
using namespace std;

int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    int n;
    cin >> n;
    ll first = 1, second = 1, third=1, fourth=1;
    for (int i = 3;i < n;i++) {
        fourth = first+third;
        first = second;
        second = third;
        third = fourth;
    }
    cout << third << '\n';
    return 0;
}