Damn, how is this problem 440 difficulty, I solved it in 10 minutes

Use sparse tables

The DP version actually harder than you think. The solution with magic formula is disappointing. Go solve other problems and come back later.

The score of problems are calculated by number of accepted solutions, and some problems are very popular and people find out answers and send ready solutions.

0. I wanted to implement universal approach with Huffman coding + compressing binary code to 64 base code. Not just eng text property (I was upset, because for so interesting task so stupid solution works).

1. I'm Java developer, and I afraid that Java consume too much memory even for input.
So I have to rewrite all to cpp.

2. Thinks that costs me a lot of time.
Input in cpp. (If you can explain what is wrong. please do )
WRONG
inputData = "";
std::string line = "";
while (std::getline(std::cin, line)) {
    inputData += line;
    //inputData.push_back('\r');//todo maybe we need \r\n
    inputData.push_back('\n');
}


CORRECT
inputData = "";
int c;
while ((c = getchar()) != EOF)
    inputData.push_back((char)c);

3. Escaping characters to produce cpp code:
std::string escape(char ch) {
    switch (ch) {
        case '\'':
            return "\\'";
        case '\"':
            return "\\\"";
        case '\\':
            return "\\\\";
        case '\b':
            return "\\b";
        case '\f':
            return "\\f";
        case '\n':
            return "\\n";
        case '\r':
            return "\\r";
        case '\t':
            return "\\t";
        default:
            return {ch};
    }
}

I finally got AC. So I wish you good luck with this problem and thank to author so interesting problem.

import re

pattern = re.compile(r"\d+")
matches = re.findall(pattern, input())

for i in matches[::-1]:
    print(f"{float(i)**0.5:.4f}")

Input:
" 1427  0   \n   876652098643267843 \n5276538"

No way, this become harder than 1293. Eniya. We did it, guys!!!

Some useful tests for WA3:
3 3
2 2 3
answer: NO

4 3
2 2 3
answer: YES

Bruteforse gets TL on Python but works on c++

The limitations and input/output format were changed. Old submission were moved to the problem 1012.

What is test 11?

Edited by author 05.12.2021 02:11

Is it possible to use somehow that p is prime?
My AC solution doesn't use this fact, but I'm wondering is there a simpler way to solve this task.

Hi I think that we should help each other. If someone resolves a problem he/she must help the others with materials or links where the algorithm/formula is explained. This is the reason we are users of such sites - because we want to improve our programming skills.
So I decided to help all of you who find this problem difficult. Here you can find help:

http://en.wikipedia.org/wiki/Circular_segment

http://www.mathopenref.com/segmentarea.html

The rest is up to you!
HTH

i checked it manually and answer was correct. Why does if fail?
Code:
#include <iostream>


int main(){
    std::string lock1, lock2;
    std::string result = "yes";
    int code = 1;
    int lock_val1, lock_val2, cur_value;
    bool lock_state = false;
    std::cin>>lock1;
    std::cin>>lock2;
    lock_val1 = std::stoi(lock1);
    lock_val2 = std::stoi(lock2);
    while (code < 10000)
    {
        if (lock_state == true){
            cur_value = lock_val1;
        }
        else{
            cur_value = lock_val2;
        }

        if (code > lock_val1 && code > lock_val2){
            result = "no";
            break;
        }

        if (code == cur_value){
            break;
        }

        lock_state = !lock_state;
        ++code;
    }

    std::cout << result << std::endl;
    return 0;
}

Edited by author 30.11.2021 13:19

Edited by author 30.11.2021 13:19

Edited by author 30.11.2021 13:24

Edited by author 30.11.2021 13:37

When i used dfs, i was getting "Division by zero" on 10 test. Then' i switched to bfs and got AC. Can you explain me: WHY?

The grid is m*n not n*m

I have wa in 7 test

Length of the first string can be bigger than length of the second string. I spent 15 submissions to realise this