program Project1;

{$APPTYPE CONSOLE}

uses
  SysUtils;

var a,b,c1,d1:Extended;
    i,c,d,z:integer;

BEGIN
readln (a,b);
 for i:=1 to 20000 do
  begin
   c1:=i*a/100; d1:=i*b/100;
   c:=trunc(c1); d:=trunc(d1);

    if abs(d-c)=1 then
     begin
      z:=i;
       if (c1-c=0) or (d1-d=0) then z:=z+1;

      writeln (z);
      break;
     end;

  end;

END.

I tried all tests that I found on the discussion board, and several random tests. On all of them this prog works fine. But I am still getting WA1 when I send it in.

var
  p1,q1:Real;
  p,q,p2,q2,x,ans:LongInt;
begin
  Readln(p1); p:=round(p1*100);
  Readln(q1); q:=round(q1*100);
  ans:=0;
  repeat
    ans:=ans+1;
    p2:=ans*p;
    q2:=ans*q;
    x:=p2+10000-p2 mod 10000;
  until x<q2;
  Writeln(ans);
end.

If I change it like this (I suppose, if the precision is three digits, it would work), I get TLE1.

var
  p1,q1:Extended;
  p,q,p2,q2,x,ans:QWord;
begin
  Readln(p1); p:=round(p1*1000);
  Readln(q1); q:=round(q1*1000);
  ans:=0;
  repeat
    ans:=ans+1;
    p2:=ans*p;
    q2:=ans*q;
    x:=p2+1000000-p2 mod 1000000;
  until x<q2;
  Writeln(ans);
end.

I never got through the first test =(

how can i see the test case used in a problem?
what is the p and q for test#14?

var
a:longint;
p,q:extended;
begin
read(p,q);
p:=p/100;
q:=q/100;
a:=-1;
repeat
inc(a);
until (trunc(a*q-0.0000000000000001)-trunc(a*p+0.0000000000000001))>0;
write(a);
end.

-_-!

#include<iostream>
#include<cmath>
using namespace std;

int main(){
    double p,q,ans;
    long peo;

    while(cin>>p>>q){
        p/=100,q/=100;

        peo=1;
        for(;;){
            ans=floor(peo*q);
            if(ans>peo*p && ans<peo*q)break;
            peo++;
        }
        cout<<peo<<endl;
    }
}

this is my code
it always get WA at #14
could u give me some test

I used real first time so I got WA#21, but when I used extended I got AC!. C++ sucks, Pascal forever!

You need a few minutes in the quiteness to solve this very easy problem!

What can be wrong at 21 test?Using c++,double types and rounding with int(double k).

It's not vital here to use Extended or Longint...Some tips)
1). Maximum answer is not greater then 10000
2). You can calculate number of conductors (when you know total number of citizens) using Real - not Extended, Comp or sth. like that

Edited by author 07.12.2007 23:18

  I got "WA on test 3" nine times, when I stored P and Q as
real variables. But when I only substituted "real" by
"extended", I got AC.
  If you don't want to use such advanced methods, like
extended type, you can store P*100 and Q*100 as longint.
This method gets AC too.

Edited by author 23.09.2004 01:04

"We know that there are MORE THAN P% conductors and LESS THAN Q% conductors"

I didn't see this so I got WA and WA and WA again...

#include <iostream.h>
void aaa(double p,double q,double m,double mp,int n)
{
  int t=(int)(m/q)+1;
  if(p*t<mp){cout<<n+t;}
  else { aaa(p,q,1-q*t+m,1-p*t+mp,n+t);}
}
void main()
{
  double 1p,q;
  cin>>p>>q;
  p/=100;
  q/=100;
  aaa(p,q,1,1,0);
}

I got an 'wrong answer'!!
why??

I am using Pascal and this is my last submitted program

[code deleted]

I am WONDERING what's wrong with it and I have gone MAD because I have submitted for tens of times........
When I use Longint to solve it I've got an "Time limit exceed" and when I use Extended to calculate it said "wrong answer" on test#1..I don't know why ?~!

Edited by moderator 09.05.2007 16:04

AC at last

Edited by author 16.03.2007 18:09

The follwing is my pgm. Could some give a test case not satisfied here?
#include<iostream.h>
#include<math.h>
int main()
{
float p,q,a,b;
int x,a1,b1;
cin>>p>>q;
p/=100;
q/=100;
for(x=1;x<=10000;x++)
{
a=p*x;
b=q*x;
a1=a;
b1=b;
if((float)b1==b)
b1++;
if((float)a1==a)
a1--;
if(abs(b1-a1)==1)break;
}
cout<<x;
return 0;
}

If I suppose, that inhabitance less than 5000, I get WA#3.
If I suppose, that inhabitance less than 8000, I get AC.
Why, I don't understand?

I don't know Why WA in test#3?

[code deleted]

Edited by moderator 13.02.2007 20:54

Dear admins,

Please pay attention to my message. Problem 1011. Are you sure with the test 17. My solution with the formula

  a: =-1;
  repeat
    inc (a);
  until (trunc (a*q-0.00000001)-trunc (a*p))> 0;

was WA at test #17, though I sure that it's true. After a chat reading I have corrected it

  a: =-1;
  repeat
    inc (a);
  until (trunc (a*q-0.0000000000000001)-trunc (a*p+0.0000000000000001))> 0;

, and it was AC, though I am sure, that it's wrong in math.

1)
------|p*a|-(k)-------------|q*a|------------(k+1)-------

p*a - [p*a] = 0.9999999999... {0. (9)}
and
[q*a-0] - [p*a] = 1 (> =1)

2)
0 = 0.000000000001
p*a + 0 - [p*a + 0] = 0 (become integer)
and
[q*a-0] - [p*a+0] = 0

PS: or it is just an Pascal accuracy error?

Edited by author 15.11.2006 04:27

Stupid mistake.
To other with WA3. Test number 3 is test there first encountered different number of people is equal to p or q. o the answer must be +1.

Edited by author 16.01.2007 16:17