2008noip苯猴子解答
2008noip 信息学 竞赛 解答 苯猴子第一个题
program word;
var
i,j,l,c:integer;
s:string[101];
a:array[1..101] of integer;
f1,f2:text;
procedure init;
var t:integer;
begin
assign(f1,'word.in'); reset(f1);
readln(f1,s); close(f1); l:=length(s);
for i:=1 to l do a[i]:=ord(s[i])-ord('0');
for i:=1 to l-1 do
for j:=i to l do
if a[i]>a[j] then begin t:=a[i]; a[i]:=a[j]; a[j]:=t; end;
end;
procedure pd;
var max,min,all:integer;
begin
max:=1; min:=999; all:=1;
for i:=1 to l do
if a[i]=a[i+1] then inc(all)
else
begin
if all>max then max:=all;
if all<min then min:=all;
all:=1;
end;
c:=max-min;
end;
procedure print;
var k:integer;
begin
k:=0;
for i:=2 to c-1 do
if c mod i=0 then inc(k);
assign(f2,'word.out');rewrite(f2);
if (k=0) and (c<>1) and (c<>0) then
begin
writeln(f2,'Lucky Word'); write(f2,c);
end
else
begin
writeln(f2,'No Answer');write(f2,'0');
end;
close(f2);
end;
begin
init;
pd;
print;
end.
用户登录
还没有账号?
立即注册