10773 - Back to Intermediate Math

[Raiyan Kamal]

First line of the input contains an integer N , the number of test cases. Next N lines have 3 real numbers each. So you are supposed to use something like

Code: Select all

for(i=1;i<=N;i++)
{}

No wonder why you get WA using while(cin>>N)

[yiuyuho]

wow, that's some trickery!

But, yea I suppose it is valid, got me too!

[yiuyuho]

Well, with little joey's post now this problem is definitely a lot easier then it is suppose to be

[yiuyuho]

Read http://online-judge.uva.es/board/viewto ... ight=10773

They need to be different paths!

[hata_2]

use "can\'t determine"..its the standard system to print " ' " using \ before it.. i got wa several times only becoz of this bu*****it.

[monjur]

I cant understand why i got WA repeatedly.
Here is my code:
#include<stdio.h>
#include<math.h>

int main()
{
double result,shortest_time,temp,shortest_path,d;
long cas,n,u,v;
while(scanf("%ld",&n)==1)
{
for(cas=1;cas<=n;cas++)
{
scanf("%lf %ld %ld",&d,&v,&u);
if(u==0 || v==0|| v>=u)
printf("Case %ld: can't determine\n",cas);
else
{
shortest_time=d/u;
temp=double((u*u)-(v*v));
temp=sqrt(temp);
shortest_path=d/temp;
result=fabs(shortest_path-shortest_time);
if(result>=0.001)
printf("Case %ld: %.3lf\n",cas,result);
else
printf("Case %ld: can't determine\n",cas);
}
}
}
return 0;
}

[brianfry713]

I cant understand why i got WA repeatedly.

Don't check for the number of test cases more than once.
Also don't check if the result>=0.001

[nebulousboy]

if d=0 then how it is possible to determine two different paths?????

[brianfry713]

d is positive

[Enayet Kabir]

UVA Problem ID :10773(Back to Intermediate Math)
please help anyone...
#include<iostream>
#include<cmath>
#include<cstring>
#include<cstdio>
using namespace std;
int main()
{
int t,i;
double d,u,v,td,t1,t2;
while(scanf("%d",&t)==1)
{
for(i=1;i<=t;i++)
{
scanf("%lf%lf%lf",&d,&v,&u);
if(u==0 || v>=u || v==0)
{
printf("Case %d: can't determine\n",i);
}
else
{
t1=(1.0*d)/(u*1.0);
t2=(1.0*d)/(sqrt((u*u)-(v*v))*1.0);
td=fabs(t2-t1);
printf("Case %d: %0.3lf\n",i,td );
}

}
}
return 0;
}

[brianfry713]

What's the problem number?

[Enayet Kabir]

Problem Number : Uva id:10773(Back to Intermediate math)

[brianfry713]

Input:

Code: Select all

3
8 5 6
1 2 3
1 5 6
3
8 5 6
1 2 3
1 5 6

AC output:

Code: Select all

Case 1: 1.079
Case 2: 0.114
Case 3: 0.135

[Enayet Kabir]

What is this sir? Already i have solved this problem . why u give my i/p and o/p ?

[brianfry713]

You asked why you were getting WA, and I gave a suggestion. Congrats on solving it.