Tải bản đầy đủ (.pdf) (6 trang)

HDC de thi chon HSG THPT cap tinh nam 2008 2009 nam Tin hoc

Bạn đang xem bản rút gọn của tài liệu. Xem và tải ngay bản đầy đủ của tài liệu tại đây (389.48 KB, 6 trang )

<span class='text_page_counter'>(1)</span><div class='page_container' data-page=1>

<b>S& GD - DT LAO CAI </b>


<b>D$ </b>

<b>THI CHINH </b>

<b>THOC </b>



<b>KV </b>

<b>THI HOC SINH </b>

<b>GIOI </b>

<b>CAP </b>

<b>T ~ N H </b>
<b>L ~ P 12 NAM HOC </b>: <b>2007-2008 </b>


~

N

<b>DAN </b>

G

<b>C H ~ I </b>

-

M ~ N :

<b>Tin hoe </b>



( <i><b>Hu6ng </b><b>ddn </b><b>chc4m </b></i><b>gdm 2 </b><i><b>trang </b></i>)


<b>A, TEST: Ph$n thi </b>

<b>l$p </b>

<b>trhh </b>


<b>CSlu 1: </b>( <b>7 di6m </b>)


<b>Did. </b>


<b>m </b>



<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>Output </b>


<b>DAYSO.0UT </b>


a. So tu trong xau st: 4


b. Ky tu c xuat hien 2 lan, <b>vi </b>

<b>tri </b>

xuat hien dau tien 7
c.

<i><b>Co </b></i>

1 tu duoc bat dau boi ky tu t hoac ky

a

T
d. Ki tu N xuat hien nhieu nhat 3


a. So tu trong xau st: <b>8 </b>


b. Ky tu c xuat hien 1 lan, <b>vi tri </b>xuat hien dau tien 17
c. Khong co <b>tu </b>nao duoc bat dau boi ky tu t hoac ky tu

T


d. Ki tu A xuat hien nhieu nhat 4


a.

<i><b>So </b></i>

tu trong xau st: 6


b. Ky tu c xuat hien 2 Ian, <b>vi tri </b>xuat hien dau tien 3
c. <b>Co </b>1 tu duoc bat dau boi <b>ky </b>tu t hoac

<b>ky </b>

tu T
d. Ki tu

H

xuat hien nhieu nhat 3


a. So tu trong xau st: 7


b. Ky tu c xuat hien 1 lan, <b>vi tri </b>xuat hien dau tien 16
c. Co 3 tu duoc bat dau boi ky <b>tu </b>t hoac ky tu T
d. Ki tu <i><b>0 </b></i>xuat hien nhieu nhat 5


a. So tu trong xau st: 3



b. Ky tu c khong xuat hien trong xau


c. Khong co tu nao duoc bat dau boi ky tu t hoac ky tu

T


d. <b>Ki </b>tu N xuat hien nhieu nhat 4


a. So tu trong xau st: 3


b. Ky tu c khong xuat hien trong xau


c. Co 1 tu duoc bat dau boi ky tu t hoac ky <b>tu </b>T
d. Ki tu A xuat hien nhieu nhat 3


a.

<i><b>So </b></i>

tu trong xau st: 4


b. Ky tu c khong xuat hien trong xau


c. <i><b>Co </b></i>1 tuduocbatdauboi kytu thoac kytuT
d. <b>Ki </b>tu N xuat hien nhieu nhat 5


<b>Test </b>


1


2


3


4


<i><b>5 </b></i>



<i>6 </i>


7


<b>Input </b>
<b>DAYSO.INP </b>


Tin can ban


<b>'Ong</b> hoi
chu nghia
Narn


<b>Doc </b>

lap tu do hanh
phuc


truong trung hoc
pho thong so 1


nguyen van an


<b>tran </b>ba hoang


</div>
<span class='text_page_counter'>(2)</span><div class='page_container' data-page=2>

<i><b>C l u </b></i><b>2: </b>( 7 di&m ) <b>DCTANG.PAS </b>


<b>C l u 3:( 6 diim </b>) <b>MUAVE-PAS </b>
<b>Test </b>


1



<b>3 </b>


<i>6 </i>


<b>7 </b>


<b>Output </b>
<b>DAYCON.OUT </b>


<b>Day con tang lon nhat gom 4 pt: </b>

<b>1 2 </b>


<b>3 4 </b>



<b>Day con tang lon nhat gom 2 pt: 23 31 </b>


<b>Day con tang lon nhat gom 3 </b>

<b>pt: </b>

<b>23 65 </b>


<b>76 </b>



<b>Day con tang lon nhat gom </b>

<b>0 </b>

pt:



-



<b>Day con tang lon nhat gom 3 pt: </b>

5

<b>6 </b>


<b>7 </b>



<b>Day con tang lon nhat gom 6 pt: 1 6 </b>



<b>7 8 </b>

<b>9 23 </b>



Day con

tang

<b>Lon nhat gom 5 pt: 2 </b>

<b>3 </b>


<b>4 </b>

<b>5 </b>

<b>6 </b>




<b>Input </b>
<b>DAYCON.I[NP </b>

7



4 2 1 2 3 4 1


4



<b>233121209 </b>


10



<b>965213423657643 </b>


<b>24 27 </b>



<b>5 </b>



<b>2 2 2 2 2 </b>


<b>8 </b>



<b>4321 5 6 7 2 2 3 </b>


<b>15 </b>



<b>2 3 4 5 6 1 6 7 8 9 2 3 4 5 </b>


<b>3 </b>

<b>3 </b>



<b>13 </b>



<b>2 3 4 5 6 1 6 7 8 9 5 3 3 </b>



<b>Test </b>



<b>1 </b>


<b>2 </b>


<b>3 </b>


<b>4 </b>


<b>5 </b>


<i><b>6 </b></i>


<b>Di6 </b>


<b>m </b>



<b>1 </b>


<b>1 </b>



<b>1 </b>



<b>Input </b>


Luoi.inp


<b>5 </b>



<b>2 5 7 8 </b>

<b>4</b>


<b>3</b>

<b>9 10 10 </b>




<b>4 </b>



<b>3 5 1 7 </b>


<b>6 7 1 </b>



<b>7 </b>


<b>7</b> <b>6</b> <b>2</b> <b>4</b> <b>1</b> <b>9</b> <b>8</b>


<b>12 </b>

<b>3 4 </b>

<b>12 5 </b>

<b>6 </b> <b>3 </b>


<b>3</b>


<b>4 5 6 </b>
<b>10 6</b>


<b>6 </b>



<b>34 54 23 </b>

<b>12 </b>

<b>4</b>

<b>3 </b>



<b>21 23 </b>

<b>45 </b>

<b>3 1 </b>

<b>13 </b>



<b>2 </b>



<b>3 8 </b>
<b>6</b>


<b>Output </b>



Luoi.out


<b>17 </b>


<b>2 </b>

<b>4 </b>



<b>7 </b>


<b>2 </b>

<b>4 </b>


<b>22 </b>


<b>2 7 </b>



<b>10 </b>



<b>3 </b>



<b>63 </b>


<b>2 </b>


<b>6 </b>


<b>2 </b>



<b>Didm </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>


<b>1 </b>



<b>1 </b>



</div>
<span class='text_page_counter'>(3)</span><div class='page_container' data-page=3>

B, Hudng dan ch$m phiin viet chuung trinh va thuat toan.

(

gbm

4 trang

)


Hudng d&n chung.


<b>Thu& t d n hqp </b>

<b>19: </b>

1 didm


Khai Mo <b>bign, </b>h h g hqp

<b>19: </b>

0.5 didm


Khai <b>biio </b>d c chucmg <b>trinh con </b>hqp

<b>19: </b>

0.5 didm


<b>EM </b>

cuc chucmg <b>trinh h q ~ </b>

<b>19: </b>

0.5 didm


C l u 1 ( 2.5 diem )
program bail;
uses crt;
Const


fi='c:\xau.inp' ;


fo='c:\xau.outl;
var


st: string;


d: array[1..100] of integer;
f,fl:text;


{

- -- -

-

- -- -

doc du lieu

---

I



Procedure nhap;


Var i,dem j,k,t,dl,d2,il:integer;
ch:char;


vt:array[l..SO] of integer;
luu: string;


Begin


assign(f,fi);
reset(f);
assign(fl,fo);
rewrite(f1);
read(f,st);


Writeln(' Xau st: ',st);
{

---

dem tu

---I


st :=

'

'

+

st;


dem := 0;


for i := 1 to length(st) do


if (st[i] =

'

') and (st[i+l] <i><b>o </b></i>

'

') then dem := dem

+

1;
Writeln(fl,' a. So tu trong xau st: ',dem);


{

-

---

--

-

kiem tra ky tu c

---I


delete(st,l,l);



il:= 0; dl:=O;


for i := 1 to length(st) do
if st[i] = 'c' then


Begin
inc(d1);
inc(i1);
vt[il] := i;
end;
if d l > 0 then


Writeln(f1,' b. Ky tu c xuat hien ',dl,

'

lan, vi tri xuat hien dau tien ',vt[l])
else


Writeln(f1,' b. Ky tu c khong xuat hien trong xau');
d2 :=O; st :=

'

'

+

st;


for i := 1 to length(st) do


</div>
<span class='text_page_counter'>(4)</span><div class='page_container' data-page=4>

if d2 > 0 then


Writeln(f1,' c. Co ',d2,' tu duoc bat dau boi ky tu t hoac ky <b>tu </b>T')
else


Writeln(f1,' <b>c. </b>Khong co tu nao duoc bat dau boi ky tu t hoac ky tu T');
{

---

dem ki tu xuat hien nhieu nhat trong xau

<b>---I </b>



<b>k:=O; </b> j:= 0;



for ch := 'A' to

<b>'2' </b>

do
begin


for i := 1 to length(st) do


if upcase(st[i]) = ch then inc(k);
if j < k then


begin
j := k;
luu := ch;
end;
k := 0;
end;


<b>W r i t ! ~ 1 1 l h ' , h l l , h m ~ ~ ' & - - </b>
--


Close(f);
Close(f1);
End;


{

-

-.

- - -

.

-

-.

<b><sub>1 </sub></b>



BEGIN
clrscr ;


nhap;
readln;

<b>END. </b>




C i u 2 ( <b>2.5 di&m </b>) DAYCT.PAS
program day-con-tang ;


uses crt ;


Const

<b>fi </b>

= 'c:\dayso.inpt;


fo = 'c:\dayso.out';


type mang = array[l..50] of longint;
var <b>a, </b>a1:mang ;


n:integer ;


f,fl:text ;


{

-

-

- -

-

-

--

-

nhap du lieu---


--

I



p r o c e d u S ~ n p u t ; - - -


var i:integer ;


begin


as&!!n(f,fi) ;


reset(f) ;



Writeln('Doc day so:');
readln(f,n) ;


writeln(n) ;


for i:=l to n do
begin


read(f,a[i]) ;


write(a[i],' ');


</div>
<span class='text_page_counter'>(5)</span><div class='page_container' data-page=5>

end;


{

---

x u <b>ly </b>

---

----

<b>1 </b>



procedure daytang;


<b>Var i j,dem,max,vtl,vt2:integer; </b>
Begin


dem := 1; max := 0;


for i := 1 to n-1 do
if a[i]ca[i+l] then


begin


j := i;



while <b>(au] c </b>alj+l]) and (j <= n) do
Begin


inc(dem);
inc(j);
end;


if max <i><b>c </b></i>dem then
Begin


max := dem;
vtl:= <b>i; </b>


vt2:= <b>j; </b>


end;
dem := 1;
end;
Writeln;


Write(' Day con tang Ion nhat gom: ',max,' phan tu: ');


for <b>i </b>:= vtl to vt2 do


Write(a[i]:4);


{

--

---

- -

<b>Ghi </b>file

----

}


assign(f1,fo) ;



Rewrite(f1) ;


Writeln;


Write(f1,'Day con tang Ion nhat gom

<b>',max,' </b>

pt:');
for i := vtl to vt2 do


Write(fl,a[i]:4);
Close(f1);


end;
begin


clrscr ;


input;
daytang;
readln ;


end.


Cilu 3 (2.5 di6m).
Program muave;

<b>Uses </b>

crt;


const inp='c:huave.inp1;
out= 'c:\muave.out';
max = 100;


Var <b>f,t,R: Array[O..max+l] of Integer; </b>



</div>
<span class='text_page_counter'>(6)</span><div class='page_container' data-page=6>

(

- -

-

-

- - -

-

Input---

<b>1 </b>


Procedure nhap;
Var i:integer;


fl:text;
Begin


Assign(fl,inp);
Reset(fi) ;


Readln(fi,N);
for i := 1 to N do
Read(fl,t[il);


for i := 1 to N

-

1 do
Read(fl,R[i]);


close(fl);
End;


{

-

-

- - -

x u ly

---

<b>1 </b>



Procedure Solve;
Var i : integer;
Begin


R[O]:= <i><b>0 ; </b></i>


no]

:= 0;

fCl] := T[1];


<b>Fillc </b>

har (pass,sizeof(pass),O);
For i

:=

2 to n do


if fli-2]+ R[i-11 <i><b>c </b></i>T[i]

+

fli-11 then
Begin


pass[i] := True;
pass[i-1] := False;
f[i] := fli-21

+

R[i-11
end


Else


fCi] := T[i]

+

fCi-11;
end;


<b>(---.-xuat---.-- </b>

<b>1 </b>


Procedure xuat;
Var


i:integer;
fo:text;
begin


Assign(fo,out);
Rewrite(f0);
Writeln(fo,f[N]);
For i := 1 to N do



if pass[i] then Write(fo,i,' ');


close(f0);
End;


{

- - - - -- - - -- -

-

<sub>1 </sub>


Begin


Clrscr ;


nhap;
Solve;
xuat;
readln ;


</div>

<!--links-->

×