CSES - Putka Open 2020 – 2/5 - Results
Submission details
Task:Planeetat
Sender:jnalanko
Submission time:2020-09-27 05:11:38 +0300
Language:C++17
Status:READY
Result:49
Feedback
groupverdictscore
#1ACCEPTED24
#2ACCEPTED25
#30
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3details
#2ACCEPTED0.01 s1, 2, 3details
#3ACCEPTED0.01 s1, 2, 3details
#4ACCEPTED0.01 s1, 2, 3details
#5ACCEPTED0.01 s1, 2, 3details
#6ACCEPTED0.01 s1, 2, 3details
#7ACCEPTED0.01 s1, 2, 3details
#8ACCEPTED0.01 s1, 2, 3details
#9ACCEPTED0.01 s1, 2, 3details
#10ACCEPTED0.01 s1, 2, 3details
#11ACCEPTED0.01 s2, 3details
#12ACCEPTED0.02 s2, 3details
#13ACCEPTED0.12 s2, 3details
#140.01 s3details
#150.01 s3details
#160.01 s3details
#170.01 s3details
#180.01 s3details
#190.01 s3details
#200.01 s3details
#210.01 s3details
#220.01 s3details
#230.01 s3details
#240.01 s3details
#250.01 s3details

Code

#include <iostream>
#include <vector>
#include <cassert>
#include <set>
#include <cmath>
#include <unordered_map>
#include <utility>
#include <map>
//#include "stdlib_printing.hh"

typedef long long LL;

using namespace std;

LL mod = 1e9+7;
vector<vector<LL > > stirling(100+1,vector<LL>(100+1)); // S(n,k) = number of permutations of n elements with k cycles
vector<vector<LL > > nCr(100+1,vector<LL>(100+1)); // n choose k

LL modpow(LL x, LL e){
    LL ans = 1;
    for(LL i = 0; i < e; i++) ans = (ans * x) % mod;
    return ans;
}

map<pair<LL,LL>, LL> F_memo;
LL F(LL n,LL k){
    if(n == 0 && k == 0) return 1;
    if(k == 0) return 0;
    if(n == 0) return 1;
    if(F_memo.find({n,k}) != F_memo.end())
        return F_memo[{n,k}];
    LL ans = 0;
    for(LL s = 1; s <= n; s++){
        ans += (nCr[n][s] * modpow(k,s)) % mod * F(n-s,s) % mod;
        ans %= mod;
    }
    F_memo[{n,k}] = ans;
    return ans;
}

int main(){
    
    stirling[0][0] = 1;
    for(LL n = 1; n <= 100; n++){
        for(LL k = 1; k <= 100; k++){
            stirling[n][k] = ((n-1)*stirling[n-1][k] + stirling[n-1][k-1]) % mod;
        }
    }

    
    nCr[0][0] = 1;
    for(LL n = 1; n <= 100; n++){
        for(LL k = 0; k <= n; k++){
            nCr[n][k] += nCr[n-1][k];
            if(k > 0) nCr[n][k] += nCr[n-1][k-1];
            nCr[n][k] %= mod;
        }
    }

    LL n; cin >> n;

    for(LL k = 1; k <= n; k++){
        LL ans = 0;
        for(LL r = k; r <= n; r++){
            // r = size of the part with the cycles
            ans += (nCr[n][r] * stirling[r][k] % mod) * F(n-r,r) % mod;
            ans %= mod;
        }
        cout << ans << endl;
    }
}

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
(empty)

Test 15

Group: 3

Verdict:

input
3333

correct output
79235821
455292218
627100211
591681254
695866885
...

user output
(empty)

Test 16

Group: 3

Verdict:

input
4991

correct output
482116496
245260697
151422537
180441123
318466624
...

user output
(empty)

Test 17

Group: 3

Verdict:

input
4992

correct output
141010647
787351178
684701591
872974815
631476284
...

user output
(empty)

Test 18

Group: 3

Verdict:

input
4993

correct output
504034249
588971460
281533415
928250892
416697844
...

user output
(empty)

Test 19

Group: 3

Verdict:

input
4994

correct output
266134603
90079109
544661648
812099750
17249410
...

user output
(empty)

Test 20

Group: 3

Verdict:

input
4995

correct output
833898560
663839791
109127071
321675160
86285359
...

user output
(empty)

Test 21

Group: 3

Verdict:

input
4996

correct output
721158645
167929822
115103278
491345159
114397872
...

user output
(empty)

Test 22

Group: 3

Verdict:

input
4997

correct output
691405606
436947443
82656395
514529009
783319673
...

user output
(empty)

Test 23

Group: 3

Verdict:

input
4998

correct output
829675470
688714502
189351950
956110193
20883331
...

user output
(empty)

Test 24

Group: 3

Verdict:

input
4999

correct output
343936737
47032567
190931571
827280581
160866637
...

user output
(empty)

Test 25

Group: 3

Verdict:

input
5000

correct output
364064601
633559852
352848841
666954216
428009512
...

user output
(empty)