在这里是全对，但在no上0分........

var
a,b,c:array[1..5000]of longint;
d:array[10..36]of char;
i,j,k,l,n:longint;
m:char;
begin
assign(input,'fjz.in');
assign(output,'fjz.out');
reset(input);
rewrite(output);
k:=1;
n:=10;
for m:='A'TO 'Z'DO
begin
d[n]:=m;
n:=n+1;
end;
repeat
inc(i);
read(a[i]);
read(b[i]);
until eof ;
for j:=1 to i do
begin
write(a[j],'=');
repeat
begin
c[k]:=a[j] mod b[j];
a[j]:=a[j] div b[j];
if c[k]<0 then
begin
a[j]:=a[j]+1;
c[k]:=c[k]-b[j];
end;
k:=k+1;
end;
until (a[j]=0);
for l:=k-1 downto 1do
begin
if c[l]>=10 then write(d[c[l]])else
write(c[l]);
end;
write('(base ',b[j],')');
writeln;
k:=1;
end;
close(input);
close(output);
end.
前五个点过不去，求解

表示太难过最后一个T，自己怎么也过不去.
求提速
var
x,y,f,maxy,z,n,i,j:longint;
a:array[1..1000000]of integer;
begin
assign(input,'tickets.in');
assign(output,'tickets.out');
reset(input);
rewrite(output);
readln(n,f);
for i:=1 to n do
read(a[i]);
for i:=1 to n do
begin
z:=f;
for j:=i to n do
begin
z:=z-a[j];
if z>=0 then y:=y+1
else
begin
if(maxy<y)then maxy:=y;
y:=0;
break;
end;
end;
end;
write(maxy);
close(input);
close(output);
end.

一次过

复赛留念