CSES - Putka Open 2020 – 2/5 - Results
Submission details
Task:Planeetat
Sender:mangolassi
Submission time:2020-09-27 16:44:49 +0300
Language:C++11
Status:READY
Result:49
Feedback
groupverdictscore
#1ACCEPTED24
#2ACCEPTED25
#30
Test results
testverdicttimegroup
#1ACCEPTED0.02 s1, 2, 3details
#2ACCEPTED0.02 s1, 2, 3details
#3ACCEPTED0.02 s1, 2, 3details
#4ACCEPTED0.02 s1, 2, 3details
#5ACCEPTED0.02 s1, 2, 3details
#6ACCEPTED0.02 s1, 2, 3details
#7ACCEPTED0.02 s1, 2, 3details
#8ACCEPTED0.02 s1, 2, 3details
#9ACCEPTED0.02 s1, 2, 3details
#10ACCEPTED0.02 s1, 2, 3details
#11ACCEPTED0.02 s2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.02 s2, 3details
#140.02 s3details
#150.02 s3details
#160.02 s3details
#170.02 s3details
#180.02 s3details
#190.02 s3details
#200.02 s3details
#210.02 s3details
#220.02 s3details
#230.02 s3details
#240.02 s3details
#250.02 s3details

Code

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
const ll MOD = (ll)1e9 + 7;

const int N = 100;
ll fact[N+1];
ll inv_fact[N+1];

ll ways[N+1][N+1][N+1];
ll dp1[N+1][N+1];
ll total[N+1];
ll dp2[N+1][N+1];

ll modPow(ll a, ll b) {
	if (b & 1) return a * modPow(a, b-1) % MOD;
	if (b == 0) return 1;
	return modPow(a*a % MOD, b / 2);
}

ll binom(ll a, ll b) {
	if (a < b || b < 0) return 0;
	ll dv = (inv_fact[b] * inv_fact[a-b]) % MOD;
	return (fact[a] * dv) % MOD;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);

	fact[0] = 1;
	for (int i = 1; i <= N; ++i) fact[i] = (fact[i-1] * i) % MOD;
	inv_fact[N] = modPow(fact[N], MOD - 2);
	for (int i = N-1; i >= 0; --i) inv_fact[i] = (inv_fact[i+1] * (i+1)) % MOD;

	for (int n = 0; n <= N; ++n) {
		ways[n][0][0] = 1;
		for (int a = 1; a <= N; ++a) {
			for (int b = 0; b <= a; ++b) {
				ways[n][a][b] = ((n-b) * ways[n][a-1][b] + (b > 0 ? b * ways[n][a-1][b-1] : 0)) % MOD;
			}
		}
	}

	for (int n = 1; n <= N; ++n) {
		dp1[n][0] = fact[n-1];
		for (int k = 1; k <= n; ++k) dp1[n][k] = (dp1[n][k] * binom(n, k)) % MOD;
		for (int k = 0; k <= n; ++k) total[n] = (total[n] + dp1[n][k]) % MOD;

		for (int m = n+1; m <= N; ++m) {
			int k = m-n;
			for (int t = 0; t <= min(k, m); ++t) {
				dp1[m][k] = (dp1[m][k] + dp1[n][t] * ways[n][k][t]) % MOD;
			}
		}
	}

	dp2[0][0] = 1;
	for (int n = 1; n <= N; ++n) {
		for (int k = 1; k <= n; ++k) {
			for (int t = 1; t <= n; ++t) {
				dp2[n][k] = (dp2[n][k] + dp2[n-t][k-1] * (total[t] * binom(n-1, t-1) % MOD)) % MOD;
			}
		}
	}

	int n;
	cin >> n;
	for (int k = 1; k <= n; ++k) cout << dp2[n][k] << '\n';
}

Test details

Test 1

Group: 1, 2, 3

Verdict: ACCEPTED

input
1

correct output
1

user output
1

Test 2

Group: 1, 2, 3

Verdict: ACCEPTED

input
2

correct output
3
1

user output
3
1

Test 3

Group: 1, 2, 3

Verdict: ACCEPTED

input
3

correct output
17
9
1

user output
17
9
1

Test 4

Group: 1, 2, 3

Verdict: ACCEPTED

input
4

correct output
142
95
18
1

user output
142
95
18
1

Test 5

Group: 1, 2, 3

Verdict: ACCEPTED

input
5

correct output
1569
1220
305
30
1

user output
1569
1220
305
30
1

Test 6

Group: 1, 2, 3

Verdict: ACCEPTED

input
6

correct output
21576
18694
5595
745
45
...

user output
21576
18694
5595
745
45
...

Test 7

Group: 1, 2, 3

Verdict: ACCEPTED

input
7

correct output
355081
334369
113974
18515
1540
...

user output
355081
334369
113974
18515
1540
...

Test 8

Group: 1, 2, 3

Verdict: ACCEPTED

input
8

correct output
6805296
6852460
2581964
484729
49840
...

user output
6805296
6852460
2581964
484729
49840
...

Test 9

Group: 1, 2, 3

Verdict: ACCEPTED

input
9

correct output
148869153
158479488
64727522
13591116
1632099
...

user output
148869153
158479488
64727522
13591116
1632099
...

Test 10

Group: 1, 2, 3

Verdict: ACCEPTED

input
10

correct output
660215659
85349908
783995053
409987640
55545735
...

user output
660215659
85349908
783995053
409987640
55545735
...

Test 11

Group: 2, 3

Verdict: ACCEPTED

input
20

correct output
8033007
474885151
998010619
720259168
345757330
...

user output
8033007
474885151
998010619
720259168
345757330
...

Test 12

Group: 2, 3

Verdict: ACCEPTED

input
50

correct output
637699856
613177596
194234103
50828885
988168359
...

user output
637699856
613177596
194234103
50828885
988168359
...

Test 13

Group: 2, 3

Verdict: ACCEPTED

input
100

correct output
894456323
406549429
962038245
430640330
61348310
...

user output
894456323
406549429
962038245
430640330
61348310
...

Test 14

Group: 3

Verdict:

input
666

correct output
189730587
968711879
553374698
53051125
139917248
...

user output
0
0
0
0
0
...

Test 15

Group: 3

Verdict:

input
3333

correct output
79235821
455292218
627100211
591681254
695866885
...

user output
13065320
-71885196
495525785
-971865252
617086590
...

Test 16

Group: 3

Verdict:

input
4991

correct output
482116496
245260697
151422537
180441123
318466624
...

user output
0
0
0
0
0
...

Test 17

Group: 3

Verdict:

input
4992

correct output
141010647
787351178
684701591
872974815
631476284
...

user output
0
0
0
0
0
...

Test 18

Group: 3

Verdict:

input
4993

correct output
504034249
588971460
281533415
928250892
416697844
...

user output
0
0
0
0
0
...

Test 19

Group: 3

Verdict:

input
4994

correct output
266134603
90079109
544661648
812099750
17249410
...

user output
0
0
0
0
0
...

Test 20

Group: 3

Verdict:

input
4995

correct output
833898560
663839791
109127071
321675160
86285359
...

user output
0
0
0
0
0
...

Test 21

Group: 3

Verdict:

input
4996

correct output
721158645
167929822
115103278
491345159
114397872
...

user output
0
0
0
0
0
...

Test 22

Group: 3

Verdict:

input
4997

correct output
691405606
436947443
82656395
514529009
783319673
...

user output
0
0
0
0
0
...

Test 23

Group: 3

Verdict:

input
4998

correct output
829675470
688714502
189351950
956110193
20883331
...

user output
0
0
0
0
0
...

Test 24

Group: 3

Verdict:

input
4999

correct output
343936737
47032567
190931571
827280581
160866637
...

user output
0
0
0
0
0
...

Test 25

Group: 3

Verdict:

input
5000

correct output
364064601
633559852
352848841
666954216
428009512
...

user output
0
0
0
0
0
...