固定一个数，对于其余的5个数考虑S53与S52，再分这两种情况对原固定的数进行分析。）2、（最短路线）某城市的街道是一个很规整的矩形网络（见下图），有7条南北向的纵街，5条东西向的横街。现要从西南角的A走到东北角的B，最短的走法共有多少种？___________B
A三、阅读程序写结果（共4题，每题8分，共计32分。）1、programj301variabcxyi
tegerparray04ofi
tegerbegi
y20fori0to4doreadpireadl

fap0p1p2p3p4div7bp0p1divp2p3divp4cp0p1divp2xabpp33mod4ifx10the
yyb100adivpp4mod35elseyy20b100cdivpp4mod35writel
xye
d注：本例中，给定的输入数据可以避免分母为0或数组元素下表越界。输入：66553输出：______________________2、programj302varabi
tegervarxyi
tegerprocedurefu
abi
tegervarki
tegerbegi
kaabbke
dbegi
a3b6xaybfu
xywritel
abe
d输出：_______________________________3、programj303vara1array150ofi
tegervarijtt2
2i
tegerbegi
50fori1to
doa1i0
2rou
dsqrt
fori2to
2doifa1i0the
begi
t2
diviforj2tot2doa1ij1e
dt0fori2to
do
fifa1i0the
begi
writei4i
ctiftmod100the
writel
e
dwritel
e
d输出：__________________________________________________________________________________________4、Programj304Typestr1stri
g100Str2stri
g200VarS1str1s2str2Fu
ctio
isalphaccharBoolea
Varii
tegerBegi
iordcifi65a
di90ori97a
di122the
isalphatrueelseisalphafalsee
dfu
ctio
isdigitccharBoolea
varii
tegerbegi
iordcifi48a
di57the
isdigittrueelseisdigitfalsee
dprocedureexpa
ds1str1vars2str2variji
tegerabccharbegi
j1cchar1i0whileiords10dobegi
i
cics1iifcthe
begi
1as1i1bs1i1ifisalphaaa
disalphaborisdigitaa
disdigitbthe
begi
decjwhileordupcaseaordupcases1i1dobegi
s2jai
cji
cae
d
fe
delsebegi
s2jci
cje
de
d1elsebegi
s2jci
cje
de
ds20charj2e
dbegi
readl
s1expa
ds1s2writel
s2e
d输入：wer2345dh45482qqq输出：__________________________四、完善程序（前4空，每空25分，后6空，每空3分，共28分）。1、（求字符的逆序）下面的程序的功能是输入若干行字符串，每输入一行，就按逆序输出该行，最后键入1终止程序。请将程序补充完整。Programj401typestr1stri
g100varli
estr1kzi
tegerprocedurereversevarsstr1varIji
tegerr