Submission #22424

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
22424	2017-04-30T04:32:48 Z	Lazy Against The Machine(#969, unused, celicath, Paruelain)	Fully Generate (KRIII5_FG)	C++14	2 / 7	500 ms	2992 KB

#include <stdio.h>

long long arr[60000];
long long nuj[60000];
long long nuj2[60000];
long long str[60000];

long long mod = 1000000007;
// calculate n^k % m
long long modpow(long long n, long long k)
{
	long long ret = 1;
	n %= mod;
	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;
	nuj2[1] = 1;
	nuj2[2] = 3;
	str[1] = 1;
	str[2] = 2;

	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;
			nuj2[start + j] = nuj2[start + j - 1] + arr[start + j] * (start + j);
			str[start + j] = str[start + j - 1] + arr[start + j - 1];
			if (nuj2[start + j] >= n)
			{
				end = start + j;
				goto hell;
			}
		}
		start += arr[i];
	}
hell:
	long long result = 1;
	for (long long i = 2; i < end; i++)
	{
		long long r = 1;
		for (long long j = str[i]; j < str[i + 1]; j++)
			r = (r * j) % mod;
		result = (result * modpow(r, i)) % mod;
	}
	long long rem = n - nuj2[end - 1];
	long long rr = end;
	for (long long j = str[end];; j++)
	{
		if (rem < rr)
		{
			result = (result * modpow(j, rem)) % mod;
			break;
		}
		rem -= rr;
		result = (result * modpow(j, rr)) % mod;
	}
	printf("%lld\n", result);
	return -0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:35:12: warning: unused variable 'sum' [-Wunused-variable]
  long long sum = 1;
            ^
FG.cpp:41: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	Memory	Grader output
1	Correct	2992 KB	Output is correct
2	Correct	2992 KB	Output is correct
3	Correct	2992 KB	Output is correct
4	Correct	2992 KB	Output is correct
5	Correct	2992 KB	Output is correct
6	Correct	2992 KB	Output is correct
7	Correct	2992 KB	Output is correct
8	Correct	2992 KB	Output is correct
9	Correct	2992 KB	Output is correct
10	Correct	2992 KB	Output is correct
11	Correct	2992 KB	Output is correct
12	Correct	2992 KB	Output is correct
13	Correct	2992 KB	Output is correct
14	Correct	2992 KB	Output is correct
15	Correct	2992 KB	Output is correct
16	Correct	2992 KB	Output is correct
17	Correct	2992 KB	Output is correct
18	Correct	2992 KB	Output is correct
19	Correct	2992 KB	Output is correct
20	Correct	2992 KB	Output is correct
21	Correct	2992 KB	Output is correct
22	Correct	2992 KB	Output is correct
23	Correct	2992 KB	Output is correct
24	Correct	2992 KB	Output is correct
25	Correct	2992 KB	Output is correct
26	Correct	2992 KB	Output is correct
27	Correct	2992 KB	Output is correct
28	Correct	2992 KB	Output is correct
29	Correct	2992 KB	Output is correct
30	Correct	2992 KB	Output is correct
31	Correct	2992 KB	Output is correct
32	Correct	2992 KB	Output is correct
33	Correct	2992 KB	Output is correct
34	Correct	2992 KB	Output is correct
35	Correct	2992 KB	Output is correct
36	Correct	2992 KB	Output is correct
37	Correct	2992 KB	Output is correct
38	Correct	2992 KB	Output is correct
39	Correct	2992 KB	Output is correct
40	Correct	2992 KB	Output is correct
41	Correct	2992 KB	Output is correct
42	Correct	2992 KB	Output is correct
43	Correct	2992 KB	Output is correct
44	Correct	2992 KB	Output is correct
45	Correct	2992 KB	Output is correct
46	Correct	2992 KB	Output is correct
47	Correct	2992 KB	Output is correct
48	Correct	2992 KB	Output is correct
49	Correct	2992 KB	Output is correct
50	Correct	2992 KB	Output is correct

Subtask #2
0 / 5.0

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

Submission #22424

Compilation message

Subtask #1 2.0 / 2.0

Subtask #2 0 / 5.0

Subtask #1
2.0 / 2.0

Subtask #2
0 / 5.0