| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 19972 | qataro | 동전 (kriii4_E) | C++98 | 0 ms | 1576 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 <cstdio>
#include <vector>
using namespace std;
int main()
{
int n;
scanf("%d", &n);
vector<long long> winCnt(n + 3);
winCnt[1] = 1;
winCnt[2] = 1;
///winCnt[3] = 2;
for(int i = 3; i <= n; i++)
winCnt[i] = winCnt[i - 1] + winCnt[i-1]/2 + (i-2)/2 + i%2;
printf("%lld", winCnt[n] % 1000000007);
return 0;
}
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||