Lenh trong C - xa mn hnh text: clrscr(); - xa mn hnh ha cleardevice(); III. V D V THUT TON 1.

.Bi ton 1 : Cho dy s gm N s sau (N = 5): 11 6 20 4 8 Tm gi tr NH NHT ca dy s trn ? a) XC NH BI TON Input : S nguyn dng N v dy N s nguyn a1,.,aN. Output: Gi tr b nht (Min) ca dy s b) TNG Khi to gi tr Min = a1 Ln lt vi i t 2 n N, so snh gi tr s hng ai vi gi tr Min, nu Min>ai th Min nhn gi tr mi l ai HNG DN: Gi Min l gi tr nh nht cn tm. Gn Min bng gi tr phn t u tin ca dy. Ln lt so snh Min vi cc phn t tip theo trong dy. Ti mi v tr so snh : + Nu Min ln hn gi tr phn t cn so snh trong dy th ly gi tr ca phn t gn li cho Min. - Khi so snh n phn t cui cng trong dy s th Min s mang gi tr nh nht ca dy. Gn i = 2 11 6 20 4 8 Min Min=11 Min=6 Min=4 Gi tr nh nht: 4 Bin i lu tr v tr tip theo m Min s so snh + Tng i ln 1 n v LIT K Bc 1 : Nhp N v dy a1,., aN. Bc 2 : t Min ? a1, i ? 2; Bc 3 : Nu i<=N th thc hin bc 4, nu khng th chuyn n bc 5. Bc 4 : 4.1. Nu Min > ai th t Min ? ai.

4.2. Tng i mt n v ri quay v bc 3 Bc 5 : a ra Min ri kt thc. S KHI : M phng thut ton Min 2.Bi ton 2 : Tm gi tr LN NHT ca mt dy s vi Input v Output nh sau: Input : S nguyn dng N v dy N s a1,...,aN. Output : Gi tr ln nht (Max) ca dy s. M t thut ton gii bi ton ny theo c 2 cch lit k v dng s khi. III. V D V THUT TON (tt) a) XC NH BI TON Input : S nguyn dng N v dy N s nguyn a1,.,aN. Output: Gi tr ln nht (Max) ca dy s b) TNG Khi to gi tr Max = a1 Ln lt vi i t 2 n N, so snh gi tr s hng ai vi gi tr Max, nu ai>Max th Max nhn gi tr mi l ai V D P DNG Cho dy s gm N s sau (N = 5): 11 6 20 4 8 Tm gi tr LN NHT ca dy s trn ? HNG DN: Gi Max l gi tr l?n nht cn tm. Gn Max bng gi tr phn t u tin ca dy. Ln lt so snh Max vi cc phn t tip theo trong dy. Ti mi v tr so snh : + Nu Max nh? hn gi tr phn t cn so snh trong dy th ly gi tr ca phn t gn li cho Max. - Khi so snh n phn t cui cng trong dy s th Max s mang gi tr l?n nht ca dy. Gn i = 2 11 6 20 4 8 Max Max=11 Max=11 Gi tr l?n nht: 20 Bin i lu tr v tr tip theo m Max s so snh + Tng i ln 1 n v

Max=20 Max=20 LIT K Bc 1 : Nhp N v dy a1,., aN. Bc 2 : t Max ? a1, i ? 2; Bc 3 : Nu i >N th chuyn n bc 5. Bc 4 : 4.1. Nu ai > Max th t Max ? ai. 4.2. i ? i + 1 ri quay v bc 3 Bc 5 : a ra Max ri kt thc. S KHI : Nhp N v dy a1,., aN Max? a1 ,i ? 2 i >N? ai >Max? Max ? ai i ? i+1 a ra Max ri kt thc ng Sai ng Sai M phng thut ton Max III. V D V THUT TON (tt) 3.Bi ton 3 :

M t thut ton gii bi ton ny theo c 2 cch lit k v dng s khi. Kim tra tnh nguyn t ca mt s nguyn dng: Input : ? Output : ? a) XC NH BI TON Input :? Output:? N l mt s nguyn dng N l nguyn t hay khng nguyn t b) TNG Nu N = 1 th N khng l s nguyn t Nu 1<4 th N l s nguyn t

Nu N>=4 v khng c c s trong phm vi t 2 n phn nguyn cn bc 2 ca N th N l s nguyn t Vy nu c bt k mt c s khc 1 v chnh n th kt lun N khng l nguyn t. LIT K Bc 1 : Nhp s? nguyn dng N ; Bc 2 : Nu N = 1 th thng bo N khng l nguyn t ri kt thc; Bc 3 : Nu N < 4 th thng bo N l nguyn t ri kt thc; Bc 4 : i ? 2; Bc 5 : Nu i > [ ] th thng bo N l nguyn t ri kt thc; Bc 6: Nu N chia ht cho i th thng bo N khng l nguyn t ri kt thc; Bc 7: i ? i + 1 ri quay li bc 5.

S KHI : Nhp N N=1? N<4? 2i N chia ht cho i? i>[ ]? N Thng bo N l nguyn t ri kt thc Thng bo N khng l nguyn t ri kt thc ng ng Sai Sai ng Sai ng Sai M phng thut ton kim tra tnh nguyn t Vi N = 29 ([ ] = 5) 29 l s nguyn t 29/2 29/3 29/4 29/5 Khng Khng Khng Khng M phng thut ton kim tra tnh nguyn t

45/2 45/3 Khng Chia ht 45 khng l s nguyn t Vi N = 45 ( [ ] = 6) CC TNH CHT CA THUT TON Tnh dng: Thut ton phi kt thc sau mt s hu hn ln thc hin cc thao tc CC TNH CHT CA THUT TON (tt) Tnh xc nh: Sau khi thc hin mt thao tc th: Hoc thut ton kt thc Hoc c ng mt thao tc xc nh c thc hin tip theo CC TNH CHT CA THUT TON (tt) Tnh ng n: Sau khi thut ton kt thc, ta phi nhn c Output cn tm. CC THUT NG CHNH L vic no ta mun my tnh thc hin Cc thng tin c (cc gi thit) Cc thng tin cn tm t Input (kt lun) *Mt dy hu hn cc thao tc. *Cc thao tc c sp xp theo mt trnh t xc nh. *Sau khi thc hin dy thao tc , t Input ta tm c Output ca bi ton. Dng cc biu tng qui c th hin cc thao tc trong thut ton Bi ton Input Output Thut ton S khi Ghi nh Xut Min Nhp dy N Thc hin lnh (Php gn, php tnh) iu Kin ng Sai Ta cn din t thut ton bng mt ngn ng sao cho my tnh c th hiu v thc hin c, ngn ng gi l ngn ng lp trnh. Kt qu din t thut ton nh vy gi l chng trnh. LU TM MAX TRONG N S M PHNG THUT TON TRO I (Exchange Sort) 6 1 5 3 7 8 10 7 12 4

1 6 5 3 7 8 10 7 12 4 1 5 6 3 7 8 10 7 12 4 1 5 3 6 7 8 10 7 12 4 1 5 3 6 7 8 7 10 12 4 1 5 3 6 7 8 7 10 4 12 V d Cho dy A gm cc s: 3, 5, 23, 8, 2, 9, 4, 6, 11, 98, 7. Vy ch s cn tm l i= 7. V d Cho dy A gm cc s: 3, 5, 23, 8, 2, 9, 4, 16, 11, 98, 7. Vy khng c hn no ca dy A C gi tr bng k. K=45 54 12 32 84 78 45 25 34 49 XUT i=6 K=13 54 12 32 84 78 45 25 34 49 XUT THNG BO DY A KHNG C PHN T NO BNG K Vi i = 5 th a5 = 2 i t 1 n 10 khng c ai c gi tr bng 6 Bai 2 program bt; ues crt; var n,tmp,min,m:integer; begin clrscr; n:=1; min:=0; max:=0; repeat write('sothu' ,n,':'); readln(tmp); i f tmp>0then begin inc(n); if min =0 then min :=tmp else if min>tmp then min :=tmp; if max =0 then max:=tmp else i f max <tmp then max :=tmp; end;

until (n>0)and(n<=10) writeln('solonnhattrongday:',max); writeln('sonhonhattrongday:' ,min); readln;end. Thuat toan tim UCLN #include<stdio.h> #include<conio.h> #include<math.h> int i,j,n,a[100],tg; sapxep(int a[100]) { for(i=1;i<=n-1;i++) for(j=i+1;j<=n;j++) if(a[i]<a[j]) { tg=a[i]; a[i]=a[j]; a[j]=tg; } } void main() { printf("Nhap n :"); scanf("%d",&n); for(i=1;i<=n;i++) { printf("a[%d]=",i); scanf("%d",&a[i]); } sapxep(a); do { a[1]=a[1]-a[n]; sapxep(a); } while(a[1]!=a[n]); for(i=1;i<=n;i++) printf("Uoc chung lon nhat la :%d\n",a[i]); getch(); } th vi vi dy cho kt qu ng.Anh em xem th c sai st hoc v l ch no khng. halfblood88 15-01-2008, 10:56 PM

Vit theo cch ca bn huynguyen #include <stdio.h> #include <conio.h> int i,x[100],d,n; int ucln(int a, int b) { while (a != 0 && b != 0) if (a>b) a -= b; else b -= a; if (a == 0) return b; else return a; } void main() { printf("Nhap n:"); scanf("%d",&n); for(i=1;i<=n;i++) { printf("x[%d]=",i); scanf("%d",&x[i]); } d = ucln(x[1],x[2]); for(int i = 3; i <= n; ++i) if (d == 1) break; else d = ucln(d,x[i]); printf("uoc chung lon nhat la :%d",d); getch(); } Mi ngi 1 v th ny. T nga tay ng cch ca minh ln xem sao. Mong c ch gio. Gii thut cng n gin thi nhng ca mnh th c tim max min tnh ton nhanh hn.Mnh ch cn phi tm UCLN ca 2 s max v min V mnh cng kh qui #include<conio.h> #include<stdio.h> int a[10],n; void input() { int i; printf("nhap so fan tu: "); scanf("%d",&n); printf("hay nhap day\n"); for(i=0;i<n;i++)

{ printf("\n a[%d]= ",i); scanf("%d",&a[i]); } } int getmax() { int max; max=a[0]; for(int i=0;i<n-1;i++) max=(a[i]<a[i+1])?a[i+1]:a[i]; return(max); } int getmin() { int min; min=a[0]; for(int i=0;i<n-1;i++) min=(a[i]<a[i+1])?a[i]:a[i+1]; return(min); } int UCLN(int max,int min) { int t; while(1) { t=max%min; max=min; min=t; if (t==0) break; } return (max); } main() { input(); int max=getmax(); int min=getmin(); printf("UCLN cua day la %d ",UCLN(max,min)); getch(); }