I test the 13th case which has been given before but it gives WA for test 13.
please can any body tell me what's the wrong

Show me test 13 please.

#include <cstdio>
#include <cmath>
#include <algorithm>

struct point
{
    int x, y;
};

double distance(const point P1, const point P2)
{
    return sqrt((double)(P1.x - P2.x)*(P1.x - P2.x) + (double)(P1.y - P2.y)*(P1.y - P2.y));
}

bool operator ==(const point P1, const point P2)
{
    if (P1.x == P2.x && P1.y == P2.y) return 1;
                                      return 0;
}

int main()
{
    point A, B, C;
    unsigned int L;
    scanf("%d%d%d%d%d%d%d", &A.x, &A.y, &B.x, &B.y, &C.x, &C.y, &L);

    const double pi = 3.14159265;
    const double epsilon = 0.00000001;
    double alpha, beta, gamma;
    double a, b, c;
    a = distance(B, C);
    b = distance(A, C);
    c = distance(A, B);
    alpha = acos((b*b + c*c - a*a)/(2*b*c));
    beta = acos((a*a + c*c - b*b)/(2*a*c));
    gamma = acos((a*a + b*b - c*c)/(2*a*b));
    if (A == B)
    {
        printf("1 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        if (L >= a) printf("0.00\n0.00\n");
        else printf("%.2lf\n%.2lf\n", a - L, b - L);
        return 0;
    }

    if(abs(alpha + beta - pi) < epsilon)
    {
        printf("2 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        double nl1 = std::min(a, b);
        double nl2 = std::max(a, b);
        if (L >= nl1) printf("0.00\n");
        else printf("%.2lf\n", nl1 - L);
        if (L >= nl2) printf("0.00\n");
        else printf("%.2lf\n", nl2 - L);
        return 0;
    }
    if (abs(alpha - pi/2) < epsilon)
    {
        printf("3 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        double nl1 = b;
        double nl2 = std::max(a, b);
        if (L >= nl1) printf("0.00\n");
        else printf("%.2lf\n", nl1 - L);
        if (L >= nl2) printf("0.00\n");
        else printf("%.2lf\n", nl2 - L);
        return 0;
    }
    if (abs(beta - pi/2) < epsilon)
    {
        printf("4 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        double nl1 = a;
        double nl2 = std::max(a, b);
        if (L >= nl1) printf("0.00\n");
        else printf("%.2lf\n", nl1 - L);
        if (L >= nl2) printf("0.00\n");
        else printf("%.2lf\n", nl2 - L);
        return 0;
    }
    if(alpha > pi/2)
    {
        printf("5 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        double nl1 = b;
        double nl2 = a;
        if (L >= nl1) printf("0.00\n");
        else printf("%.2lf\n", nl1 - L);
        if (L >= nl2) printf("0.00\n");
        else printf("%.2lf\n", nl2 - L);
        return 0;
    }
    if(beta > pi/2)
    {
        printf("6 is working\n");
        printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
        printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
        double nl1 = a;
        double nl2 = b;
        if (L >= nl1) printf("0.00\n");
        else printf("%.2lf\n", nl1 - L);
        if (L >= nl2) printf("0.00\n");
        else printf("%.2lf\n", nl2 - L);
        return 0;
    }

    printf("7 is working\n");
    printf("a is %.2lf\nb is %.2lf\nc is %.2lf\n", a , b , c);
    printf("alpha is %.2lf\nbeta is %.2lf\ngamma is %.2lf\n",  alpha, beta, gamma);
    double nl1 = b * sin(alpha);
    double nl2 = std::max(a, b);
    if (L >= nl1) printf("0.00\n");
    else printf("%.2lf\n", nl1 - L);
    if (L >= nl2) printf("0.00\n");
    else printf("%.2lf\n", nl2 - L);
    return 0;
}

I have solved this problem by Fenvic tree, at first I got WA on 5 test, then I changed int-s into long long-s and now I have WA on 6 test. If you had this kind of experience please tell me what types should I use to get AC?
Thanks.

Maybe!
test 1   is n=4
test 3   is n=2

It solved my problem
0 1
1 1
0

Found.

If someone will have the same issue, try this input:

3
Isenbaev A B
A B C
A Q W

Edited by author 25.01.2013 23:37

Edited by author 25.01.2013 23:37

#include <iostream>
using namespace std;
int main()
{int N,sum=0;
cin>>N;
if(N<0 && abs(N)<=10000)
{
for (int i=N; i<=1; i++)
sum+=i;}
else if (N>0 && abs(N)<=10000)
{
for(int i=1; i<=N; i++)
{sum+=i;}
}
cout<<sum<<endl;
system("pause");
}

Can anyone provide a sample for test 3? Thanks.

I use the dp to solve this problem. but always wa #2.
who can help me?
where i need to pay attention？

if there is a test like this
"5 100 w"
does it mean that both points 5 and 10 are colored in white?
or only points betwen them.
can somebody give me test, I have WA 9

resolved

Edited by author 08.11.2013 09:29

Edited by author 08.11.2013 09:29

Edited by author 23.11.2013 14:14

Edited by author 07.11.2013 19:12

#include <iostream>

using namespace std;

int step(long int mas[],int n)
{
    int i;
    int sum=0;
    for(i=n;i<n+3;i++)
        sum=sum+mas[i];

    return sum;
}

int main()
{
    int n,i;
    long int res;
    long int mas[1000];
    cin >> n;
    for(i=0;i<1001;i++)
        mas[i]=0;

    for(i=0;i<n;i++)
        cin >> mas[i];
    int sum=step(mas,0);
    res=0;

    for(i=0;i<n-2;i++)
        if(step(mas,i)<step(mas,i+1))
        {
            sum=step(mas,i+1);
            res=i+3;
        }

    cout << sum << " " << res;
    return 0;
}

some tests, that could help you

1
0 0
anwear:
*


3
0 0
0 5
5 0
answear:
*.....
|.....
|.....
|.....
|.....
*----*


3
0 1
0 5
0 9
answear:
*
|
|
|
*
|
|
|
*
+

Hi, your checker doesn't check that exactly M lines are printed. My submission #5318694 has received AC.

Can someone give me an input example with the right output so I could check it, 'cause all the test I run are right

i use binsearch and have wa 15..

i found this test
1 1 5 1 2
what's answer? is this test correct?