- 1、本文档共11页,可阅读全部内容。
- 2、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。
- 3、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载。
- 4、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
查看更多
program exp1 (imput,output); var i,s,max:integer;
a:array [1..10] of integer; begin
for i:=1 to 10 do read(a[i]); max:=a[1]; s:=a[1];
for i:=2 to 10 do begin
if s0 then s:=0; s:=s+a[i];
if smax then max:=s end; writeln(‘max=’,max) end.
输入:-2 13 -1 4 7 8 -1 -18 24 6
输出:max=
输入:8 9 -1 24 6 5 11 15 -28 9
输出:max=
program exp2 (input,output); const n=5;
var i,j,k:integer;
a:array[1..2*n, 1..2*n] of integer; begin
k:=1;
for i:=1 to 2*n-1 do if i=n then
if odd(i) then for j:=i downto 1 do begin a[i-j+1,j]:=k; k:=k+1 end else for j: =1 to i do begin a[i-j+1,j]:=k; k:=k+1; end
else if odd(i) then for j:=n downto i-n+1 do begin a[i-j+1,j]:=k; k:=k+1; end
else for j:=i-n+1 to n do
begin a[i-j+1,j]:=k; k:=k+1; end; for i:=1 to n do
begin
for j:=1 to n do write(a[i,j]:3); writeln
end; end.
program exp3 (input,output); const n=10;
var s,i:integer;
function co(i1:integer):integer; var j1,s1:integer;
begin
s1:=n; for j1:=(n-1) downto (n-i1+1) do s1:=s1*j1 div (n-j1+1); co:=s1
end; begin
s:=n+1; for i:=2 to n do s:=s+co(i);
writeln(‘s=’,s);
end.
program exp4(input,output); const n=3;
var i,j,s,x:integer;
p:array [0..n+1] of integer; g:array [0..100] of integer; begin
for i := 0 to 100 do g[i]:=0;
p[0]:=0; p[n+1]:=100; for i:= 1 to n do read (p[i]); readln; for i:= 0 to n do
for j:= i+1 to n+1 do g[abs(p[j]-p[i])]:=g[abs(p[j]-p[i])]+1;
s:=0; for i:=0 to 100 do if g[i]0 then begin write(i,:4); s:=s+1; end;
writeln; writeln(‘s=’,s); writeln(‘input data:’); readln(x); writeln(g[x])
end.
输入:10 20 65
input data: 10
输出:
program excpl;
var x,y,y1,jk,j1,g,e:integcr; a:array [l..20] of 0..9; begin
x:=3465; y:=264; jk:=20; for j1:=1 to 20 do a[j1]:=0; while y<>0 do
begin
y1:=y mod 10; y:=y div 10; while y1<>0 do
begin
g:=x;
for e:=jk downto 1 do begin g:=g+a[e]; a[e]:=g mod 10; g:=g div 10 end; y1:=y1-1
end; jk:=jk-1 end;
j1:=1; while a[j1]=0 do j1:=j1+1;
for jk:=j1 to 20 do write(a[jk]:4); writeln end.
program excp2 var i,j:integer;
a:array [1..14] of integer; procedure sw(i1,j1:integer); var
文档评论(0)