problem set 1001
#include<stdio.h>
#include<math.h>
void main()
{long a,b,c,d;
scanf("%lf%lf%lf%lf",&a,&b,&c,&d);
printf("%6.4f%5.4f%13.4f%8.4f",sqrt(d),sqrt(c),sqrt(b),sqrt(a));
}
I know it's wrong ,but I don't know which type to use to define the figure that is very big

Edited by author 29.10.2011 16:35

Edited by author 29.10.2011 16:35

скинте ответ если не жалко плиз...

Edited by author 04.11.2011 19:17

Can "t" be equal to 63.2. Or we must write 64.0

can speed be real or equal to 0?

Edited by author 29.10.2011 15:26

Edited by author 29.10.2011 15:26

Tests 2-7 were invalid, so they are removed now. All solutions were rejudged.

problem set 1000 I don't know what's the matter,i learn c and it could run in vc6.0,why is it wrong ?
#include<stdio.h>
void main()
{int a,b;
scanf("%d%d",&a,&b);
printf("a+b=%d",a+b);
}

how many digits after decimal point should we print?

hi to everybody! i don't understand the second test! i think that igor could hear english phrase two times and french phrase too! unknown = french! am i right? can anyone help?

Why in 3 test answer 1? Igor should hear 3 phrases on different language

Edited by author 29.10.2011 14:18

Edited by author 29.10.2011 14:18

Edited by author 05.08.2011 19:30

In the second line output n integers

I think it should be "p integers"

When i using BufferedReader of java with readLine function.
It will read for 'N' lines that 'N' is specific.

And when input is not specific of line, how should i deal with the input? How java knows the input string is ended?

Sorry for bad english,

bidakung

first i tried:
for input -3 : 1+0-1-2-3 = -5
for input 3 : 1+2+3 = 5
got an Error !!

What's the Idea ???

#include <cstdio>
#include <cstring>
#include <cmath>
#include <iostream>
struct node
{
    int x,y;
}A,B,C;
double length(int x1,int y1,int x2,int y2)
{
    double x=x1-x2;
    double y=y1-y2;
    return sqrt(x*x+y*y);
}
int Abs(int x)
{
    return x>0?x:-x;
}
int main()
{
    int l,min,max;
    double l1,l2,m1,m2;
    m2=-9999999;
    scanf("%d%d%d%d%d%d%d",&A.x,&A.y,&B.x,&B.y,&C.x,&C.y,&l);
    double s1;
    s1=length(A.x,A.y,C.x,C.y);
    if(s1>m2)
    m2=s1;
    s1=length(B.x,B.y,C.x,C.y);
    if(s1>m2)
    m2=s1;
    m2-=l;
    if(A.x-B.x==0)
    {
        min=A.y>B.y?B.y:A.y;
        max=A.y>B.y?A.y:B.y;
        if(C.y>=min&&C.y<=max)
        {
            m1=Abs(C.x-A.x);
            m1-=l;
        }
        else
        {
                l1=length(A.x,A.y,C.x,C.y);
                l2=length(B.x,B.y,C.x,C.y);
                m1=l1>l2?l2:l1;
                m1-=l;
        }
    }
    else
    {
        int k1,b1,k2,b2;
        k1=(A.y-B.y)/(A.x-B.x);
        if(k1==0)
        {
            min=A.x>B.x?B.x:A.x;
            max=A.x>B.x?A.x:B.x;
            if(C.x>=min&&C.x<=max)
            {
                m1=Abs(C.y-A.y);
                m1-=l;
            }
            else
            {
                l1=length(A.x,A.y,C.x,C.y);
                l2=length(B.x,B.y,C.x,C.y);
                m1=l1>l2?l2:l1;
                m1-=l;
            }
        }
        else
        {
             min=A.y>B.y?B.y:A.y;
            max=A.y>B.y?A.y:B.y;
            k2=-(1/k1);
            b1=A.y-k1*A.x;
            b2=C.y-k2*C.x;
           int x,y;
            x=(b2-b1)/(k1-k2);
            y=k1*x+b1;
            //printf("%lf %lf\n",x,y);
            if(y>=min&&y<=max)
            {
                m1=length(C.x,C.y,x,y);
                m1-=l;
            }
            else
            {
                l1=length(A.x,A.y,C.x,C.y);
                l2=length(B.x,B.y,C.x,C.y);
                m2=l1>l2?l2:l1;
                m2-=l;
            }
        }
    }
    printf("%.2lf\n%.2lf\n",m1>0?m1:0,m2>0?m2:0);
    return 0;
}
2 1 4 2 0 0 1
-5 0 5 0 0 5 100
1 1 1 1 10 10 100
-2 6 2 6 0 0 0
-1 1 1 1 -4 -3 0
1 2 1 1 0 0 0
1 1 1 1 0 0 0
All these test I have passed >

I don't understand where the error

Thank you!
In this forum I knew how solve this task!

We must find lengths of pathes for every element of permutation and count their LCM.

Don't forget about Int64 in Pascal and long long in C++.

Here is my AC solution:

[code deleted]

Edited by author 15.08.2005 07:46

Edited by moderator 04.12.2019 20:48

the solution is achieved using LCM (MCM in Spanish) and long long to express the result

Admins, lease add a "graph theory" tag for this problem.