CSES - Aalto Competitive Programming 2024 - wk1 - Wed - Results
Submission details
Task:Scorpion and frogs
Sender:aalto2024a_010
Submission time:2024-09-04 17:34:13 +0300
Language:C++11
Status:READY
Result:
Test results
testverdicttime
#1ACCEPTED0.00 sdetails
#2ACCEPTED0.00 sdetails
#30.00 sdetails
#40.00 sdetails
#50.00 sdetails
#60.00 sdetails
#70.01 sdetails
#80.00 sdetails
#90.00 sdetails
#100.00 sdetails
#110.00 sdetails
#120.00 sdetails
#130.00 sdetails
#140.00 sdetails
#150.00 sdetails
#160.00 sdetails
#170.00 sdetails
#180.00 sdetails
#190.00 sdetails
#200.00 sdetails
#210.00 sdetails
#220.00 sdetails
#230.00 sdetails
#240.00 sdetails
#250.00 sdetails
#260.00 sdetails
#270.00 sdetails
#280.00 sdetails
#290.00 sdetails
#300.00 sdetails
#310.00 sdetails
#320.00 sdetails
#330.00 sdetails
#340.00 sdetails
#350.00 sdetails
#360.00 sdetails
#370.00 sdetails
#380.00 sdetails
#390.00 sdetails
#400.00 sdetails
#410.00 sdetails
#420.00 sdetails
#430.00 sdetails
#440.00 sdetails
#450.00 sdetails
#460.00 sdetails
#470.00 sdetails
#480.00 sdetails
#490.00 sdetails
#500.00 sdetails
#510.00 sdetails
#520.00 sdetails
#530.00 sdetails
#540.00 sdetails
#550.00 sdetails

Code

#include <bits/stdc++.h>
using namespace std;
#define ln "\n"
typedef long long ll;
#define fastio ios_base::sync_with_stdio(false), cin.tie(NULL)

int main() {


    int n;
    cin >>n;

    ll first = 1;
    ll second = 1;

    if(n ==1){
        cout << 2;
    }else if(n == 2){
        cout << 3;
    }else{

        for(int i = 2; i <n+1; i++){
        ll buffer = second;
        second = first+second;
        first = buffer;
        }

        cout << second << ln;

    }

    





    return 0;
}

Test details

Test 1

Verdict: ACCEPTED

input
1

correct output
2

user output
2

Test 2

Verdict: ACCEPTED

input
2

correct output
3

user output
3

Test 3

Verdict:

input
3

correct output
5

user output
3

Test 4

Verdict:

input
4

correct output
8

user output
5

Test 5

Verdict:

input
5

correct output
13

user output
8

Test 6

Verdict:

input
6

correct output
21

user output
13

Test 7

Verdict:

input
7

correct output
34

user output
21

Test 8

Verdict:

input
8

correct output
55

user output
34

Test 9

Verdict:

input
9

correct output
89

user output
55

Test 10

Verdict:

input
10

correct output
144

user output
89

Test 11

Verdict:

input
11

correct output
233

user output
144

Test 12

Verdict:

input
12

correct output
377

user output
233

Test 13

Verdict:

input
13

correct output
610

user output
377

Test 14

Verdict:

input
14

correct output
987

user output
610

Test 15

Verdict:

input
15

correct output
1597

user output
987

Test 16

Verdict:

input
16

correct output
2584

user output
1597

Test 17

Verdict:

input
17

correct output
4181

user output
2584

Test 18

Verdict:

input
18

correct output
6765

user output
4181

Test 19

Verdict:

input
19

correct output
10946

user output
6765

Test 20

Verdict:

input
20

correct output
17711

user output
10946

Test 21

Verdict:

input
30

correct output
2178309

user output
1346269

Test 22

Verdict:

input
40

correct output
267914296

user output
165580141

Test 23

Verdict:

input
50

correct output
9216450

user output
20365011074

Test 24

Verdict:

input
60

correct output
865709054

user output
2504730781961

Test 25

Verdict:

input
70

correct output
659095774

user output
308061521170129

Test 26

Verdict:

input
80

correct output
343522908

user output
37889062373143906

Test 27

Verdict:

input
90

correct output
666203437

user output
4660046610375530309

Test 28

Verdict:

input
100

correct output
741707250

user output
1298777728820984005

Test 29

Verdict:

input
200

correct output
319277240

user output
3721511182311577122

Test 30

Verdict:

input
300

correct output
12089690

user output
9010910435053616553

Test 31

Verdict:

input
400

correct output
356073916

user output
4536716983099355453

Test 32

Verdict:

input
500

correct output
831535149

user output
4859788740867454402

Test 33

Verdict:

input
600

correct output
627858041

user output
-5289766542210647407

Test 34

Verdict:

input
700

correct output
894762479

user output
5370381838998065653

Test 35

Verdict:

input
800

correct output
695610340

user output
7531830775079460834

Test 36

Verdict:

input
900

correct output
120428339

user output
3115453152172472505

Test 37

Verdict:

input
1000

correct output
506723686

user output
9079565065540428013

Test 38

Verdict:

input
2000

correct output
118272245

user output
-820905900187520670

Test 39

Verdict:

input
3000

correct output
50602578

user output
9001823511092631249

Test 40

Verdict:

input
4000

correct output
38687300

user output
7916500217002163805

Test 41

Verdict:

input
5000

correct output
644069919

user output
-8190626429588521950

Test 42

Verdict:

input
6000

correct output
905964874

user output
-5318622691723052383

Test 43

Verdict:

input
7000

correct output
917351342

user output
-8546225352649292595

Test 44

Verdict:

input
8000

correct output
606465604

user output
-7484492150104153886

Test 45

Verdict:

input
9000

correct output
676429656

user output
-372804080666035343

Test 46

Verdict:

input
10000

correct output
634342956

user output
-83367563645688771

Test 47

Verdict:

input
20000

correct output
215568895

user output
-8919126892890081310

Test 48

Verdict:

input
30000

correct output
54808147

user output
-8293539017933624031

Test 49

Verdict:

input
40000

correct output
242971895

user output
6870240574645927325

Test 50

Verdict:

input
50000

correct output
575576968

user output
-1018733808274780830

Test 51

Verdict:

input
60000

correct output
923159168

user output
-4076637832224035263

Test 52

Verdict:

input
70000

correct output
621454924

user output
2906951799942683389

Test 53

Verdict:

input
80000

correct output
562709198

user output
-1447295216720966942

Test 54

Verdict:

input
90000

correct output
389404104

user output
-2431836217921453215

Test 55

Verdict:

input
100000

correct output
66655788

user output
-4040291346873926563