제출 #444153

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
444153		LittleCube	Fibonacci representations (CEOI18_fib)	C++14	0 / 100	1 ms	332 KiB

fib

#include <bits/stdc++.h>
#define ll long long
#define pii pair<int, int>
#define F first
#define S second
using namespace std;

int dp[15001] = {0}, fib[21] = {0, 1, 2, 3, 5, 8, 13, 21, 34, 55, 89, 144, 233, 377, 610, 987, 1597, 2584, 4181, 6765, 10946};

signed main()
{
    int N;
    cin >> N;
    dp[0] = 1;
    for (int j = 1; j <= 20; j++)
        for (int i = 15000; i >= fib[j]; i++)
            dp[i] += dp[i] - fib[j];
    int sum = 0;
    for (int i = 1; i <= N; i++)
    {
        int x;
        cin >> x;
        sum += fib[x];
        cout << dp[sum] << '\n';
    }
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 20
• Subtask 3: 0 / 15
• Subtask 4: 0 / 10
• Subtask 5: 0 / 15
• Subtask 6: 0 / 35