Submission #920848

#	Time	Username	Problem	Language	Result	Execution time	Memory
920848		Sir_Ahmed_Imran	Fibonacci representations (CEOI18_fib)	C++17	0 / 100	1 ms	348 KiB

fib

                              ///~~~LOTA~~~///
#include <bits/stdc++.h>
using namespace std;
#define nl '\n'
#define ff first
#define ss second
#define add insert
#define ll long long 
#define append push_back
#define all(x) (x).begin(),(x).end()
#define pii pair<int,int>
#define N 200001
ll mod=1e9;
void solve(){
    int n,m;
    cin>>n;
    ll o=1;
    for(int i=0;i<n;i++){
        cin>>m;
        if(m>1) o=(o*2)%mod;
        cout<<o<<nl;
    }
}
int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    solve();
    return 0;
}

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