#include <iostream>
#include <vector>
using namespace std;
int main()
{
    int N = 45;
    int M;
    cin >> M;

    vector <long long> a(N+2);
    a[0] = 2, a[1] = 2;



    for (int i = 0; i < N; i++)
    {
        a[i+2] = (a[i+1] + a[i]);
    }



       //Fibonacci sequence

       // F0 = 2;
       // F1 = 2;
       // Fn = Fn-1 + Fn-2


    cout << a[M-1];
    return 0;
}

Problems 2158-2173 from Ural School Programming Contests 2021 and 2022 were added to the Problem set.

This is my tests:

<Test 1>
input:
10 5
8
1 0
2 0
3 1
4 1
5 0
6 0
15 1
16 1
output:
No reason
5 15
6 16
1 3
2 4

<Test 2>
input:
11 1
18
1 0
2 0
3 0
4 0
6 0
7 0
8 0
9 0
11 0
12 1
13 1
14 1
15 1
16 1
17 1
18 1
19 1
20 1
output:
Liar

<Test 3>
input:
4 2
8
7 0
8 0
9 0
19 1
20 0
21 1
22 1
23 1
output:
No reason
20 21
7 19
8 23
9 22

Edited by author 29.03.2023 21:01

try think like dp[length of string][sum of string] = count of numbers, answer is dp[9][s].

ds:=sqr(b)-a*c;

the checking must look like this
if ds+0.000000000001>=0 then
...

THIS TEST
6 5
1 3
6 3
11112
22221
11112
22212
21112
22222

ANS:7 1

qwq

Edited by author 23.07.2023 08:21

I am using Dijkstra's algorithm(and skip first vertex). I output a list of names whose shortest distance is less 141. I can't find the tests that crack my solution... Give me tests, please)

Give me some tests,  please

Edited by author 11.11.2008 23:43

999 987.23
answer 934270.79

3 100
answer 0.00

4 1000
answer 0.00

5 12
answer 0.00

eps >= 1e-9 - WA26
eps = 1e-7 - AC

plese help test 104

4 5 4 5
1 2
2 1
2 3
3 2
3 4

ans: 14

Edited by author 15.07.2023 07:47

I used my own hash map with modulo 1e5, and buckets with size equal to one

it's the case where count of '(' is greater than ')'.

For example:
(( or (()

its wa is something like a Ivan's Car problem

[code deleted]

Edited by moderator 27.07.2023 17:22