why??

Just wonder, probably I'm not attentive enough, but where in English statement it is said that shoulder joint is located at (0,0,0)? In Russian statement it is very clear stated in Input Data Specification, while I see nothing about that in English statement.

I used hash which have pased all tests
I have got WA6 several times
here is my program
program Project2;

{$APPTYPE CONSOLE}
const s=['a'..'z','A'..'Z','0'..'9'];


var name:array[1..10000000] of boolean;
    c,n,i,j:longint;
    ch:char;
    str:string;

begin
readln(str);
read(ch);
if ch='#' then begin writeln('0');  exit; end;
while ch <> '#' do
begin
 c:=100*ord(ch);
 j:=0;
 while (ch in s)and(ch<>'#') do begin c:=c+ord(ch); read(ch); inc(j); end;
 name[c]:=true;
 while (not (ch in s))and(ch <> '#') do read(ch);
end;

j:=0;
for i:=1 to 10000000 do if name[i] then inc(j);

writeln(j-1);

readln;
readln;
end.

what's wrong??

[code deleted]

Edited by moderator 04.12.2019 20:54

var x,y,x1,y1,f,l:longint;a,b,c:array[1..1000] of byte;
   i,k,s,r,w,z:word;
begin
read(x, y);
l:=2;w:=0;
While (f<>1)and(l<=10) do begin
i:=1;
x1:=x;
s:=0;
c:=a;
b:=a;

Repeat
c[i]:=x1 mod l;
x1:=x1 div l;
inc(i);
inc(s)
until x1=0;

y1:=y;k:=0;
i:=1;
Repeat
b[i]:=y1 mod l;
y1:=y1 div l;
inc(i);
inc(k)
until y1=0;

r:=b[k];z:=1;i:=s;

Repeat
If c[i]=r then begin r:=b[k-z];inc(z);end;
dec(i);
until (z=k+1)or(i=0);
If z=k+1 then begin f:=1;w:=l;end;
inc(l);
end;
If w=0 then writeln('No solution')
else writeln(w)


end.

Help me please...

Give pls some tests, for different errors

Who can give me a code,I want to learn how to slove this problem....My code always WA... Thanks!

Edited by author 19.09.2008 09:44

I've got WA5.
Could you please give some tests or hints?
Thanks in advance.

For accuracy of calculations use power-reduction formulas /* 2 * sin ^ 2 (a) = 1 - cos(2a) */ in the formula that calculates chords long.

Could anyone advice me what books I should read and use for solving different problems

Мy very crazy program passed  19 Tests and get TLE 20. I may be wrong, but I think, that the first 19 tests are weak. My program can't passed so many tests with bug in algorithm.
My be it is needed to check this tests and emulate EVERY possible and impossible situations.

Hi, everyone. I hate this problem, too, but there's a strange thing going on with test 4. My algorithm is very straightforward and it cannot possibly lead to a WA. It could be a TLE, I admit, but can anybody explain to me HOW is WA possible with this code?

#include <iostream>
#include <cmath>

using namespace std;

int main()
{
    double t = 0;
    double eps;
    double x, y;
    cin>>x>>y>>eps;


    eps*=eps;
    t = 0;
    while(true)
    {
        double c = cos(t) - y;
        double d = sin(pow(t,0.5)) - x ;
        if( c*c+d*d > eps/2)
            t+=0.007;
        else
        {
            break;
        }
    }
        cout<<t;
    return 0;
}

My programm using dp...
Why I have WA 25.Give any test,please.

Sorry for bad English.

Could anybody explain, why Bank 3 could not buy debt of Bank 2 to Bank 1 and thus become responsible.
As I think, it contradicts only common sense, but not the statement. But if we use common sense, should we disallow only such kind of loops (where A owes B and B owes A) or any loops (e.g. A owes B, B owes C, C owes A) ?

Could any one advice me what books I should read and use for solving different problems

Please, add gnu c++ compilator.

Precision of 1e-8 is ok to get AC (provided that you use only square roots, no trigonomety).

#include<iostream>
using namespace std;
int main()
{
    int a,b;
    cout<<"a" <<endl;
    cin>>a;
    cout<<"b" <<endl;
    cin>>b;
    cout<<a+b <<endl;
    system("pause");
}

Can you tell me what's the prob?????????

First, i sent my solution in Pascal and i got WA2 and then i wrote it in C++ and i got Accepted. I want to know my mistake in my Pascal solution.

Here's my code in Pascal :

[code deleted]

Edited by moderator 17.11.2019 18:35