2010年10月19日 总结

继续...

 

今天：

种菊

监考老师

图书馆书目检索

越野跑

验证数独

排队

 

种菊：题目类型为模拟，不过好像很水的那种。

program rq122; var n:longint; begin readln(n); n:=n mod 16; case n of 1,8,11,14:writeln('hong'); 2,5,12,15:writeln('bai'); 3,6,9,0:writeln('qing'); 4,7,10,13:writeln('huang'); end; case n of 0:writeln('huang hong bai qing'); 1..4:writeln('hong bai qing huang'); 5..8:writeln('bai qing huang hong'); 9..12:writeln('qing huang hong bai'); 13..15:writeln('huang hong bai qing'); end; end.

监考老师：就是单纯的模拟，不要想的太多。

program rq138; var n,m,i,j:longint; tot,maxx,maxy:longint; a:Array[1..100,1..100]of longint; begin readln(n,m); for i:=1 to n do for j:=1 to m do read(a[i,j]); maxx:=0; for i:=1 to n do begin tot:=0; for j:=1 to m do if a[i,j]=1 then inc(tot); if tot>maxx then maxx:=tot; end; maxy:=0; for j:=1 to m do begin tot:=0; for i:=1 to n do if a[i,j]=1 then inc(tot); if tot>maxy then maxy:=tot; end; writeln(maxx+maxy); end.

图书馆书目检索：模拟模拟...

program rq159; var f:array[1..200000]of boolean; n,k,i,j:longint; function prime(x:longint):boolean; var i:longint; begin for i:=2 to trunc(sqrt(x)) do if x mod i=0 then exit(false); exit(true); end; begin readln(n,k); for i:=1 to n do begin read(j); f[j]:=true; end; for i:=k+1 to 200000 do if f[i] then break; for j:=k-1 downto 1 do if f[j] then break; writeln(i+j); if prime(i+j) then writeln('Y') else writeln('F'); end.

越野跑：依旧模拟，实际上我今天是来做模拟的

program rq170; var m,t,u,f,d,total:longint; ch:char; begin readln(m,t,u,f,d); f:=f shl 1;inc(u,d); total:=0; while m>=0 do begin readln(ch); case ch of 'u','d':dec(m,u); 'f':dec(m,f); end; if m<0 then writeln(total) else inc(total); end; end.

验证数独：模拟，只不过那个小九宫格实在是写得太ws了。

program rq289; var i,j:longint; a:array[1..9,1..9]of longint; s:set of 1..9; function getx(i,j:longint):longint; begin case i of 1..3: case j of 1..3:exit(1); 4..6:exit(2); 7..9:exit(3); end; 4..6: case j of 1..3:exit(4); 4..6:exit(5); 7..9:exit(6); end; 7..9: case j of 1..3:exit(7); 4..6:exit(8); 7..9:exit(9); end; end; end; function gety(i,j:longint):longint; begin case i of 1,4,7: case j of 1,4,7:exit(1); 2,5,8:exit(2); 3,6,9:exit(3); end; 2,5,8: case j of 1,4,7:exit(4); 2,5,8:exit(5); 3,6,9:exit(6); end; 3,6,9: case j of 1,4,7:exit(7); 2,5,8:exit(8); 3,6,9:exit(9); end; end; end; begin for i:=1 to 9 do for j:=1 to 9 do read(a[i,j]); for i:=1 to 9 do begin s:=[]; for j:=1 to 9 do s:=s+[a[i,j]]; if s<>[1..9] then begin writeln(0);halt;end; end; for j:=1 to 9 do begin s:=[]; for i:=1 to 9 do s:=s+[a[i,j]]; if s<>[1..9] then begin writeln(0);halt;end; end; for i:=1 to 9 do begin s:=[]; for j:=1 to 9 do s:=s+[a[getx(i,j),gety(i,j)]]; if s<>[1..9] then begin writeln(0);halt;end; end; writeln(1); end.

排队：简单的队列模拟，注意最后如果队列为空就不用输出了，否则会WA。

program rq78; var k,i,j,l1,l2,l,x:longint; s,w:string; s1:char; begin readln(s); writeln(s); readln(k); for i:=1 to k do begin read(s1);readln;x:=pos(s1,s); l1:=x-1;l2:=length(s)-x; if l1<=l2 then begin w:=copy(s,1,x-1);delete(s,1,x);l:=length(w); for j:=1 to l do s:=w[j]+s; end else begin w:=copy(s,x+1,length(s)-x); delete(s,x,length(s)-x+1); l:=length(w); for j:=1 to l do s:=s+w[l+1-j]; end; if s<>'' then writeln(s); end; end. 

2010年10月19日22:38:27