#include<iostream.h>
#include<math.h>
int main()
{
    double pi;
    double l, r,alpha,segm,treug,delta;
    cin>>l>>r;
    pi=3;
    l/=2;
    if(r<=l/2)
        cout<<pi*r*r;
    if(r>(l*sqrt(2)))
        cout<<l*l*4;
    else
    {
        alpha=2*acos(l/r);
        segm=pi*r/(2*alpha);
        treug=l*sqrt(((r*r)-(l*l)));
        delta=segm-treug;
        cout<<pi*r*r-4*delta;
    }
    return 0;
}

It is said in problem text that the number of measurings does not exceed 25001. But my program get AC only if I set this number >=25002, else WA#9!!! Check your test please!!! This problem appeared after rejudgement.

I DO NOT KOWN WHY WHENEVER I GET A CRASH ABOUT(ACCESS VIOLATION).
CAN SOMEBODY TELL ME WHY?

HERE IS MY PROGRAM:
{$M 10000}
program ru1116;
type
  node=record
         b,e,y:integer;
       end;
var
  n,nn,i,j,k,tot,b,e,y:integer;
  f1,f:array[1..100]of node;
  flag:array[-32000..32000]of boolean;

begin
//  assign(input,'input.in');reset(input);

    read(n);
    for i:=1 to n do
      with f1[i] do
        read(b,e,y);

    fillchar(flag,sizeof(flag),false);
    read(k);
    for i:=1 to k do
    begin
      read(b,e,y);
      for j:=b to e-1 do
        flag[j]:=true;
    end;


    tot:=0;
    k:=1;
    while k<=n do
    begin
      b:=f1[k].b;e:=f1[k].e;
      i:=b;
      repeat
        while not flag[i] and (i<e) do
          inc(i);
        if i>b
          then begin
                 inc(tot);
                 f[tot].b:=b;
                 f[tot].e:=i;
                 f[tot].y:=f1[k].y;
               end;
        while (i<=e)and(flag[i]) do
          inc(i);
        b:=i;
      until i>=e;
      inc(k);
    end;
    write(tot);
    for i:=1 to tot do
      write(' ',f[i].b,' ',f[i].e,' ',f[i].y);
end.

Why I WA test4??
why??????????????
if you know,please tell me!!
thank you!!

Hi, people! I want to thank the author of task for his creation! And I want say, that it was hard work for me to solve this task. But I did it :) Solving this task I found many new things and tricks, so I gained a little experience :) Once again thank you, author!
Good luck!
PS. Oh, sorry for my bad english

I think new tests must be added!
This solution get TL#39; time more then 2sec

[code deleted]

But!

If I modify string with label "ATTENSION!" like "for i:=k downto 1 do begin" I get AC with time=0.39

I think it's no good. My solution is wrong.

Edited by moderator 09.05.2007 16:05

"each of the remaining lines contains one word, which consists of maximally !50! small letters"
but words, which can used can have maximum 10 letters
why so much ?

I have WA #12? may be my program really have a bug,
but how i can guess about your tricky tests?
please help me, post there some test cases

I DONT KNOW WY MY PROGRAM ISN'T CORECT
HERE IS MY CODE. WHY WA??

[code deleted]

Edited by moderator 09.05.2007 16:03

who knows what is  in the test number 3?

If anyone can tell me what then sample stands for? It requires that you should print then smaller group,but in the sample No.5 can be put in the larger group so the anser should be 3?

Моя прога работает за О(n^3)(алгоритм Флойда).
Как можно решить эту задачу по-другому?

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

[code deleted]

please,help me!!!i<=?please,answer!Thank you very much!!!!

Edited by author 27.04.2007 19:53

Edited by moderator 09.05.2007 16:04

Edited by author 09.05.2007 21:59

I couldn't image where my prog can get WA:

[code deleted]

Edited by moderator 09.05.2007 16:04

[code deleted]

It doesn't work. Write 'Wrong Answare'. Please, help.
Where is my mistake?

Edited by moderator 09.05.2007 16:04

And what if there is no words in dictionary which are started with some given prefix? What should I output?

Edited by author 22.04.2007 22:32

Edited by author 08.05.2007 22:00

no body can solve this problem using C++

const int NN = 100000;
int a[NN];
unsigned short b[NN];

gets MLE #10 !

Edited by author 06.05.2007 15:00