jsj_第十四届全国青少年信息学_计算机_奥林匹克分区联赛初赛

1、Pascal 10 1.5 15 1. A. Solaris Symbian C. B. LinuxC. Sybase D. Windows Vista E.2 A. D.B. E.3. S=”Olympic” S A. 29 B. 28 C. 16 D. 17 D. 2N-1 E. N/2 E. 74 2*N-1 A. N-1 B. 2*N C. N5 8, 23, 4, 16, 77, -5, 53, 100 A. 4 B. 5C. 6 D. 7 E. 86 S a b c d e f S b d c f e a S A. 6 B. 5 C. 4 D. 3 E. 27. 28.5625 A

2、. 123.21 130.20 8 A. B. C. D. E.B. 131.22 C. 130.22 D. 130.21 E.9. TCP/IP TCP IP TCP/IP Internet , A. 10 5, 13, 19, 21, 37, 56, 64, 75, 88, 92, 100 A. 35/11 34/10 10 1.5 15 1 11. B. “ ” C. D. · 12A. B. CPU C.ROM D. RAM B. 34/11C. 33/11 E. B C. D. E.D. 32/11A. 1966A=true B=false C=true D=false 1

3、3.A. (A B) (C D ? A) C. (B C D) DA B. ( ? A B) C) ? D D. A (D ? C) B14 Web2.0 Web2.0 A. Sina B. FlickrC. Yahoo D. Google15. (2008)10 + (5B)16 A. (833)16(100001100011)2 16. T 1 2 4 3 5 7 6 4 2 7 5 6 3 1 B. (2099)10 C. (4063)8 D.A. 4 2 1 7 5 3 6 C. 4 2 1 7 5 6 3 B. 2 4 1 7 5 3 6 D. 2 4 1 5 7 3 617. Ob

4、ject-Oriented Programming A. B. inheritance encapsulation polymorphismC. C+ JAVA C# D. Simula SmallTalk SmallTalk 18. T n A. T C. T n-1 C. free pascalD.B. T n-1 D.19. NOIP A. Dev-C+ LazarusB. Visual C+20. firewallA. B. C. IPD. TCP/IP “ ” 2 5 10 1 6 6 1 6124561 2 3 4 5 60 2 3 1 12 15 2 0 2 5 3 12 3 2

5、 0 3 6 5 1 5 3 0 7 9 12 3 6 7 0 2 15 12 5 9 2 02 21 1 21 4 4 8 321. var i,a,b,c,d:integer; f:array0.3 of integer; begin for i:=0 to 3 do read(fi); a := f0 + f1 + f2 + f3; a := a div f0; b := f0 + f2 + f3; b := b div a; c := (b * f1 + a) div f2; d := f(b div c) mod 4; if (f(a + b + c + d) mod 4 >

6、f2) then begin a := a + b; writeln(a); end else begin c := c + d; writeln(c); end; end.9 19 29 392 procedure foo(a,b,c:integer); begin if a>b then foo(c,a,b) else writeln(a, ',', b, ',', c) end; var a,b,c:integer; begin read(a, b, c); foo(a,b,c); end. 2 1 3 : 3 procedure f(a,b,c:i

7、nteger);begin write(a, b, c, '/'); if (a = 3) and (b = 2) and (c = 1) then exit; if b<c then f(a,c,b) else if a= ord('A') and (ord(si) <= ord('Z') then si := chr(ord(si) - ord('A') + ord('a'); for i:=1 to len do if (ord(si)<ord('x') then si:=

8、chr(ord(si)+3) else si:= chr(ord(si)-23); write(s); write('/'); for j:=1 to 3 do begin i:=1; while i<=len-j do begin si:=si+j; i:=i+j; end; end; writeln(s); end.ABCDEFGuvwxyz ( 6 35 2 28 ) 1 ( k 1,000,000 )n(1<=n<=1000000) n n 1 2 3 4 5 6 3 4 var a:array1.1000000 of integer; n,m,ans

9、:integer; procedure swap(var a,b:integer); var t:integer; begin if (a <> b) then begin t := a; a := b; b := t; end; end; function FindKth(left,right,n:integer):integer; var tmp,value,i,j:integer; begin if left = right then exit(left); tmp:= random(right-left) + left; swap(atmp,aleft); value :=

10、 i := left; j := right; while i<j do begin while (i<j) and ( if i<j then begin ai := aj; inc(i); end else break; while (i<j) and ( if i<j then begin aj := ai; dec(j); end else break; end; if i<n then begin inc(i); exit(FindKth( if i>n then begin dec(i); exit( exit(i); end; );end

11、; ); end; ) do inc(i); ) do dec(j); ;var i:integer; begin randomize; ans := -1; m:=5; for i:=1 to m do read(ai); read(n); ans:= FindKth(1,m,n); writeln(aans); end. 2 n*n(1<=n<=5000) a 1<=i < n,1<=j<=n, ai,j < ai + 1,j aj,i < aj,i+1 a k k var n,k,answerx,answery:integer; a:array1.5000,1.5000 of integer; procedure FindKPosition; var i,j:integer; begin i:=n; j:=n; while j>0 do begin if an,j < k then break; dec(j); end; while ai,j<>k do begin while ( while ( end; ) and (i>1) do d