This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
/// In The Name Of God
#include <bits/stdc++.h>
#define f first
#define s second
#define pb push_back
#define pp pop_back
#define mp make_pair
#define sz(x) (int)x.size()
#define sqr(x) ((x) * 1ll * (x))
#define all(x) x.begin(), x.end()
#define rep(i, l, r) for (int i = (l); i <= (r); i++)
#define per(i, l, r) for (int i = (l); i >= (r); i--)
#define Kazakhstan ios_base :: sync_with_stdio(0), cin.tie(0), cout.tie(0);
#define nl '\n'
#define ioi exit(0);
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
const int N = (int)5e5 + 7;
const int inf = (int)1e9 + 7;
const int mod = (int)1e9 + 7;
const ll linf = (ll)1e18 + 7;
const int dx[] = {-1, 0, 1, 0, 1, -1, -1, 1};
const int dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using namespace std;
int n;
int sz;
ll a[N], f[N];
map <ll, int> dp[200];
int calc(ll x, int l = 1) {
if (!x) return 1;
if (dp[l].count(x)) return dp[l][x];
int res = 0;
rep(i, l, sz) {
if (f[i] <= x) {
res += calc(x - f[i], i + 1);
res %= mod;
}
}
return dp[l][x] = res;
}
int main() {
#ifdef IOI2018
freopen ("in.txt", "r", stdin);
#endif
Kazakhstan
cin >> n;
rep(i, 1, n) {
cin >> a[i];
}
f[1] = 1;
f[2] = 2;
sz = 2;
while (f[sz] < (ll)1e16) {
++sz;
f[sz] = f[sz - 1] + f[sz - 2];
}
rep(i, 1, n) {
a[i] = f[a[i]];
a[i] += a[i - 1];
}
rep(i, 1, n) {
cout << calc(a[i]) << nl;
}
ioi
}
# | 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... |