In what position brick can fall through the hole? Why program like follows doesn't work properly?

var
 a, b, c, d, e: real;
begin
 readln(a, b, c, d, e);
  if (a<=d)and(b<=e)or
     (a<=e)and(b<=d)or
     (a<=d)and(c<=e)or
     (a<=e)and(c<=d)or
     (b<=d)and(c<=e)or
     (b<=e)and(c<=d) then
    writeln('YES')
  else
    writeln('NO')
end.

Please, tell me some tests to check my program...
I have WA#2

Give me test#12, please. I tried all tests in the discussions, but still WA12

Edited by author 27.01.2014 14:42

Решая задачу обыватель мог столкнуться с проблемой того,как вводить данные. Данные водятся потоком, поэтому мы не знаем какое количество чисел войдут на проверку, для этого нам нужно использовать следующую конструкцию:

var
r:real;
..
Begin
while not seekeof do
Begin
read(r);
..
End;
..
End.

while not seekeof do - пока не конце файла, то делай то то. пропуская пробелы и переходы на новую строчку. Но так как отсутствует файлы, то он ждёт конец потока вводимых с экрана данных.
Для решения просто вставляем эту конструкцию, дополняя кодом и всё.
http://acm.timus.ru/help.aspx?topic=pascal

Edited by author 28.11.2015 11:30

here is my code if someone can help me, thanks you and greetings.

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class P1100 {

    public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int [] vec=new int[n*2];
        for(int i=0;i<n*2;i++)vec[i]=in.nextInt();
        int [] aux=new int[n];
        int mayor=0,menor=100;
        for(int i=1;i<n*2;i=i+2){
            if(menor>vec[i]){
                menor=vec[i];
            }
            if(mayor<vec[i]){
                mayor=vec[i];
            }
        }
        int sig=-1;
        for(int i=0;i<n;i++){
            for(int j=1;j<n*2;j=j+2){
               if(mayor==vec[j] && vec[j]!=-1 ){
                   System.out.printf(" %d %d",vec[j-1],vec[j]);
                   vec[j]=-1;

               }
               if(sig<mayor && sig < vec[j] && vec[j]!=-1){
                   sig=vec[j];
               }
            }
            mayor=sig;
            sig=-1;

        }
        out.flush();

    }
}

Hi.
Is O(N^2) solution good for this problem? I got TL on 8th test. Should I reduce constant in O() or should I find N*logN solution? It's strange that 25M operations take over 2 seconds.

I use Python 3.5
Is it right that it's prohibited to import function gcd from library math?
But it's allowed to import this function from library fractions

Edited by author 27.11.2015 02:04

If there is three equal points than perimeter equals zero?

I know i am stupid but help me to understand this formula!
n*(n+1)/2*(n+2)

Edited by author 02.11.2013 03:06

Edited by author 02.11.2013 03:12

// del
got AC

Edited by author 26.11.2015 22:07

Edited by author 27.03.2016 21:21

here is my code if someone can help me, thanks you and greetings.

import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.Scanner;

public class P1100 {

    public static void main(String[] args) {
       Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int [] vec=new int[n*2];
        for(int i=0;i<n*2;i++)vec[i]=in.nextInt();
        int [] aux=new int[n];
        int mayor=0,menor=100;
        for(int i=1;i<n*2;i=i+2){
            if(menor>vec[i]){
                menor=vec[i];
            }
            if(mayor<vec[i]){
                mayor=vec[i];
            }
        }
        int sig=-1;
        for(int i=0;i<n;i++){
            for(int j=1;j<n*2;j=j+2){
               if(mayor==vec[j] && vec[j]!=-1 ){
                   System.out.printf(" %d %d",vec[j-1],vec[j]);
                   vec[j]=-1;

               }
               if(sig<mayor && sig < vec[j] && vec[j]!=-1){
                   sig=vec[j];
               }
            }
            mayor=sig;
            sig=-1;

        }
        out.flush();

    }
}

import java.io.PrintWriter;
import java.util.Scanner;


public class P1581 {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        PrintWriter out = new PrintWriter(System.out);

        int n = in.nextInt();
        int [] vec=new int[n];
        for(int i=0;i<n;i++)vec[i]=in.nextInt();
        int cont=0,num;
        num=vec[0];
        for(int i=0;i<n;i++){
          if(vec[i]==num){
              cont=cont+1;
          }
          if(vec[i]!=num || i+1==n){
              if(i+1!=n){
              System.out.printf("%d %d ",cont,num);
              }else{
                  System.out.printf("%d %d",cont,num);
              }
              num=vec[i];
              cont=1;
            }

        }
        out.flush();
    }
}

----
THANKS YOU, GREETINGS.

Edited by author 26.11.2015 05:45

import java.util.*;
public class timusTeam
{
    public static void main(String [] args)
    {
        int i=0;
        Scanner in=new Scanner(System.in);
        int n=in.nextInt();

        if(n>1000 || n<1)
            return;

        int arr[]=new int[n];
        for(i=0;i<n;i++)
        {
            arr[i]=in.nextInt();
            if(arr[i]>10 || arr[i]<0)
                return;
        }

        int a;
        int sum=0;

        i=0;
        while(i<n)
        {
            a=arr[i];
            for(int k=0;k<n;k++)
                if(arr[k]==a)
                {
                    sum++;
                    i++;
                }
            System.out.print(sum +" " +a +" ");
            sum=0;
        }

    }
}

im frustrated :( Help me please

Edited by author 05.06.2012 16:59

Edited by author 05.06.2012 18:21

Дает WA, хоть тресни...

It`s wrong on 32 test. I can`t understand the problem. I used bin search.

const
  n0=10000;
type
  u = array[1..n0] of integer;
var
  a:u;
  b:u;
  c:u;
 n,i,k,l,m,j,q,t:integer;

function bin_search(s,n:integer; var mas:u):integer;
var ib,im,i1:integer;
begin
  i1:=1;
  ib:=n;
  while i1<=ib do
  begin
    im:=i1+(ib-i1) div 2;
    if mas[im] = s then
    begin
      bin_search:=s;
      break;
    end
    else
      if mas[im] < s then
       i1:=im+1
       else
        ib:=im-1;
     end;
     if i1>ib then
      bin_search:=-1;
end;
begin
  readln(n);
  for i:=1 to n do
      read(a[i]);
  readln(k);
  for l:=1 to k do
      read(b[l]);
   readln(m);
  for j:=1 to m do
      read(c[j]);

  for t:=1 to m do
  begin
    if bin_search(c[t],m,b)<>-1 then
      if bin_search(c[t],m,a)<>-1 then
       q:=q+1;
  end;
  writeln(q);
end.

Edited by author 25.11.2015 10:20

Could someone give me some tests on test10?

var
n:integer;
begin
writeln(n);
readln(n);
case n of
1..4:begin
writeln('few');
end;
5..9: begin
writeln('several');
end;
10..19: begin
writeln('pack');
end;
20..49: begin
writeln('lots');
end;
50..99: begin
writeln('horde');
end;
100..249: begin
writeln('throng');
end;
250..499: begin
writeln('swarm');
end;
500..999: begin
writeln('zounds');
end;
1000..2000:begin
writeln('legion');
end;
end;
end.

Edited by author 24.11.2015 23:33

can someone help me?, im trying search the error but i dont found nothing, greetings..

import java.io.PrintWriter;
import java.util.Scanner;

public class P{

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
    PrintWriter out= new PrintWriter(System.out);
        int current=1,cont=0;

    int n=in.nextInt();
        in.nextLine();
        for(int i=0;i<n;i++){
            String lec;
            lec=in.nextLine();

            if(lec.equals("Aurora") || lec.equals("Alice") ||lec.equals("Ariel") ||lec.equals("Phil")||lec.equals("Peter")||lec.equals("Olaf")||lec.equals("Phoebus")||lec.equals("Ralph")||lec.equals("Robin") ){
                    if(current==2){
                        cont=cont+1;
                    }
                    if(current==3){
                        cont=cont+2;
                    }
                    current=1;
            }
            if(lec.equals("Bambi") || lec.equals("Belle") ||lec.equals("Bolt") ||lec.equals("Mulan")||lec.equals("Mowglin")||lec.equals("Mickey")||lec.equals("Silver")||lec.equals("Simba")||lec.equals("Stitch")){
                    if(current!=2){
                        cont=cont+1;
                    }
                    current=2;
            }
            if(lec.equals("Dumbo") || lec.equals("Genie") ||lec.equals("Jiminy") ||lec.equals("Kuzko")||lec.equals("Kida")||lec.equals("Kenai")||lec.equals("Tarzan")||lec.equals("Tiana")||lec.equals("Winnie")){
                   if(current==2){
                       cont=cont+1;
                   }
                   if(current==1){
                       cont=cont+2;
                   }
                   current=3;
            }
        }

        System.out.print(cont);

    out.flush();
    }
}

can someone tell me what is test #5???