I didn't find a mistake in my program. And what is the test #19? I'am confused(

Try these tests on big input data:
1000000000000000000 999999999999999990 999999999999999999
3

1000000000000000000 10 500000000000000000
3

1000000000000000000 500000000000000000 250000000000000000
2

Tips:
1. Remember, that you should not only forget about using big types (for c++ it's long long int or __int64) but not forget to take big input data correctly.
For example, if you will use scanf("%d", &i), it will not get correctly a big input digit.
2. If you use min function in you program to find the minimum of two digits, don't forget to initialize your min value variable with the maximum value your can input.
For example, __int64 minInit = LLONG_MAX.

If you have such problems, you will have incorrect answers on the second and third tests (you'll get 4 and 3 respectively) and you will have WA on the tests 17 (the first tip) and 18 (the second tip).

What is test 2?

What is in test 33 ?
The same code with Scanner is accepted but with StreamTokenizer and BufferedReader is giving WA33. Very unexpected result!! O_O


Edited by author 16.12.2012 10:56

I use unsigned long long and STL vector with very simple algorithm: store x1, x2, x3 in the vector, then find the minimal diffenrence and push it in the vector (repeat the process until minimal difference is 0). I got AC.
I suppose that the tests are not strong enough. I wonder whether there is any test whose output is very large since I don's believe vector can store too many elements.
P/S: I'm a beginner so I'm very glad to study from all of you :-)!

Edited by author 21.10.2012 03:11

#include <stdio.h>
#include <stdlib.h>

int cmp(const void *a, const void *b)
{
    unsigned long long *pa = (unsigned long long *)a,
    *pb = (unsigned long long *)b;
    return *(unsigned long long *)pa - *(unsigned long long *)pb;
}


int main()
{
    unsigned long long arr[15000], min=1000000000000000000;
    int N=3, count=0, i;

    for(i = 0; i<N; i++)
        scanf("%llu", &arr[i]);
    while(min)
    {
        qsort (arr, N, sizeof(unsigned long long), cmp);
        for (i = 0; i<N-1; i++)
            if(arr[i+1] - arr[i]<min) min=arr[i+1] - arr[i];
        arr[N++] = min;
        count++;
    }
    printf("%d", count);

    return 0;
}
Can anybody help me?

For example, I got WA19 at first time.
I changed real to extended and integer to longint and got AC.

subj

пробовал разные способы вычисления, упираюсь в 33 тест.
Какие есть мысли?

Here is my code:

#include <iostream>

using namespace std;

int x[200];

int compare (const void *a, const void *b)
{
    return (*(int*)a - *(int*)b);
}

int main()
{
    int r[200], a = 3;
    long min;
    bool z = false;
    for (int  i = 0; i<3; i++)
        cin>>x[i];
    for ( ; ; )
    {
        qsort (x, a, sizeof(int), compare);
        min = 1000000000;
        for (int i = 0; i<a-1; i++)
        {
            r[i] = abs(x[i] - x[i+1]);
            if (r[i]<min)
                min = r[i];
        }
        x[a] = min;
        for (int j = 0; j<a; j++)
        {
            if (x[j] == min)
            {
                z = true;
                break;
            }
        }
        if (z == true) break;
        a++;
    }
    printf("%d", a - 1);
    return 0;
}

Where is my mistake?

Edited by author 31.01.2012 15:35

plese give me test 23

Edited by author 29.10.2011 23:25

Can someone give me test #18??? Or give me some tests and answers???

Can you give me some test?

Give me the test please