NOIP2008普及组复赛思路及程序(PASCAL).doc

第一题 Program Gy; Const Name=isbn; Var A,B:String; Procedure Inp; Begin Assign(Input,Name+.in);Reset(Input); Assign(Output,Name+.out);Rewrite(Output); Readln(A); End; Procedure Main; Var i,j,k:Longint; Begin j:=0;k:=0; For i:=1 to Length(A)-1 do If Aiin0.9then Begin Inc(k); j:=j+(Ord(Ai)-Ord(0)*k; End; j:=j mod 11; B:=A; If j=10 then BLength(B):=XElse BLength(B):=Chr(j+Ord(0); End; Procedure Oup; Begin If B=A then Writeln(Right) Else Writeln(B); Close(Input); Close(Output); End; Begin Inp; Main; Oup; End. 第二题 Program Gy; Uses Math; Const Name=seat; Var x1,y1,x2,y2:Array1.3000of Longint; N,M,K,L,D:longint; A,C:Array1.2,1.2000of Longint; B1,B2:Array1.2000of Byte; Procedure Inp; Var i:longint; Begin Assign(Input,Name+.in);Reset(Input); Assign(Output,Name+.out);Rewrite(Output); Randomize; Readln(M,N,K,L,D); For i:=1 to D do Readln(x1i,y1i,x2i,y2i); End; Procedure Sort(p,l,r:Longint); Var i,j,x,y:Longint; Begin i:=l;j:=r;x:=ap,Random(r-l)+l; Repeat While ap,ix do Inc(i); While ap,jx do Dec(j); If ij; If lj then Sort(p,l,j); If ir then Sort(p,i,r); End; Procedure Main; Var i:Longint; Begin For i:=1 to M do C1,i:=i; For i:=1 to N do C2,i:=i; For i:=1 to d do If x1i=x2ithen Inc(A2,Min(y1i,y2i) Else Inc(A1,Min(x1i,x2i); Sort(1,1,N); Sort(2,1,M); For i:=1 to K do B1C1,i:=1; For i:=1 to L do B2C2,i:=1; End; Procedure Oup; Var i,j:Longint; Begin j:=0; For i:=1 to M-1 do If b1i=1 then Begin Inc(j); Write(i); If jK then Write( ); End; Writeln; j:=0; For i:=1 to N-1 do If b2i=1 then Begin Inc(j); Write(i); If jL then Write( ); End; Writeln; Close(Input); Close(Output); End; Begin Inp; Main; Oup; End. 第三题 Program Gy; Uses Math; Const Name=ball; Var F:Array0.1,1.500of Longint; M,N:Longint; Procedure Inp; Begin Assign(Input,Name+.in);Reset(Input); Assign(Output,Name+.out);Rewrite(Output); Readln(n,m); End; Procedure Main; Var i,j:Longint; Begin F0,1:=1; For i:=1 to M do For j:=1 to N do Fi mod 2,j:=F(i-1)mod 2,(j+n-2)mod n+1+F(i-1)mod 2,(j+n)mod n+1; End; Procedure Oup; Begin Writeln(FM mod 2,1); Close(Input); Close(Output); End; Begin Inp; Main; Oup; End. 第四题 Program Gy; Const Work=drawing; Type Rec=Record X,Y:longint; End; Arr=Array1.20000 of Longint; Var A:Array1.300,1.300 of Longint; N,M,MaxN,MaxM:Longint; B:Array1.1000,1.1000of Char; Procedure Inp; Var i,j:Longint; Begin Assign(Input,Work+.in);Reset(Input); Assign(Output,Work+.out);Rewrite(Output); Read(n,m); For i:=1 to N do For j:=1 to M do Read(an+1-i,j); MaxN:=0;MaxM:=0; For i:=1 to N do For j:=1 to M do Begin If 2*i+4*j+1MaxM then MaxM:=2*i+4*j+1; If (2*i+3*ai,j+1MaxN) then Maxn:=2*i+3*ai,j+1; End; For i:=1 to MaxN do For j:=1 to MaxM do Bi,j:=.; End; Procedure Main; Var i,j,k,x,y:Longint; Begin For i:=N downto 1 do For j:=1 to M do For k:=1 to Ai,j do Begin Y:=2*i+4*j-5;X:=2*i+3*k-4; Bx,y:=+; Bx,y+1:=-; Bx,y+2:=-; Bx,y+3:=-; Bx,y+4:=+; Bx+1,y:=|; Bx+1,y+1:= ; Bx+1,y+2:= ; Bx+1,y+3:= ; Bx+1,y+4:=|; Bx+1,y+5:=/; Bx+2,y:=|; Bx+2,y+1:= ; Bx+2,y+2:= ; Bx+2,y+3:= ; Bx+2,y+4:=|; Bx+2,y+5:= ; Bx+2,y+6:=+; Bx+3,y:=+; Bx+3,y+1:=-; Bx+3,y+2:=-; Bx+3,y+3:=-; Bx+3,y+4:=+; Bx+3,y+5:= ; Bx+3,y+6:=|; Bx+4,y+1:=/; Bx+4,y+2:= ; Bx+4,y+3:= ; Bx+4,y+4:= ; Bx+4,y+5:=/; Bx+4,y+6:=|; Bx+5,y+2:=+; Bx+5,y+3:=-; Bx+5,y+4:=-; Bx+5,y+5:=-; Bx+5,y+6:=+; End; End; Procedure Oup; Var i,j:Longint; Begin For i:=MaxN downto 1 do Begin For j:=1 to MaxM do Write(bi,j); Writeln; End; Close(Input); Close(Output); End; Begin Inp; Main; Oup; End.第3题要一步一步算，程序如下varm,n,i,j:integer;a:array-30.30,0.30of longint;beginassign(input,ball.in);reset(input);assign(output,ball.out);rewrite(output);read(m,n);for i:=-n to n doif i mod m=0then ai,n:=1else ai,n:=0;for i:=n-1 downto 0 dofor j:=-i to i doaj,i:=aj 1,i 1 aj-1,i 1;writeln(a0,0);close(input);close(output)end.第四题的话，要按从上到下一层一层的覆盖，并且要先算出输出图形的大小，程序如下（不好意思，因为本人水平问题，这个程序只能通过小的数据）vars:array1.150of string;a:array1.50,1.50of integer;m,n,i,j,p,q,k,l,x,y:integer;beginassign(input,drawing.in);reset(input);assign(output,drawing.out);rewrite(output);read(m,n);for i:=1 to m dofor j:=1 to n doread(ai,j);p:=4*n 1 2*m;q:=0;for i:=1 to m dofor j:=1 to n doif 3*ai,j 3 2*m-2*iqthen q:=3*ai,j 3 2*m-2*i;for i:=1 to q dobeginsi:=;for j:=1 to p dosi:=si .end;for i:=1 to m dobeginx:=q-2*m 2*i;for j:=1 to n dobeginy:=1 2*m-2*i (j-1)*4;sxy:= ;sxy 4:= ;for k:=1 to 3 dosxy k:=-;sx-1y 1:=/;sx-1y 5:=/;sx-2y 2:= ;sx-2y 6:= ;for k:=1 to ai,j dobeginfor l:=1 to 2 dobeginsx-l-3*(k-1)y:=|;sx-l-3*(k-1)y 4:=|;sx-1-l-3*(k-1)y 5:= ;sx-2-l-3*(k-1)y 6:=|end;sx-3*ky:= ;sx-3*ky 4:= ;for l:=1 to 3 dobeginsx 1-3*ky l:= ;sx 2-3*ky l:= end;sx-2-3*ky 2:= ;sx-2-3*ky 6:= ;for l:=1 to 3 dosx-1-3*ky 1 l:= ;sx-1-3*ky 1:=/;sx-1-3*ky 5:=/;for l:=1 to 3 dobeginsx-3*ky l:=-;sx-3*k-2y l 2:=-endend;endend;for i:=1 to q dowriteln(si);close(input);close(output)end. 以上是推荐回答，你可以参考如下其他回答相关问题 求个NOIP复赛用的标准PASCAL,告诉我下载地址 找 NOIP 2007 提高组 复赛 的 解题报告(free pascal) noip复赛什么时候举行? 请问NOIP复赛中的输入输出文件需要自己制作还是比赛前就提供好的？ 请问pascal一道NOIP题目,有关逻辑判断设计江湖为你用户的其他回答参考： 其他答案我也错了请问你是怎么知道成绩的啊？谢谢 第三题:首先利用DP计算杨辉三角形的第n-1层,存入数组a,如果m是偶数则将a的正中那个数存入s,否则将0存入s,再将a数组中n的倍数加入s.就5分,不写了第四题:昨天奋斗了1小时,发现自己在考试时编的程序有问题.按照我考试时写的那个程序是不能出现0的.恩,扯远了.只要先将所有数据读入,计算字符串数组顶格的偏移值s1,然后从左往右,从下往上,从后往前画正方体,最后再将左端的.删除就可以了.只有C的源代码:#include char s501402;void drawing(int px,int py,int n)int i;spxpy 2= ;for(i=3;i6;i )spxpy i=-;spxpy 6= ;spx 1py 1=/;for(i=2;i5;i )spx 1py i= ;spx 1py 5=/;spx 2py= ;for(i=1;i4;i )spx 2py i=-;spx 2py 4= ;for(i=1;i=n;i )spx 3*ipy=spx 3*i 1py=spx 3*ipy 4=spx 3*i 1py 4=spx 3*i-2py 6=spx 3*i-1py 6=|;spx 3*ipy 1=spx 3*ipy 2=spx 3*ipy 3=spx 3*i 1py 1=spx 3*i 1py 2=spx 3*i 1py 3=spx 3*i-1py 5=spx 3*ipy