CSES - Datatähti 2021 alku - Results
Submission details
Task:2021-luvut
Sender:Guuber
Submission time:2020-09-29 18:16:51 +0300
Language:C++ (C++11)
Status:READY
Result:100
Feedback
groupverdictscore
#1ACCEPTED10
#2ACCEPTED15
#3ACCEPTED25
#4ACCEPTED50
Test results
testverdicttimegroup
#1ACCEPTED0.01 s1, 2, 3, 4details
#2ACCEPTED0.01 s1, 2, 3, 4details
#3ACCEPTED0.01 s1, 2, 3, 4details
#4ACCEPTED0.01 s1, 2, 3, 4details
#5ACCEPTED0.01 s1, 2, 3, 4details
#6ACCEPTED0.01 s1, 2, 3, 4details
#7ACCEPTED0.01 s1, 2, 3, 4details
#8ACCEPTED0.01 s1, 2, 3, 4details
#9ACCEPTED0.01 s1, 2, 3, 4details
#10ACCEPTED0.01 s1, 2, 3, 4details
#11ACCEPTED0.01 s2, 3, 4details
#12ACCEPTED0.01 s2, 3, 4details
#13ACCEPTED0.01 s2, 3, 4details
#14ACCEPTED0.01 s2, 3, 4details
#15ACCEPTED0.01 s2, 3, 4details
#16ACCEPTED0.01 s2, 3, 4details
#17ACCEPTED0.01 s2, 3, 4details
#18ACCEPTED0.01 s2, 3, 4details
#19ACCEPTED0.01 s2, 3, 4details
#20ACCEPTED0.01 s2, 3, 4details
#21ACCEPTED0.01 s3, 4details
#22ACCEPTED0.01 s3, 4details
#23ACCEPTED0.01 s3, 4details
#24ACCEPTED0.01 s3, 4details
#25ACCEPTED0.01 s3, 4details
#26ACCEPTED0.01 s3, 4details
#27ACCEPTED0.01 s3, 4details
#28ACCEPTED0.01 s3, 4details
#29ACCEPTED0.01 s3, 4details
#30ACCEPTED0.01 s3, 4details
#31ACCEPTED0.01 s4details
#32ACCEPTED0.01 s4details
#33ACCEPTED0.01 s4details
#34ACCEPTED0.01 s4details
#35ACCEPTED0.01 s4details
#36ACCEPTED0.01 s4details
#37ACCEPTED0.01 s4details
#38ACCEPTED0.01 s4details
#39ACCEPTED0.01 s4details
#40ACCEPTED0.01 s4details

Compiler report

input/code.cpp: In function 'std::__cxx11::string recursion0(ll, int)':
input/code.cpp:13:24: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
         while(s.size() <= kohta){
               ~~~~~~~~~^~~~~~~~

Code

#include<bits/stdc++.h>
using namespace std;
typedef long long ll;

ll n;
ll dp[101010];
ll dp2[101010];
ll dp3[1010101];
ll kp[101010];
ll dp4[1010101];
string recursion0(ll number, int kohta){
        string s = to_string(number-1);
        while(s.size() <= kohta){
                s = '0'+s;
        }
        return s;
}

string recursion1(ll number, int kohta){
        if(kohta == 0){
                return "1";     
        }
        if(number == 1){
                string s = "";
                for(ll i = 0; i <= kohta; i++){
                        s += '0';       
                }
                s[s.size()-1] = '1';
                return s;
        }

        if(number < dp[kohta] + 1){
                        return '0' + recursion1(number, kohta-1);
        }
        number -= dp[kohta];
        if(number < kp[kohta]+1){
                        return '1' + recursion0(number, kohta-1);
        }
        number -= kp[kohta];
        for(ll co = 2; co < 9; co++){
                if(number < dp[kohta] + 1){
                        return char('0'+co) + recursion1(number, kohta-1);
                }
                number -= dp[kohta];   
        }
        return '9' + recursion1(number, kohta-1);
}

string recursion2(ll number, int kohta){
        if(number == 1){
                if(kohta <= 1){
                        return "21";
                }
                string s = "";
                for(ll i = 0; i <= kohta; i++){
                        s += '0';
                }
                s[s.size()-1] = '1';
                s[s.size()-2] = '2';
                return s;
        }
        if(number < dp2[kohta] + 1){
                return '0' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];
        if(number < dp2[kohta] + 1){
                return '1' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];
        if(number < dp[kohta] + 1){
                return '2' + recursion1(number, kohta-1);
        }
        number -= dp[kohta];

        for(ll co = 3; co < 9; co++){
                if(number < dp2[kohta] + 1){
                        return char('0'+co) + recursion2(number, kohta-1);
                }
                number -= dp2[kohta];
        }
        return '9' + recursion2(number, kohta-1);
}

string recursion3(ll number, int kohta){
        if(number == 1){
                if(kohta <= 2){
                        return "021";
                }
                string s = "";
                for(int i = 0; i <= kohta; i++){
                        s += "0";
                }
                s[s.size()-1] = '1';
                s[s.size()-2] = '2';
                s[s.size()-3] = '0';
                return s;
        }

        if(number < dp2[kohta] + 1){
                return '0' + recursion2(number, kohta-1);
        }
        number -= dp2[kohta];

        for(int co = 1; co < 9; co++){
                if(number < dp3[kohta] + 1){
                        return char('0' + co) + recursion3(number, kohta-1);
                }
                number -= dp3[kohta];
        }
        return '9' + recursion3(number, kohta-1);
}

string recursion4(ll number, int kohta){
        if(number == 1){
                if(kohta <= 3){
                        return "2021";
                }
                string s = "";
                for(int i = 0; i <= kohta; i++){
                        s += "0";
                }
                s[s.size()-1]  = '1';
                s[s.size()-2] = '2';
                s[s.size()-3] = '0';
                s[s.size()-4] = '2';
                return s;
        }

        if(number < dp4[kohta] + 1){
                return '0' + recursion4(number, kohta-1);
        }
        number -= dp4[kohta];
        if(number < dp4[kohta] + 1){
                return '1' + recursion4(number, kohta-1);
        }

        number -= dp4[kohta];
        if(number < dp3[kohta] + 1){
                return '2' + recursion3(number, kohta-1);
        }
        number -= dp3[kohta];

        for(ll co = 3; co < 9; co++){
                if(number < dp4[kohta] + 1){
                        return char('0'+co) + recursion4(number, kohta-1);
                }
                number -= dp4[kohta];
        }
        return '9' + recursion4(number, kohta-1);
}

int main(){
        cin >> n;
        dp[1] = 1; kp[0] = 1;
        kp[1] = 10;
        ll counter = 10;
        for(ll i = 2; i < 20; i++){
                dp[i] = dp[i-1]*9 + counter;
                counter *= 10;
                kp[i] = counter;
        }

        dp2[2] = 1;
        for(ll i = 3; i < 20; i++){
                dp2[i] = dp2[i-1]*9 + dp[i-1];
        }

        dp3[3] = 1;
        for(ll i = 4; i < 20; i++){
                dp3[i] = dp3[i-1]*9 + dp2[i-1];
        }

        dp4[4] = 1;
        for(ll i = 5; i < 20; i++){
                dp4[i] = dp4[i-1]*9 + dp3[i-1];
        }

        int loppu = 0; 
        for(ll i = 1; dp4[i]+1 <= n; i++){
                if(dp4[i+1]+1 > n) {loppu = i; break;}
        }
        cout << recursion4(n, loppu);
}

Test details

Test 1

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
10

correct output
20214

user output
20214

Test 2

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
359

correct output
202661

user output
202661

Test 3

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
392

correct output
202819

user output
202819

Test 4

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
715

correct output
230721

user output
230721

Test 5

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
278

correct output
202219

user output
202219

Test 6

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
296

correct output
202318

user output
202318

Test 7

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
427

correct output
203214

user output
203214

Test 8

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
565

correct output
208212

user output
208212

Test 9

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
289

correct output
202311

user output
202311

Test 10

Group: 1, 2, 3, 4

Verdict: ACCEPTED

input
342

correct output
202581

user output
202581

Test 11

Group: 2, 3, 4

Verdict: ACCEPTED

input
964486

correct output
182502018

user output
182502018

Test 12

Group: 2, 3, 4

Verdict: ACCEPTED

input
110979

correct output
20296916

user output
20296916

Test 13

Group: 2, 3, 4

Verdict: ACCEPTED

input
759149

correct output
126108721

user output
126108721

Test 14

Group: 2, 3, 4

Verdict: ACCEPTED

input
234934

correct output
25023210

user output
25023210

Test 15

Group: 2, 3, 4

Verdict: ACCEPTED

input
610310

correct output
120288133

user output
120288133

Test 16

Group: 2, 3, 4

Verdict: ACCEPTED

input
956690

correct output
182027419

user output
182027419

Test 17

Group: 2, 3, 4

Verdict: ACCEPTED

input
608459

correct output
120281827

user output
120281827

Test 18

Group: 2, 3, 4

Verdict: ACCEPTED

input
944777

correct output
175260251

user output
175260251

Test 19

Group: 2, 3, 4

Verdict: ACCEPTED

input
880780

correct output
152270421

user output
152270421

Test 20

Group: 2, 3, 4

Verdict: ACCEPTED

input
418357

correct output
68202361

user output
68202361

Test 21

Group: 3, 4

Verdict: ACCEPTED

input
713294506861

correct output
20099206371786

user output
20099206371786

Test 22

Group: 3, 4

Verdict: ACCEPTED

input
191431126351

correct output
4193020274761

user output
4193020274761

Test 23

Group: 3, 4

Verdict: ACCEPTED

input
778422318223

correct output
20247733120134

user output
20247733120134

Test 24

Group: 3, 4

Verdict: ACCEPTED

input
931090767075

correct output
20691282041612

user output
20691282041612

Test 25

Group: 3, 4

Verdict: ACCEPTED

input
198806129726

correct output
4275365802196

user output
4275365802196

Test 26

Group: 3, 4

Verdict: ACCEPTED

input
724343399444

correct output
20128443204610

user output
20128443204610

Test 27

Group: 3, 4

Verdict: ACCEPTED

input
105064053560

correct output
2350677231115

user output
2350677231115

Test 28

Group: 3, 4

Verdict: ACCEPTED

input
236866700902

correct output
5872395029521

user output
5872395029521

Test 29

Group: 3, 4

Verdict: ACCEPTED

input
696349488695

correct output
20034225603103

user output
20034225603103

Test 30

Group: 3, 4

Verdict: ACCEPTED

input
30929267826

correct output
1205256095901

user output
1205256095901

Test 31

Group: 4

Verdict: ACCEPTED

input
576379198814226780

correct output
4185251600926331891

user output
4185251600926331891

Test 32

Group: 4

Verdict: ACCEPTED

input
291698664446913099

correct output
2280132983584730156

user output
2280132983584730156

Test 33

Group: 4

Verdict: ACCEPTED

input
693146378550043345

correct output
5270258230724009910

user output
5270258230724009910

Test 34

Group: 4

Verdict: ACCEPTED

input
685982323362439932

correct output
5236052744416920782

user output
5236052744416920782

Test 35

Group: 4

Verdict: ACCEPTED

input
838865925103308874

correct output
6800200426815679149

user output
6800200426815679149

Test 36

Group: 4

Verdict: ACCEPTED

input
766426223219980635

correct output
6112960212822572807

user output
6112960212822572807

Test 37

Group: 4

Verdict: ACCEPTED

input
652970397451919317

correct output
4923188580186259818

user output
4923188580186259818

Test 38

Group: 4

Verdict: ACCEPTED

input
188458586650539464

correct output
1903508375720755921

user output
1903508375720755921

Test 39

Group: 4

Verdict: ACCEPTED

input
157646989818721527

correct output
1525038392797601315

user output
1525038392797601315

Test 40

Group: 4

Verdict: ACCEPTED

input
898606361978236778

correct output
7326676702587314407

user output
7326676702587314407