Statement is unclear. If you want to solve it you must try all possible interpretations of this statement 'till find the one that the author intended.

56 2
56 68

49 4
7 41 43 65

If you get WA5, check case, where policeman catch the thief until first tram arrive.

#include <iostream>
using namespace std;

const int kmax=105;

int K[kmax];
int L,n;

int R(int x, int y)
{
   if(x%y==0) return x/y;
   else return x/y+1;
}

int main()
{
   cin>>L>>n;
   for(int i=1;i<=n;i++) cin>>K[i];

   if(n==1)
   {
      if(L<K[1]) cout<<"YES";
      else cout<<"NO";
      return 0;
   }

   int t1=R(L, K[1])*K[1], t2=K[1];
   if(t1==t2) t1+=K[1];

   for(int i=2;i<=n;i++)
   {
      t2+=K[i];
      if(t1<t2)
      {
         cout<<"YES";
         return 0;
      }
      t1=t2+R(t1-t2,K[i])*K[i];
      if(t1==t2) t1+=K[i];
   }

   cout<<"NO";

   return 0;
}


and


#include <iostream>
using namespace std;

const int kmax=105;

int K[kmax];
int L,n;

int main()
{
   cin>>L>>n;
   for(int i=1;i<=n;i++) cin>>K[i];

   if(n==1)
   {
      if(L<K[1]) cout<<"YES";
      else cout<<"NO";
      return 0;
   }

   int t1=(L/K[1]+1)*K[1], t2=K[1];

   for(int i=2;i<=n;i++)
   {
      t2+=K[i];
      if(t1<t2)
      {
         cout<<"YES";
         return 0;
      }
      t1=t2+(1+(t1-t2)/K[i])*K[i];
   }

   cout<<"NO";

   return 0;
}

?????????????????????????????????????????????

Hi
I had solved this problem with just 3 shortint...
It so easy look other messages in this problem to understand what is
happening!
All you need is:

    dec(n,n mod y);

where y is that K[i]`s which described in problem.
nothing is special for this problem...
With best Wishes
Aidin_n7@hotmail.com

What is the output for this two inputs??

3 2
1 2


and

3 3
1 2 2

Old name "Cops and Robbers" could be confusing because of problem 1277 "Cops and Thieves". New name is "Catch the thief!"

If L == K, policeman doesn't catch the theif. I got AC when supposed so.

Where do the intervals start from? And why doesn't it matter the
legth of the tram travels? I mean, it must matter for the interval of
the trams....... Explain PLZ

just why WA 1?
#include<iostream>
using namespace std;
int main() {
  int l, n, k;
  cin>>l>>n;
  while(n--){
    cin>>k;
    if(l<=k) {cout<<"YES"; return 0;}
    l-=k;
    l+=l%k;
  }
  cout<<"NO";
  return 0;
}

I have WA#10. Can you help me?
here is my code:
program _1191;

{$APPTYPE CONSOLE}

uses
  SysUtils;

var   k:array[1..100]of longint;
l,n,i,q,z:longint;
begin
reset(input,'input.txt');
 rewrite(output,'ouput.txt');
  read(l,n);
  q:=1;
  z:=0;
  for i:=1 to n do
    begin
     read(k[i]);
     z:=z+k[i];
     if l<z then
        begin
          write('YES');
          halt(0);
        end
     else
      while l>z+q*k[i] do
        inc(q);
      l:=z+q*k[i];
        q:=1;
    end;
   write('NO');
end.

Edited by author 18.03.2009 19:38

Comma must be put after the word "поехать" in the first sentence of the statement.

What is the output for this two inputs??

3 2
1 2


and

3 2
1 2 2

I tried to submit many times my solution which I think is right but I got WA 1 many times. Then I submitted the following solution:

#include <iostream>
using namespce std;
int main()
{
    cout<<"YES";
    return 0;
}

and I still have WA1, why (as far as I know the first test is the same as the sample test where the right output is YES)

I've got WA on case 10.
plz help me.
#include<stdio.h>
int main(){
....int n,k,i,dis;
....scanf("%d%d",&dis,&n);
....for(i = 0;i < n;i++){
........scanf("%d",&k);
........if(dis != k) dis -= k;
........if(dis < 0){printf("YES"); return 0;}
........if(dis % k != 0) dis += k - dis%k;
....}
....printf("NO");
....return 0;
}

Edited by author 02.05.2006 23:21

It would be the best if you email pipm@mail2000.ru

Program acm_1191; {Cops And Robbers}
Var i,j,k       :integer;
    L,N         :integer;
    A           :array [1..100] of integer;

Begin
  ReadLN(L,N);
  For i:=1 to N do Read(A[i]);

  For i:=1 to N do
  Begin
    {Checking I-th stop}
    If A[i]>=l then Begin Writeln('YES'); Halt(0); End; {CAUGHT}
    j:=200*A[i]-l;
    l:=l+(j mod A[i]); {Cop waiting}
    l:=l-A[i]; {Robber waiting}
  End;
  Writeln('NO');
End.