oj.uz

Submission #22399

# Submission time Handle Problem Language Result Execution time Memory
22399 2017-04-30T04:23:52 Z dried chocochip on Daegu asphalt(#897, suzy, zych1751, Acka) Fully Generate (KRIII5_FG) C++
2 / 7
 500 ms 314520 KB 
#include<bits/stdc++.h>

using namespace std;

const int INF = 1e9+7;
long long arr[40000000];

long long mul(long long n, long long m)
{
	long long ret = 1;
	while(m)
	{
		if(m%2)
			ret = (ret*n)%INF;
		n = (n*n)%INF;
		m /= 2;
	}
	return ret;
}

int main()
{
	long long ret = 1;
	arr[1] = 1;
	arr[2] = 2;

	long long n;
	scanf("%lld", &n);
	if(n == 1)
	{
		printf("1\n");
		return 0;
	}

	n--;
	long long cur = 2, idx = 2;
	for(int i = 2; i < 40000000; i++)
	{
		for(int j = 0; j < arr[i]; j++)
		{
			if(idx == 40000000)	break;
			arr[idx++] = cur;
		}
		long long cnt = min(n, arr[i]);
		ret = (ret*mul(cur, cnt)) % INF;
		n -= cnt;
		if(n == 0)	break;
		cur++;
	}
	printf("%lld\n", ret);
	return 0;
}

Compilation message

FG.cpp: In function 'int main()':
FG.cpp:28: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 314520 KB Output is correct
2 Correct 0 ms 314520 KB Output is correct
3 Correct 0 ms 314520 KB Output is correct
4 Correct 0 ms 314520 KB Output is correct
5 Correct 0 ms 314520 KB Output is correct
6 Correct 0 ms 314520 KB Output is correct
7 Correct 0 ms 314520 KB Output is correct
8 Correct 0 ms 314520 KB Output is correct
9 Correct 0 ms 314520 KB Output is correct
10 Correct 0 ms 314520 KB Output is correct
11 Correct 0 ms 314520 KB Output is correct
12 Correct 0 ms 314520 KB Output is correct
13 Correct 0 ms 314520 KB Output is correct
14 Correct 0 ms 314520 KB Output is correct
15 Correct 0 ms 314520 KB Output is correct
16 Correct 0 ms 314520 KB Output is correct
17 Correct 0 ms 314520 KB Output is correct
18 Correct 3 ms 314520 KB Output is correct
19 Correct 0 ms 314520 KB Output is correct
20 Correct 0 ms 314520 KB Output is correct
21 Correct 0 ms 314520 KB Output is correct
22 Correct 3 ms 314520 KB Output is correct
23 Correct 0 ms 314520 KB Output is correct
24 Correct 0 ms 314520 KB Output is correct
25 Correct 0 ms 314520 KB Output is correct
26 Correct 0 ms 314520 KB Output is correct
27 Correct 0 ms 314520 KB Output is correct
28 Correct 0 ms 314520 KB Output is correct
29 Correct 0 ms 314520 KB Output is correct
30 Correct 0 ms 314520 KB Output is correct
31 Correct 3 ms 314520 KB Output is correct
32 Correct 0 ms 314520 KB Output is correct
33 Correct 0 ms 314520 KB Output is correct
34 Correct 0 ms 314520 KB Output is correct
35 Correct 0 ms 314520 KB Output is correct
36 Correct 0 ms 314520 KB Output is correct
37 Correct 0 ms 314520 KB Output is correct
38 Correct 0 ms 314520 KB Output is correct
39 Correct 3 ms 314520 KB Output is correct
40 Correct 0 ms 314520 KB Output is correct
41 Correct 0 ms 314520 KB Output is correct
42 Correct 0 ms 314520 KB Output is correct
43 Correct 0 ms 314520 KB Output is correct
44 Correct 3 ms 314520 KB Output is correct
45 Correct 0 ms 314520 KB Output is correct
46 Correct 0 ms 314520 KB Output is correct
47 Correct 0 ms 314520 KB Output is correct
48 Correct 3 ms 314520 KB Output is correct
49 Correct 3 ms 314520 KB Output is correct
50 Correct 6 ms 314520 KB Output is correct

Subtask #2
0 / 5.0

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