program bif;
var a,b,c,d:integer;  i:real;
begin
readln (a,b);
c:=((b-a)+1) mod 2;

if c=0 then i:=((b-a+1)/2) else
 begin
  i:=((b-a) div 2)+1;
  d:=b mod 2;
  if d=0 then i:=i-1;
 end;
if a=b then i:=1;
writeln (i);
readln;
end.

Hello,

I'm trying to solve this problem using brute force. I've tried several inputs and program works just fine, but for some reason I'm getting WA on the first test. :(

I searched threads and saw that many users had the same problem and then solved it, but no one of them said how he managed to overcome this problem.

Please help.

Thank in advance.

well its so fucking problem.c compiler isn't c99 standarts.it's awful

когда Егор считается сбитым?
когда он имеет хотя бы одну точку с автомобилем или же когда он находится строго внутри?
другими словами - может ли Егор касаться автомобилей в процессе перемещения?

If u Ac more than 50 prob,it well be difficult to copy them one by one.
Any good idea?????

I have WA for Test #11.
Any test case ?

this is my code, but wa in test 1, why?
what is the test 1,
thanks
sorry my english is very poor
    import java.io.*;
    import java.util.*;

    public class Main{


        static int sum(int n)
        {
            int sum=n%10+(n/10)%10+(n/100)%10;
            return sum;
        }

        static boolean solve(String n)
        {
            String ant=n.substring(0,3);
            String post=n.substring(3,6);
            if(ant.compareTo(post)==0)
               return true;
            else
            {

            int antn=Integer.parseInt(ant);
            int postn=Integer.parseInt(post);

            int a;
            int b;
            int c;
            int d;
            if(postn+1>999)
            {
                a=antn+1;
                b=0;
            }
            else
            {
                a=antn;
                b=postn+1;
            }
            if(postn-1<0)
            {
                c=antn-1;
                d=999;
            }
            else
            {
                c=antn;
                d=postn-1;
            }
            a=sum(a);
            b=sum(b);
            c=sum(c);
            d=sum(d);

            if(a==b||c==d)
               return true;
            else
             return false;
            }
        }


        public static void main (String args[])
        {
            Scanner in=new Scanner(System.in);
            String n;
            while(in.hasNext())
            {
              n=in.next();
              if(solve(n))
                System.out.println("YES");
              else
                System.out.println("NO");
            }
        }
    }

Hi there.
I've got TL on 16-th with exceedence of 42 ms. Would anybody be so kind to help me manage with it?

In my solution, i am building n lists: in i-th list, there are indexes of teams, that can occupy i-th office. After that, i'm running through all n lists, trying to find any OK variant.

{{{
void run(int deep)
{
    if (deep == n)
    {
        if (final.size() == 0)
            final = answer;
        else
        {
            cout << cAnswerIsNotUnique << "\n";
            exit(0);
        }
    }
    else
    {
        for (int i = 0; i < ok[deep].size(); i++)
        {
            int target = ok[deep][i];
            if (!cap[target])
            {
                cap[target] = true;
                answer[target] = deep;

                run(deep + 1);
                // cleanup
                answer[target] = -1;
                cap[target] = false;
            }
        }
    }
}
}}}

How can i modify my algorithm for better runtime?
I would be glad for any clue.
Thx.

Edited by author 16.11.2011 20:45

I sent one solution without any corrections 2 times. First time I got TL14, but second time I got WA17! What the trick?

http://acm.timus.ru/status.aspx?space=1&num=1837&author=69236

OMG, finally Accepted...

I used DP with byte[10^7], and it actually works kinda slow (~0.85s) and uses 12Mb.

Tho I saw some solutions in java in 0.5-0.6s with less than 1 Mb... I wonder what they did...

Edited by author 21.02.2009 18:37

this my code:


var
  a,b,s,ms:string[50];
  ss,mss,k,n,i,j:integer;
begin
  readln(s);
  n:=length(s);
  mss:=0;
  for i := 2 to n div 2 do
    for j := 1 to n-i-1 do
      begin
        a:=copy(s,j,i);
        ss:=1;
        for k := j+1 to n-i+1 do
          begin
            b:=copy(s,k,i);
            if a=b then inc(ss,1);
          end;
        if mss<=ss then
        begin
          mss:=ss;
          ms:=a;
        end;
      end;
  if mss=1 then write(s) else write(ms);
end.

OR


var
  a,b,s,ms:string[50];
  ss,mss,k,n,i,j:integer;
begin
  readln(s);
  n:=length(s);
  mss:=0;
  for i := 2 to n div 2 do
    for j := 1 to n-i-1 do
      begin
        a:=copy(s,j,i);
        ss:=1;
        for k := j+1 to n-i+1 do
          begin
            b:=copy(s,k,i);
            if a=b then inc(ss,1);
          end;
        if mss<=ss then
        begin
          mss:=ss;
          ms:=a;
        end;
      end;
  write(ms);
end.

#include <cstdio>
int main()
{
   int a,b;
   scanf("%i %i",&a,&b);
   printf("%i",a+b);
   return 0;
}

which data is using in first test?

Can anyone give me test 9?

This is my source:
var
arn:array[1..150]of integer;
i,j,n,ans,t:integer;
begin
t:=1;ans:=0;
readln(n);
for i:=1 to n do
readln(arn[i]);
for i:=1 to n do
if arn[i]<>0 then
begin
for j:=1 to n do
begin
if (i<>j) and (arn[i]=arn[j]) then begin t:=t+1; arn[j]:=0 end;
if t=4 then begin t:=1; ans:=ans+1; end;
end;
t:=1;
end;
writeln(ans);
end.

Can anybody tell me, where mystake? I think to my programm is right. What is input in test  4?Help, please.

Test generated by the following program is hard for recursive solutions on some languages. For example Java recursive solution uses approx 31M of stack on this test while the whole ML of this problem is 16M.

Very very strange that the test set does not contain test with maximal possible answer.

const
   height = 1000;
   width = 1000;
var
   line, column : integer;
begin
   writeln(height, ' ', width);
   for line := 1 to height do begin
      for column := 1 to width do begin
         if
            (line = 1) or (line = height) or
            (column = 1) or (column = width) or
            (line mod 4 = 1) and (column > 2) or
            (line mod 4 = 3) and (column < width - 1)
         then begin
            write('#');
         end
         else begin
            write('.');
         end;
      end;
      writeln;
   end;
end.

Edited by author 09.01.2009 17:29

Can someone please tell what is in test #16?

can someone please tell what is in test #6?

50000
1 1 1 1 1 1 1 1 1 1
0000000000
0000000001
0000000002
0000000003
0000000004
.
.
.
0000049994
0000049995
0000049996
0000049997
0000049998
0000049999