Submission #950294

#TimeUsernameProblemLanguageResultExecution timeMemory
950294berrFibonacci representations (CEOI18_fib)C++17
0 / 100
1 ms452 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int mod =1e9+7; signed main(){ ios_base::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<int> a(n); int cnt=1; for(auto &i: a) i=cnt*cnt, cnt++; int ans=1; for(int i=0; i<n; i++){ if(a[i]==1) cout<<ans<<" "; else ans*=2, ans%=mod, cout<<ans<<" "; } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...