제출 #962928

#제출 시각아이디문제언어결과실행 시간메모리
962928vjudge1Fibonacci representations (CEOI18_fib)C++14
0 / 100
1 ms348 KiB
#include<bits/stdc++.h> using namespace std; #define int long long const int N=1e5+10, mod=1e9+7; int n, a[N], f[N]; int32_t main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); cin >> n; for (int i=1; i<=n; ++i) cin >> a[i]; for (int i=1; i<=n; ++i){ sort(a+1, a+i+1); f[1]=(a[1]+1)/2; for (int j=2; j<=i; ++j){ f[j]=(f[j-1]*(a[j]-a[j-1])/2-1)%mod; } cout << f[i] << '\n'; } return 0; }
#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...