# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
624628 | Blagoj | Rack (eJOI19_rack) | C++14 | 1 ms | 212 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;
typedef unsigned long long int ull;
typedef long long int ll;
typedef long double ld;
int main()
{
cin.tie(0);
cout.tie(0);
ios::sync_with_stdio(0);
ull n, k, mod = 1000000007;
cin >> n >> k;
ull dp[n + 1];
dp[0] = 1;
for (int i = 1; i <= n; i++)
{
dp[i] = (dp[i - 1] * 2) % mod;
}
vector<ull> v = {1, dp[n - 1] + 1};
ull sum = n - 2;
if (k == 1)
{
cout << 1;
return 0;
}
if (k == 2)
{
cout << v[1];
return 0;
}
while (sum > 0)
{
ull sz = v.size();
for (ull i = 0; i < sz; i++)
{
if ((i + 1) + sz == k)
{
cout << (ull)(v[i] + dp[sum]) % mod;
return 0;
}
if (sum > 1)
{
v.push_back((v[i] + dp[sum]) % mod);
}
}
sum--;
}
}
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... |