oj.uz

Submission #19972

# Submission time Handle Problem Language Result Execution time Memory
19972 2016-02-25T07:59:29 Z qataro 동전 (kriii4_E) C++
0 / 100
 0 ms 1576 KB 
#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;
}

Subtask #1
0.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 1576 KB Output is correct
2 Correct 0 ms 1576 KB Output is correct
3 Correct 0 ms 1576 KB Output is correct
4 Correct 0 ms 1576 KB Output is correct
5 Correct 0 ms 1576 KB Output is correct
6 Correct 0 ms 1576 KB Output is correct
7 Correct 0 ms 1576 KB Output is correct
8 Incorrect 0 ms 1576 KB Output isn't correct
9 Halted 0 ms 0 KB -

Subtask #2
0.0 / 95.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -