Cu 1:V mng l mt cu trc d liu phc tp c xy dng t nhng kiu c, cho php lu tr v truy cp nhanh chng cc phn t .

. Trong cc s liu cng kiu c t chc thnh chui v mi s liu c th c truy cp trc tip qua ch s ca n. Cu 2: Ta phi khai bo kch thc ca mng v truy cp mng ta dng cc ch s l nhng kiu m c nn cn c mt gii hn gip cho vic thao tc tren mng d dng v chnh xc. Cu 3:Cc phn t ca mng c th l kiu bt k. C th l s nguyn, s thc, k t. V d : a: array[1..10] of real a: array[A..Z] of integer Cu 4: Ch s ca mng c th l s nguyn, k t, hay logic- tc l nhng kiu m c, nhng khng th l kiu khng m c, v d nh s thc.

Cu 6:Ly d=A[2]-A[1], khi dy Al cp s cng nu tho mn iu kin: A[i]=A[1]+(i-1)d hoc A[i]-A[i-1]=d vi 1<i<=n
Dng 1 vng lp theo bin m i kim tra xem mi A[i] c tho mn iu kin ni trn hay khng.Ch cn pht hin 1 phn t A khng tho mn l kt lun c dy A khng phi l cp s cng.

Cu 7: For i:=2 to 1000 do Uses crt; If NT[i] then inc(demnt); Var A: array[1..100] of integer; Writeln(So cac so nguyen to:,demnt); GT:array[-1000..1000] of boolean; Demgt:=0; C: array[1..100] of byte;{C[i] la dodai cap so cong ket htuc For i:=-1000 to 1000 do tai A[i]] If GT[i] then inc(demgt); NT: array[1..1000] of boolean; Writeln(So cac gia tri xuat hien trong day:,demgt); i,sont,N,u: integer; {Tim day con dai nhat lap thanh cap so cong} demnt,demgt:integer; d:=A[2]-A[1]; d:integer; C[1]:=1; max:byte; C[2]:=2; Begin For i:=3 to N do For i:=-1000 to 1000 do If A[i] A[i-1]=d then C[i]:=C[i-1]+1 else Begin Begin GT[i]:= false; C[i]:=2; If i>0 then NT[i]:=false; D:=A[i]-A[i-1]; End; End; Sont:=0; Max:=2; {Input} For i:=3 to N do if C[i]>max then max:=C[i]; Repeat Writeln(Do dai lon nhat cap so cong la,max); Write(So phan tu cua day A(N<=100), N =); Readln; Readln(N); End. Until (N>0)and (N<=100); Cu 8: For i:=1 to N do Uses crt; Begin Var N,i:word; Write(A[,i,]=); F1,F2,F:word; Readln(A[i]); Begin GT[A[i]]:=true; Clrscr; If A[i]>1 then Write(tim so hang thu N cua day Fibonaxi, N = ); Begin Readln(N); u:=2; F1:=1; while (u<=sqrt(A[i]))and((A[i] mod u)<>0)do inc(u); F2:=2; if u>sqrt(A[i])then For i:= 3 to N do Begin Begin Inc(sont); F:=F1+F2; NT[A[i]]:=true; F1:=F2; End; F2:=F; End; End; End; Writeln(F); {Output} Readln; Writeln(so luong so nguyen to:,sont); End. Demnt:=0;
Chng trnh trn ch chy c vi N=10001 v s Fibonaxi th 10001 l 65048, s Fibonaxi th 10002 vt qu phm vi kiu ca word.

Cu 9:
Chng trnh thc hin vic hon i v tr dng th i vi dng th N-i+1ngha l s hon i v tr dng u tin vi dng cui cng ca mng, dng th 2 t trn xung vi dng th 2 t di lnVic hon i v tr dng th i vi dng i xng vi n c thc hin khi i nhn gi tr t 1 n N lm cho mi dng c hon i 2 ln, v vy cui cng mng A khng thay i so vi ban u.

Cu 10:C th chia chng trnh lm 3 on :

2 vng lp For-do lng nhau u chng trnh c nhim v nhp 1 mng 2 chiu t bn phm. 2 vng lp lng nhau tip theo thc hin vic tm phn t ln nht trn dng th i v hon i v tr phn t ny vi phn t va nm trn dng i va c ch s ct bng i. 2 vng lp lng nhau cui chng trnh in ra mng kt qu. Mun sa li chng trnh thc hin i ch phn t ln nht trn ct vi phn t va nm trn ct va c ch s dng bng ch s ct th ch cn hon i v tr 2 ch s trong on th 2 ca chng trnh.iu c ngha l ch i i tr thnh ch s th 2, ch s th 2 tr thnh ch s i trong cc cu lnh c lin quan. Nh vy ch c on th 2 trong chng trnh khc i nh sau: For i:=1 to N do Type Mang=array[a..z] of boolean; Begin Var s:string[120]; Max:=A[1,i]; Danhdau:mang; Ind:=1; i:byte; For j:=2 to N do if A[j,i]>max then duoc:boolean; Begin kt:char; Max:=A[j,i]; dem:byte; Ind:=j; Begin End; For kt:=a to z do danhdau[kt]:=false; Vsp:=A[i,i]; Repeat A[i,i]:=A[i,ind]; Duoc:=true; A[i,ind]:=vsp; Writeln(nhap xau cac chu cai thuong, do End. dai khong qua 120 ); Cu 11: Readln(s); Var s:string[100]; For i:=1 to length(s) do i,dem:byte; if(s[i]<a)or(s[i]>z) then duoc:=false; Begin If not(duoc) then writeln(can nhap lai Writeln(cho 1 xau ki tu dai khong qua xau dung quy cach); 100); Until duoc; Readln(s); For i:= 1to length(s) do Dem:=0; danhdau[s[i]]:=true; For i:= 1 to length(s) do if (0<=s[i]) and Dem:=0; (s[i]<=9) then dem:=dem+1; For kt:=a toz do if danhdau[kt] then Writeln(trong xau s co,dem,chu so thap dem:=dem+1; phan.); Writeln(co ,dem, chu cai khac nhau Readln; trong xau); End. Readln; Cu 12: End.