Fucking participants!
This problem is the most stupid problem I have ever seen.
Why the problem is to output the calendar but not to find the day of
week? It is very simple to find but it is IMPOSSIBLE to output! The
sample does not give the answers to many questions.
Why I MUST GUESS, GUESS and GUESS again?
...
Diman_YES[UT], the leader of Universal Team

I wa many times.
Thank you very much!

I don't understand why my code fails. I have been very careful with all cases. The precision of the numbers, the zero and negative benefits, everything. My code should not have so many lines but I have put them for the frustration of having so many WA. Are you sure test # 2 is ok? Check it with my code. Previously I tried it with a much shorter code that reached test # 7 and failed, but it did not take care of rounding problems, this does and fails in test # 2 X-¿
Help, Please!


// Brute force
#include <stdio.h>
#include <math.h>

long calcMax (int horn_n , int hoof_n,  float horn_b, float  hoof_b ) {

    long max =  (long) horn_b * horn_n + (long) hoof_b * hoof_n - (long) 100 * ( horn_n * horn_n +  hoof_n * hoof_n);
    return max;
}

int passtoInt( char *number) {
    int num = 0, signo = 1, begin = 0;
    char decimal_flag = 'N';
    int dec_ndig = 0;
    if( number[0] == '-')  {
        signo = -1;
        begin = 1;
    }
    for(int i=begin; number[i] != 0; i++) {
        if(number[i] == '.')  {
            decimal_flag = 'Y' ;
            continue;
        }
        if(decimal_flag == 'Y') dec_ndig++;
        if(dec_ndig > 2) break;

        num = num * 10  + (number[i] - '0');

    }
    for(int i = dec_ndig; i < 2; i++) num = num*10;

    return num * signo;
}


void getPartEntAndDec(long num, long *ent, unsigned *dec )  {
    *ent = num / 100;
    *dec = num % 100;

}


int main(void) {
    char horn_s[14],  hoof_s[14];
    int  horn_n= 0, hoof_n = 0, horn = 0, hoof = 0;

    int horn_b, hoof_b;
    long max = 0, max1, max_ent;
    unsigned max_dec;
    int maxmount;

    scanf("%s%s%d", horn_s, hoof_s, &maxmount);
    horn_b = passtoInt( horn_s);
    hoof_b = passtoInt( hoof_s);

    for(int horn_n = 0; horn_n <= maxmount; horn_n++) {
        for(int hoof_n = 0; hoof_n <= maxmount -  horn_n;  hoof_n++) {
            max1 = calcMax (horn_n , hoof_n,  horn_b,  hoof_b );
            if(max1 > max) {
                horn = horn_n;
                hoof = hoof_n;
                max = max1;
            }
        }
    }
    getPartEntAndDec(max, &max_ent, &max_dec );
    printf("%ld.%02u\n", max_ent, max_dec);
    printf("%d %d\n", horn,  hoof);
    return 0;

}

Could anybody suggest the 3-rd test???? i don't know my mistake. :-(

Just use g++

Ho to fix WA on test 18?

The first test is something like this
4 4
1 2 1
2 3 1
3 4 2
4 1 1

I hope this helps you

1 2
2 3
2 4
2 5

Подумайте о пересечение прямой из данных двух точек с окружностью
а потом о треугольниках

Edited by author 16.02.2020 19:45

phi(n) is not equal to number of coprime less than n, IT IS THE NUMBER OF COPRIMES LESS THAN OR EQUAL TO N. the formula of phi(n) work for all except a special number.

give me this test please..

Achtung!
Time limit exceeded Error :(
does anyone knows test 5? thank you!

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

Putting the intermediary values in long double won't work, At least I couldn't get them to work.
Putting them in long long and dividing at the end also won't work.
You'll have to do something between these two ( ͡° ͜ʖ ͡°)

Не слушайте тех кто пишет что убрал проверку за границы и зашла и все в таком духе.
Возможно у вас такая же ошибка как и у меня, а то есть когда ввели новые координаты я проверял только то что может ли эту новую координату кто то ударить, а надо было еще проверить что может ли новая координа ударить кого то из врагов

I use some shamanism ang get AC. Lets see to the next test:

6
0 20
10 50
30 100
60 120
70 130
110 140

my AC prog outputs:

2
10 50
110 140

but right answer of course is:

3
0 20
30 100
110 140

Your tests must be stronger

Извините, что по-русски, надеюсь, администраторы знают этот язык.

В условии сказано, что длина последовательности задается в первой строке каждого теста.
В примерах на форуме длина общая для всех, в каждом тесте задается только количество вопросов.
Моя AC-программа действует по форуму: читает длину один раз, а потом только количество вопросов для каждого теста.

Хорошо бы привести текст задачи в соответствие с реальностью.
Совсем хорошо было бы дать в примере два теста, чтобы сделать структуру входных данных действительно ясной.

For Time limit exceeded:
If you get time limit exceeded, it must mean that you're trying to modify the
input string (i.e. trying to delete i-th chars). Try creating a new OUTPUT string
without modifying the INPUT string.

Note: if you're using a high language such as java or C#, try using the StringBuilder
object to build your output string.

For Wrong Answer(WA):
If you get WA, try some of these test cases:

Input: "dddd"
Output: ""

Input: "ddddd"
Output: "d"

Input: "abba"
Output: ""

Input: "abbbbac"
Output: "c"

Input: "wliisddsmmleeddw"
Output: ""

Input: "avcbbffcv"
Output: "a"

Hope this helps.

Edited by author 12.07.2012 00:47

#include<iostream>
using namespace std;
int main(){
    int k, n, arr[101],x=0;
    cin>>k>>n;

    for(int i=0; i<n; i++){
        cin>> arr[i];

    }
    for(int i=0;i<n;i++){

        if(k>=arr[i]){
            if(i != n-1){
                x = x + arr[i+1];
                arr[i+1] = x;

                x = 0;

            }
            else{
                x = 0;
            }


        }
        else{
            if(i != n-1){
                x = (arr[i]-k) + arr[i+1];
                arr[i+1] = x;


            }
            else{
                x = arr[i] - k;
            }
        }
    //    printf("X : %d\n",x);
    }
    if(x<=0)
    cout<<0;
    else
    cout<<x;

}