#1 `Kimi*@2009-03-06 22:10:00
10516
回复
删除
program benhouzi;
var
i,j,a,x,y,z,c,d,w,l,r,minn,maxn:integer;
m:array[1..100]of char;
n:array[1..100]of integer;
begin
read(m[d]);
x:=1;maxn:=0;minn:=d;
for i:=1 to d-1 do
begin
for j:=(i+1) to d do
begin
if (m[i]=m[j]) and (i<>n[i]) then
begin
x:=x+1;
n[j]:=j;
end;
end;
if (minn>=x) and (i<>n[i])then
begin
minn:=x;
end;
if (maxn<x) then
begin
maxn:=x;
end;
x:=1;
end;
y:=maxn-minn;
z:=2;
repeat
r:=y mod z;
if r=0 then w:=1;
if y=1 then w:=1;
if y=2 then w:=0;
z:=z+1;
until(z>y-1)or (w=1);
if w=0 then
begin
writeln(’Lucky Word’);
writeln(y);
end;
if w=1 then
begin
writeln(’No Answer’);writeln(’0’);
end;
end.