Submission #22460

#	Time	Username	Problem	Language	Result	Execution time	Memory
22460		이대회 트래쉬 대회에야옹 (#40)	Fully Generate (KRIII5_FG)	C++14	2 / 7	9 ms	6360 KiB

FG

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <vector>
#include <stack>
#include <queue>
#include <functional>
#include <map>
#include <set>
#include <string>

using namespace std;

int N, K, T;
int con[1111111] = { 0, 1, 2, 2, 3, 3 };
int idx = 6;

int main()
{
	cin >> N;
	int i = 4;
	while (idx <= N)
	{
		int val = con[i];
		for (int j = 0; j < val; j++)
		{
			con[idx++] = i;
			if (idx > N)
				break;
		}
		i++;
	}

	long long mult = 1;
	for (int i = 1; i <= N; i++)
		mult = (mult * con[i]) % 1000000007;

	cout << mult % 1000000007;
}

• Subtask 1: 2 / 2
• Subtask 2: 0 / 5