# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
950312 | berr | Fibonacci representations (CEOI18_fib) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mod =1e9+7;
int mul(int x, int y){
return (x*y)%mod;
}
int poww(int x, int y){
if(y==0) return 1;
int tmp =poww(x, y/2);
tmp=mul(tmp, tmp);
if(y%2) return mul(tmp, x);
return tmp;
}
signed main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
//73 sayı var
int n; cin >> n;
vector<int> a(n);
int cnt=1;
for(auto &i: a) cin >> i;
set<int> st;
for(int i=0; i<n; i++){
int ans=1;
st.insert(a[i]);
int l=0;
for(auto h: st){
ans=mul(ans, (h-l-1)/2+1);
l=h;
}
cout<<ans<<"\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |