there is only one answer or no answer, therefor if the solution exist it's the shortest.
hope can help you.
GOOD LUCK!!!

anyone knows test 6, I have been with this problem for 1 hour

#include<stdio.h>
main()
{
    int N,M,a[1000],i;
    scanf("%i %i",&N,&M);
    for(i=0;i<N;i++)scanf("%i",&a[i]);
    for(i=M;i<M+10;i++)printf("%i",a[i%N]);
}

there is a lot of stuff one has to guess in order to get this problem accepted.

Anyway, watch out for this test:
'a' like '[a-]'

What is in test №2?

I wonder if it's true that the first test matches the sample. My program writes 'Yes' just like in the sample.
But it gets WA1 ??

I use suffix array to solve this problem...but i've WA 30 many times and don't know why.
Can someone give me some hint or tests ?

const
        maxn=100000;
var
        st,en,n,i,j,k,now,tot,m,tmp,o,ans:longint;
        s:ansistring;
        r,d,failed,fa,h:array[0..maxn]of longint;
        w:array[1..maxn,1..2]of longint;
        target:array[0..maxn]of boolean;
function min(x,y:longint):longint;
begin
        if x<y then exit(x) else exit(y);
end;
begin
        readln(n);
        for n:=1 to n do begin
                readln(s);
                now:=0;
                for j:=1 to length(s) do begin
                        i:=r[now];
                        while i<>0 do begin
                                if w[i,1]=ord(s[j]) then begin
                                        now:=i;
                                        break;
                                end;
                                i:=w[i,2];
                        end;
                        if i=0 then begin
                                inc(tot);
                                fa[tot]:=now;
                                w[tot,1]:=ord(s[j]);
                                w[tot,2]:=r[now];
                                r[now]:=tot;
                                h[tot]:=h[now]+1;
                                now:=tot;
                        end;
                end;
                target[now]:=true;
        end;
        st:=0;
        d[1]:=0;
        en:=1;
        repeat
                inc(st);
                i:=r[d[st]];
                while i<>0 do begin
                        inc(en);
                        d[en]:=i;
                        i:=w[i,2];
                end;
        until st=en;
        for j:=2 to en do begin
                k:=fa[d[j]];
                i:=0;
                while (i=0)and(k<>0) do begin
                        k:=failed[k];
                        i:=r[k];
                        while i<>0 do begin
                                if w[i,1]=w[d[j],1] then break;
                                i:=w[i,2];
                        end;
                end;
                failed[d[j]]:=i;
                if target[i] then begin
                        if not target[d[j]] then h[d[j]]:=min(h[d[j]],h[i]);
                        target[d[j]]:=target[d[j]] or target[i];
                end;
        end;
        failed[0]:=-1;
        readln(m);
        for m:=1 to m do begin
                readln(s);
                ans:=length(s)+1;
                now:=0;
                for j:=1 to length(s) do begin
                        k:=now;
                        i:=0;
                        while (i=0)and(k<>-1) do begin
                                i:=r[k];
                                while i<>0 do begin
                                        if w[i,1]=ord(s[j]) then break;
                                        i:=w[i,2];
                                end;
                                if i=0 then k:=failed[k];
                        end;
                        now:=i;
                        if target[now] then ans:=min(ans,j-h[now]+1);
                end;
                if ans<length(s) then break;
        end;
        if ans<=length(s) then begin
                writeln(m,' ',ans);
        end else writeln('Passed');
end.

I wonder, what this test case is ...

I have used getchar(),but still WA 5#,why??

Or give me the test data...

Edited by author 30.01.2011 19:21

whats test 11 pls ? :)

I know the meaning of this problem,but I just can't find a good way to solve it!!
So who can tell me ?
Thank you!
I use C++

Edited by author 06.09.2010 20:15

MY ALGO TIME CONSUMED IS(250+128)*N unit

my method is:

divide distance between [0,32000] to 128 sector
each sector is total of stars that occured in that portion
hence for each x, level x calcute of bottom formula
level = sector[x/250]+ Xpivot[i] that i=int(x/250)*250 to x
in last update value of all sector that indexs greater than this sector index;

{$N+}
Program Mars_satellites;

 Var
   cos_,x,a,b,c,d:Double;

Begin
  Readln(a,b,c,d);
  If (a*b-c*d)=0 Then
  Begin
    Write('Impossible');
  End
  Else
  Begin
    cos_:=a*a+b*b-c*c-d*d;
    cos_:=cos_/(2*a*b-2*c*d);
    x:=a*a+b*b-2*a*b*cos_;
    x:=sqrt(x);
    x:=round(1000*x);
    Write('Distance is ',x:0:0,' km.');
  End;
End.

I don't know what's wrong, but it seems that i get wrong answer on test 11. Do you have any idea what it contains?

Hey, everybody! I'd like to ask for a test data of this problem similar to test #8. I've read through the discussions and passed all the test data given in earlier topics but still got stuck at #8. Any help will be appreciated!!


Edited by author 07.04.2012 14:05

wa #21. Can anybody help me?

Program P1;
Var
  Map: Array[1..100,1..100] of Integer;
  S,G,F: Array[1..100] of Integer;
  A,I,B,J,N,M,K,L,P,R: Integer;

Begin
  Readln(N,M);
  For A:=1 to N do
    For B:=1 to N do
      Map[A,B]:=16000;

  For I:=1 to M do begin
    Read(L);
    For J:=1 to L do
      Read(S[J]);
    For A:=1 to L do
      For B:=1 to L do
        Map[S[A],S[B]]:=1;
  End;

  For A:=1 to N do
    For B:=1 to N do
      For I:=1 to N do
        If Map[A,B]>Map[A,I]+Map[I,B] then Map[A,B]:=Map[A,I]+Map[I,B];

  Read(K);
  A:=0;
  For I:=1 to K do begin
    Readln(G[I],S[I],F[I]);
    A:=A+G[I];
  End;

  P:=0;
  R:=P;
  For I:=1 to N do begin
    P:=0;
    For J:=1 to K do begin
      If I=S[J] then begin P:=P+G[J]; continue; End;
      If Map[I,S[J]]=16000 then begin P:=0; Break; End;
      If (Map[I,S[J]]*4>=G[J]) and (F[J]=0) then begin P:=0; Break; End;
      If F[J]=1 then begin P:=P+G[J]; Continue; End;
      P:=P+G[J]-Map[I,S[J]]*4;
    End;
    If P>R then begin
      R:=P;
      L:=I;
    End;
  End;
  If R<>0 then Writeln(L,' ',A-R)
          else Writeln(0);
End.

try this test case

dfadfmmmmfad

Correct answer

dfadad

Hope this helps...

Could somebody give me 12 test ?

Sory for bad my English...