oj.uz

Submission #22334

# Submission time Handle Problem Language Result Execution time Memory
22334 2017-04-30T04:00:43 Z Lazy Against The Machine(#969, unused, celicath, Paruelain) Fully Generate (KRIII5_FG) C++14
2 / 7
 500 ms 626116 KB 
#include <stdio.h>

long long arr[40000000];
long long nuj[40000000];

long long mod = 1000000007;
// calculate n^k % m
long long modpow(long long n, long long k)
{
	long long ret = 1;
	while (k)
	{
		if (k & 1)
			ret = (ret * n) % mod;
		n = (n * n) % mod;
		k /= 2;
	}
	return ret;
}

int main()
{
	arr[1] = 1;
	arr[2] = 2;
	nuj[1] = 1;
	nuj[2] = 3;

	long long sum = 1;
	long long start = 2;

	long long end = 2;

	long long n;
	scanf("%lld", &n);

	for (int i = 2;; i++)
	{
		for (int j = 0; j < arr[i]; j++)
		{
			arr[start + j] = i;
			nuj[start + j] = nuj[start + j - 1] + i;
			if (nuj[start + j] >= n)
			{
				end = start + j;
				goto hell;
			}
		}
		start += arr[i];
	}
hell:
	long long result = 1;
	for (long long i = 2; i < end; i++)
	{
		result = (result * modpow(i, arr[i])) % mod;
	}
	printf("%lld\n", (result * modpow(end, n - nuj[end - 1])) % mod);
	return -0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:28:12: warning: unused variable 'sum' [-Wunused-variable]
  long long sum = 1;
            ^
FG.cpp:34:19: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld", &n);
                   ^

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 626116 KB Output is correct
2 Correct 0 ms 626116 KB Output is correct
3 Correct 0 ms 626116 KB Output is correct
4 Correct 0 ms 626116 KB Output is correct
5 Correct 0 ms 626116 KB Output is correct
6 Correct 0 ms 626116 KB Output is correct
7 Correct 0 ms 626116 KB Output is correct
8 Correct 0 ms 626116 KB Output is correct
9 Correct 0 ms 626116 KB Output is correct
10 Correct 0 ms 626116 KB Output is correct
11 Correct 0 ms 626116 KB Output is correct
12 Correct 0 ms 626116 KB Output is correct
13 Correct 0 ms 626116 KB Output is correct
14 Correct 0 ms 626116 KB Output is correct
15 Correct 0 ms 626116 KB Output is correct
16 Correct 0 ms 626116 KB Output is correct
17 Correct 0 ms 626116 KB Output is correct
18 Correct 0 ms 626116 KB Output is correct
19 Correct 0 ms 626116 KB Output is correct
20 Correct 0 ms 626116 KB Output is correct
21 Correct 0 ms 626116 KB Output is correct
22 Correct 0 ms 626116 KB Output is correct
23 Correct 0 ms 626116 KB Output is correct
24 Correct 0 ms 626116 KB Output is correct
25 Correct 0 ms 626116 KB Output is correct
26 Correct 0 ms 626116 KB Output is correct
27 Correct 0 ms 626116 KB Output is correct
28 Correct 0 ms 626116 KB Output is correct
29 Correct 0 ms 626116 KB Output is correct
30 Correct 0 ms 626116 KB Output is correct
31 Correct 0 ms 626116 KB Output is correct
32 Correct 0 ms 626116 KB Output is correct
33 Correct 0 ms 626116 KB Output is correct
34 Correct 0 ms 626116 KB Output is correct
35 Correct 0 ms 626116 KB Output is correct
36 Correct 0 ms 626116 KB Output is correct
37 Correct 0 ms 626116 KB Output is correct
38 Correct 0 ms 626116 KB Output is correct
39 Correct 0 ms 626116 KB Output is correct
40 Correct 0 ms 626116 KB Output is correct
41 Correct 0 ms 626116 KB Output is correct
42 Correct 0 ms 626116 KB Output is correct
43 Correct 0 ms 626116 KB Output is correct
44 Correct 0 ms 626116 KB Output is correct
45 Correct 0 ms 626116 KB Output is correct
46 Correct 0 ms 626116 KB Output is correct
47 Correct 0 ms 626116 KB Output is correct
48 Correct 0 ms 626116 KB Output is correct
49 Correct 0 ms 626116 KB Output is correct
50 Correct 0 ms 626116 KB Output is correct

Subtask #2
0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 626116 KB Output is correct
2 Correct 0 ms 626116 KB Output is correct
3 Correct 0 ms 626116 KB Output is correct
4 Correct 0 ms 626116 KB Output is correct
5 Correct 0 ms 626116 KB Output is correct
6 Correct 0 ms 626116 KB Output is correct
7 Correct 0 ms 626116 KB Output is correct
8 Correct 0 ms 626116 KB Output is correct
9 Correct 0 ms 626116 KB Output is correct
10 Correct 0 ms 626116 KB Output is correct
11 Correct 0 ms 626116 KB Output is correct
12 Correct 0 ms 626116 KB Output is correct
13 Correct 0 ms 626116 KB Output is correct
14 Correct 0 ms 626116 KB Output is correct
15 Correct 0 ms 626116 KB Output is correct
16 Correct 0 ms 626116 KB Output is correct
17 Correct 0 ms 626116 KB Output is correct
18 Correct 0 ms 626116 KB Output is correct
19 Correct 0 ms 626116 KB Output is correct
20 Correct 0 ms 626116 KB Output is correct
21 Correct 0 ms 626116 KB Output is correct
22 Correct 0 ms 626116 KB Output is correct
23 Correct 0 ms 626116 KB Output is correct
24 Correct 0 ms 626116 KB Output is correct
25 Correct 0 ms 626116 KB Output is correct
26 Correct 0 ms 626116 KB Output is correct
27 Correct 0 ms 626116 KB Output is correct
28 Correct 0 ms 626116 KB Output is correct
29 Correct 0 ms 626116 KB Output is correct
30 Correct 0 ms 626116 KB Output is correct
31 Correct 0 ms 626116 KB Output is correct
32 Correct 0 ms 626116 KB Output is correct
33 Correct 0 ms 626116 KB Output is correct
34 Correct 0 ms 626116 KB Output is correct
35 Correct 0 ms 626116 KB Output is correct
36 Correct 0 ms 626116 KB Output is correct
37 Correct 0 ms 626116 KB Output is correct
38 Correct 0 ms 626116 KB Output is correct
39 Correct 0 ms 626116 KB Output is correct
40 Correct 0 ms 626116 KB Output is correct
41 Correct 0 ms 626116 KB Output is correct
42 Correct 0 ms 626116 KB Output is correct
43 Correct 0 ms 626116 KB Output is correct
44 Correct 0 ms 626116 KB Output is correct
45 Correct 0 ms 626116 KB Output is correct
46 Correct 0 ms 626116 KB Output is correct
47 Correct 0 ms 626116 KB Output is correct
48 Correct 0 ms 626116 KB Output is correct
49 Correct 0 ms 626116 KB Output is correct
50 Correct 0 ms 626116 KB Output is correct
51 Execution timed out 500 ms 626116 KB Execution timed out
52 Halted 0 ms 0 KB -