Is there possible such test:
1
A aa 10
1 1
1 A bb ?

If then, what correct solution will be: 'aa 1' or 'aa 1, bb 1'?



k - is it a day when person comes to city? Or it is a day when he goes to that city - so person comes in this city on next day?

Why in example 25 days, but result has only 20 days? If two cities have same largest amount of money then it shouldn't be counted?


Edited by author 02.06.2022 13:52

Why always i get wrong answer in test#2??
which is the case i didnt condiser??

in the case>>
aa@ab.c
aa@as.a
aa@abs.l

my code return "7"

Edited by author 23.10.2014 02:42

Edited by author 23.10.2014 02:43

Have no idea what's wrong
I used simple plan with massive of relations and recursive function that checks all ancesters (only up moving) and all descendants (only down moving). There is some part of code in C++:

int checkforblood(int index, int** mas, int* checkmas, int range, int direct) {
    if (checkmas[index - 1] == 1) return 0;
    checkmas[index-1] = 1;
    for (int i = 0; i < range; i++) {
        if (( mas[i][0] == index )&&(direct > -1)) {
            checkforblood(mas[i][1], mas, checkmas, range, 1);
        }
        if (( mas[i][1] == index ) && (direct < 1)) {
            checkforblood(mas[i][0], mas, checkmas, range, -1);
        }
    }
    return 0;
}

I can't see the problem, so if you can't too i will know, that problem in output method.

Edited by author 31.05.2022 02:26

Does somebody know what test I need to try to solve this problem?

limit the number of conversions str->int

please give some test data!!

Edited by author 20.10.2007 08:04

You can just do calculations with floats as much as possible, e.g., 15% = 0.15, binary search with epsilon = 0.0001.

Rounding with round(x, 2) are needed only when:
 1. K*L
 2. output of T(K)
-- "The calculation of the regional coefficient and all kinds the taxes is made with rounding off to two digits after a decimal point."

while K itself is float.

n, s, k = map(int, input().split())
a = 1 << s
for u in map(int, input().split()):
    a = a >> u | (a & (1 << n+1-u) - 1) << u
print((a & -a).bit_length() - 1, a.bit_length() - 1)

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

int solve(int n, string k){
    int ans=k.size();

    if(n>=1){
        return n*solve(n-ans);

    }
    else{
        return 1;


    }


}



int main()
{
   int  t,n;
    string k;
    cin>>n;
    cin>>k;
    int result=solve(n,k);
    cout<<result<<endl;


    return 0;
}

Please, give me test

This is Test 4

11
1 2 2 1 1 1 2 2 1 2 1
11
1 1 3
1 4 1
2 8 1
10 11 1
1 3 1
2 3 1
3 7 2
4 6 2
5 9 2
11 11 2
10 11 2

Answer is 01111010101

Edited by author 08.02.2013 04:06

Please, tell me how to solve this problem...
Not solution but an idea or a hint...
Thanks.

please give me some tests.

Those who are getting WA4 when using C#, please use the following format to print out the output. The type of variable sum is double and individual numbers read in the second line are also converted to double first before adding them together.

Console.WriteLine("{0:F6}", sum / cases);

Hello women and men! I haven't been able to solve this problem for a long time.
Please, help me that.

Does anyone see what goes wrong with my program for the input of test #9? or test inputs maybe?


EDIT: Test Case found!

Edited by author 01.06.2012 22:08

strips can go up

0 30
-25.9807621135 -15
25.9807621135 -15

3.711537444785714 10.714285714285715
-11.134612334357143 -2.142857142857144
7.423074889571431 -8.571428571428571
18.557687223928568 23.57142857142857
-29.69229955828571 4.285714285714285
11.134612334357145 -27.857142857142854

deleted

Edited by moderator 23.07.2022 20:36

Почему в случае 1 10 ответ 9 если 0 тоже число в котором не идут два подряд ноля?

Просто 2 раза получил ВА, поменял на 9 и АС.