oj.uz

답안 #424809

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
424809 2021-06-12T10:30:25 Z tc_abd Fibonacci representations (CEOI18_fib) C++14
0 / 100
 4000 ms 204 KB 
#define fast ios_base::sync_with_stdio(0),cin.tie(0),cout.tie(0)
#define mem(dp,x) memset(dp,x,sizeof(dp))
#define pii pair<int,int>
#include <bits/stdc++.h>
#define pll pair<ll,ll>
#define ll long long
#define pb push_back
#define mid (l+r)/2
#define S second
#define F first
using namespace std;
const int inf = 1e9+9;
const int mod = 1e9+7;
ll n,s;
ll a[109];
ll F[109];
ll bt(ll id,ll sum){
    if(id == 16){
        if(sum == s) return 1;
        return 0;
    }
    return bt(id+1,sum)+bt(id+1,sum+F[id]);
}
int main(){
    fast,cin>>n;
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    F[1] = 1; F[2] = 2;
    for(int i=3;i<=15;i++){
        F[i] = F[i-1] + F[i-2];
    }
    for(int i=0;i<n;i++){
        s += F[a[i]];
        cout<<bt(1,0)<<endl;
    }
}

Subtask #1
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 3 ms 204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 4013 ms 204 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #6
0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Incorrect 2 ms 204 KB Output isn't correct
3 Halted 0 ms 0 KB -