oj.uz

Submission #22642

# Submission time Handle Problem Language Result Execution time Memory
22642 2017-04-30T06:05:22 Z 거북선(#966, fpdjsns) Fully Generate (KRIII5_FG) C++
0 / 7
 0 ms 41264 KB 
#include<iostream>
#include<math.h>
#include<vector>

using namespace std;

int n;
int arr[10000000] = { 0 };
pair<int, int> c;
long long mod = 1000000007;
long long ans = 1;

void cal2(int num, int a)
{
	long long temp = pow(num, a / 2);
	if ((a % 2) == 0)
	{
		ans = ans*temp%mod;
		ans = ans*temp%mod;
	}
	else
	{
		ans = ans*num%mod;
		cal2(num, a - 1);
	}
}
void go(int num, int sum)
{
	if (arr[num] == 0)
		arr[num] = c.first;
	int tsum = sum + arr[num];
	if (tsum >= n)
	{
		cal2(num, n - sum);
		ans %= mod;
		return;
	}
	//pop
	c.second--;
	cal2(num, c.first);
	ans %= mod;
	arr[num] = c.first;
	//push
	if (c.second == 0)
	{
		c.first++;
		c.second = arr[c.first];
	}
	go(num + 1, tsum);
}

int main()
{
	cin >> n;
	arr[1] = 1;
	arr[2] = 2;
	c.first = 1;
	c.second = 1;
	go(1, 0);
	cout << ans;

	return 0;
}

Subtask #1
0 / 2.0

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

Subtask #2
0 / 5.0

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