what test 4 looks like?

3 2

I basically used brute force,

if ( x==y) cout<<2;
if (x < y) cout<<"No solution";

then the rest brute force

var x,y,x1,y1,f,l:longint;a,b,c:array[1..1000] of byte;
   i,k,s,r,w,z:word;
begin
read(x, y);
l:=2;w:=0;
While (f<>1)and(l<=10) do begin
i:=1;
x1:=x;
s:=0;
c:=a;
b:=a;

Repeat
c[i]:=x1 mod l;
x1:=x1 div l;
inc(i);
inc(s)
until x1=0;

y1:=y;k:=0;
i:=1;
Repeat
b[i]:=y1 mod l;
y1:=y1 div l;
inc(i);
inc(k)
until y1=0;

r:=b[k];z:=1;i:=s;

Repeat
If c[i]=r then begin r:=b[k-z];inc(z);end;
dec(i);
until (z=k+1)or(i=0);
If z=k+1 then begin f:=1;w:=l;end;
inc(l);
end;
If w=0 then writeln('No solution')
else writeln(w)


end.

Help me please...

I Solved this problem, by transforming x and y into every system and search for the longest common substring.
But I am interested in another Ideas, better than mine, except brute force.

The best way to solve this problem is with bruteforce...
My brute: 0.031 121KB :)

New tests have been added. 15 authors have lost AC.

Please give me some tests.

I WAS one of the ACers in this problem.
I thought my algo was correct until...
Can U tell me some tests to find out my mistake(s)?

New tests were added. 169 authors lost AC.

200
3
100
100
100

Is it -1?

Edited by author 13.06.2006 11:57

How is it possible? There are really power server!

program de;
   var
   a,n,i,r,x,y,step,j:longint;
   q:boolean;
   s1,s2,s:string;
begin
  step:=1;
  q:=false;
  read(x);
  read(y);
  repeat
    s1:='';
    s2:='';
    n:=x;
    inc(step);
    repeat
     i:=n mod step;
     n:=n div step;
     str(i,s);
     s1:=s+s1;
    until n=0;
    r:=y;
    repeat
     i:=r mod step;
     r:=r div step;
     str(i,s);
     s2:=s+s2;
    until r=0;
    j:=1;
    for i:=1 to length(s1) do
     if (s1[i]=s2[j]) and (j<>length(s2)+1) then inc(j);
    if j=length(s2)+1 then q:=true;
  until (step=x+1) or q;
  if q then writeln(step)
  else writeln('No solution');
end.

program de;
   var
   a,n,i,r,x,y,step,j:longint;
   q:boolean;
   s1,s2,s:string;
begin
  step:=1;
  q:=false;
  read(x);
  read(y);
  repeat
  s1:='';
  s2:='';
  n:=x;
  inc(step);
  repeat
  i:=n mod step;
  n:=n div step;
  str(i,s);
  s1:=s+s1;
  until n=0;
  r:=y;
  repeat
  i:=r mod step;
  r:=r div step;
  str(i,s);
  s2:=s+s2;
  until r=0;
  j:=1;
  for i:=1 to length(s1) do
  if (s1[i]=s2[j]) and (j<>length(s2)+1) then inc(j);
  if j=length(s2)+1 then q:=true;
  until (step=x+1) or q;
  if q then writeln(step)
  else writeln('No solution');
end.

if so, it is a big problem

My program:
var
  x,y,x1,y1,k:longint;
  a,b:array [1..10000] of integer;

procedure init;
begin
  read(x,y);
  x1:=x;
  y1:=y;
end;

procedure work;
var
  flag,flag1:boolean;
  k1,k2,k3,i:longint;
begin
  k:=1;
  repeat
    x1:=x;
    y1:=y;
    inc(k);
    if k>=x then writeln('No solution');
    k1:=0;
    k2:=0;
    repeat
      inc(k1);
      a[k1]:=x1 mod k;
      x1:=x1 div k;
    until x1=0;
    repeat
      inc(k2);
      b[k2]:=y1 mod k;
      y1:=y1 div k;
    until y1=0;
    k3:=1;
    for i:=1 to k2 do
      repeat
        flag1:=false;
        if b[i]=a[k3] then begin flag1:=true; b[i]:=-1;end;
        inc(k3);
      until (flag1)or(k3>=k1);
    flag:=true;
    for i:=1 to k2 do
      if b[i]<>-1 then flag:=false;
  until flag;
end;

procedure print;
begin
  writeln(k);
end;

begin
  init;
  work;
  print;
end.