Professional Documents
Culture Documents
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n;
cout<<"Nhap vao so n: ";
cin>>n;
if(n%2==0)
cout<<"so N la so chan";
else
cout<<"so N la so le";
getch();
}
//Nhap vao mot so nguyen n. Tim cac uoc so cua n....
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n;
cout<<"nhap vao so N: ";
cin>>n;
cout<<"cac uoc so cua n la: "<<endl;
for (int i=1;i<=n;i++)
if(n%i==0)
cout<<" "<<i<<endl;
getch();
}
//Nhap vao so nguyen n. In ra man hinh hinh vuong
//co n tuong ung voi so "*"...
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n;
cout<<"nhap vao so N: ";
cin>>n;
for (i=2;i<=n-1;i++)
{
cout<<"*";
for (int j=1;j<=n-2;j++)
cout<<" ";
cout<<"*"<<endl;
}
for (i=1;i<=n;i++)
cout<<"*";
getch();
}
//Nhap vao n so nguyen duong. Tinh tong n so nguyen duong...
#include<iostream.h>
#include<conio.h>
void main()
{
clrscr();
int n,tong=0;
cout<<"Nhap n: ";
cin>>n;
tong=0;
for(int i=1;i<=n;i++)
tong=tong+i;
cout<<"tong cac so la: "<<tong<<endl;
getch();
}
//Nhap vao 2 so nguyen a, b. Tim UCLN cua 2 so a,b.....
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n,m;
cout<<"nhap vao 2 so n,m: "<<endl;
cin>>n>>m;
while (m!=n)
if(m>n) m=m-n;
else
n=n-m;
cout<<"USCLN la: "<<m<<endl;
getch();
}
//Ve tam giac vuong can...
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n;
cout<<"nhap vao so N: ";
cin>>n;
for (int i=1;i<=n;i++)
{
for (int j=1;j<=i;j++)
cout<<"*";
cout<<endl;
}
getch();
}
//Nhap vao so nguyen duong n. Kiem tra xem n co phai la so nguyen to....
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n,i;
cout<<"nhap vao so n: ";
cin>>n;
i=2;
while(n%i!=0) i++;
if(i==n)
cout<<n<<" la so nguyen to"<<endl;
else
cout<<n<<" ko phai la so nguyen to"<<endl;
getch();
}
//Nhap vao so nguyen duong n. Kiem tra xem n co phai la so nguyen to
//neu ko phai thi n chia het cho so nao do...
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n,i;
cout<<"nhap vao so n: ";
cin>>n;
i=2;
while(n%i!=0) i++;
if(i==n)
cout<<n<<" la so nguyen to"<<endl;
else
cout<<n<<" ko phai la so nguyen to vi "<<n<<" chia het cho "<<i<<endl;
getch();
}
//nhap vao 1 so nguyen duong n,in ra man hinh cac so nguyen to <n
//vd: n=20 thi co cac so nguyen to la: 2 3 5 7 11 13 17 19
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int n,j;
cout<<"nhap vao so nguyen n: ";
cin>>n;
cout<<"cac so nguyen to "<<n<< " la";
for(int i=2;i<=n ;i++)
{
j=2;
while (i%j!=0)j++;
if(j==i)
cout<<" "<<i;
}
getch();
}
//Nhap vao mot mang a co n phan tu.In ra so chan, so lon nhat tai vi tri nao do trong mang
#include "iostream.h"
#include "conio.h"
void main()
{
clrscr();
int a[50],n;
cout<<"nhap vao so phan tu N cua mang: ";
cin>>n;
for(int i=0;i<n;i++)
{
cout<<"a["<<i+1<<"]=";
cin>>a[i];
}
//in ra mang vua nhap
cout<<"Mang vua nhap la: ";
for(i=0;i<n;i++)
cout<<" "<<a[i];
//in ra cac phan tu so chan trong mang
cout<<"\nCac phan tu chan trong mang la: ";
for(i=0;i<n;i++)
if(a[i]%2==0)
cout<<" "<<a[i];
//in ra phan tu lon nhat tai vi tri do
int max=a[0],vt=0;
for(i=0;i<n;i++)
if(a[i]>max)
{
max=a[i];
vt=i;
}
cout<<"\nPhan lu lon nhat la "<<max<<" tai vi tri: "<<vt+1;
getch();
}
//tim UCLN ,BCNN cua 2 so nguyen
#include "iostream.h"
#include "conio.h"
int UCLN(int m,int n)
{
while (m!=n)
if(m>n) m=m-n;
else
n=n-m;
return m;
}
void main()
{
clrscr();
int a,b;
cout<<"nhap vao 2 so a,: ";
cin>>a>>b;
cout<<"UCLN= "<<UCLN(a,b)<<" va BCNN= "<<a*b/UCLN(a,b);
getch();
}
//tim UCLN ,BCNN cua 3 so nguyen
#include "iostream.h"
#include "conio.h"
int UCLN(int m,int n)
{
while (m!=n)
if(m>n) m=m-n;
else
n=n-m;
return m;
}
int BCNN(int m,int n)
{
return m*n/UCLN(m,n);
}
void main()
{
clrscr();
int a,b,c;
Vit chng trnh hin ra mn hnh dng ch: CHAO MUNG CAC BAN DEN VOI
MON HOC C++.
HD:
#include <iostream>
using namespace std;
int main()
{
cout<< CHAO MUNG CAC BAN DEN VOI MON HOC C++;
return 0 ;
}
Bi tp 2:
Vit chng trnh xut ra mn hnh hnh vung c k t * c cnh bng a (vi a nhp t
bn phm).
HD:
// chuong trinh ve chu nhat dac
#include<iostream>
using namespace std;
int main()
{
int a, i, j;
cout<<Ban hay nhap do dai canh: ;
cin>>a;
for (i = 1; i<= a; i++)
{
for (j =1; j<= a; j++)
cout<<* ; //luu y,co mot khoang trong o day
cout<<\n;
}
return 0 ;
}
Bi tp 3:
Vit chng trnh nhp vo bn knh ca hnh trn; xut ra din tch v chu vi ca
hnh trn .
Din tch ca hnh trn bit trc bng cch nhp vo t bn phm, tnh v in ra bn
knh ca hnh trn .
Bi tp 4:
Vit chng trnh nhp vo y ln, y nh, chiu cao ca hnh thang; xut ra din tch
ca hnh thang .
Bi tp lp trnh C++ 4/18 GV: Lng Tr n Hy Hi n
Bi tp 5:
Chng trnh tnh gi tr biu thc )1cos(3 += tey .
HD: Hm tnh l exp(x), hm tnh cos(x) trong tp tin th vin <cmath>
// Chuong trinh tinh bieu thuc y= 3e^cos(t+1)
#include<iostream>
using namespace std;
#include<cmath>
int main()
{
double t, y;
cout<<Moi ban nhap 1 so thuc t: ;
cin>>t;
y= 3*exp(cos(t+1));
cout<<Gia tri cua bieu thuc can tinh la: << y;
return 0;
}
Bi tp 6:
Vit chng trnh nhp vo 2 s nguyn v cc php ton +, -, *, /, %, >,<. In ra kt qu
php ton .
// Chuong trinh tinh + - * /
#include<iostream>
using namespace std;
int main()
{
int a, b;
cout<<"Ban hay nhap 2 so nguyen: ;
cin>>a>>b;
cout<<Tong cua 2 so vua nhap la: <<a+b<<\n;
cout<<Hieu cua 2 so vua nhap la: <<a-b<<\n;
cout<<Tich cua 2 so vua nhap la: <<a*b<<\n;
if (b!=0)
cout<<Thuong cua 2 so vua nhap la: <<a/b;
return 0;
}
Bi tp 7:
Vit chng trnh nhp vo thng tin ca mt sinh vin bao gm: m s sinh vin, h tn,
qu qun, nm sinh, im trung bnh cc nm hc; xut ra thng tin ca sinh vin va
nhp.
Bi tp 8:
Vit chng trnh nhp vo ba cnh ca mt tam gic, tnh v xut ra din tch ca tam
gic .
HD: di 3 cnh a, b, c kiu s thc. Din tch ))()(( cpbpappS = vi p l na
chu vi.
Bi tp 9:
Mt on thng c biu din bi hai im trong mt phng. Vit chng trnh nhp vo
hai im ca mt on thng v xut ra trung im ca on thng .
Bi tp lp trnh C++ 5/18 GV: Lng Tr n Hy Hi n
HD:
Ta cn 4 bin xA, yA, xB, yB lu ta 2 im A, B trong mt phng.
Trung im I ca on AB l:
2
,
2
BA
I
BA
I
yyyxxx +=+=
Bi tp 10:
Vit chng trnh nhp vo ba nh ca mt tam gic. Xut ra trng tm ca tam gic .
HD:
Ta cn 6 bin xA, yA, xB, yB, xC, yC lu ta 3 nh A, B, C ca tam gic.
Trng tm I l:
3
,
3
CBA
I
CBA
I
yyyyxxxx ++=++=
Bi tp 11:
Xt tam thc bc 2 c dng ax2 + bx + c. Vit chng trnh nhp vo cc h s ca mt
tam thc bc 2 v gi tr ca bin s x; xut ra gi tr ca tam thc bc 2 .
HD:
f= a*x*x+b*x+c
Bi tp 12:
Hy tm cc biu thc ng trong cc biu thc di y:
(i=j)++
i+j++
++(i+j)
++i+++j
Vo my kim tra cc d on ca bn.
CH NG 2. C u trc iu khin C u trc l p
2.1. Bi t p lin quan n c u trc iu khin:
Bi tp 13:
Vit chng trnh nhp vo mt s. Xut ra mn hnh chui s chn nu s l s chn.
Xut ra mn hnh chui s l nu s l s l.
HD:
if ( N % 2 == 0) cout<<So chan;
else cout<<So le;
Bi tp 14:
Vit chng trnh nhp vo 2 s nguyn, tm s ln nht ca 2 s.
Bi tp 15: (*):
Vit chng trnh th hin tr chi on t t vi qui c: Ba = B; Bao = O; Ko =K.
Nhp vo hai k t i din cho hai ngi chi. Xut ra mn hnh cu thng bo ngi chi
no thng hoc ha.
Bi tp lp trnh C++ 6/18 GV: Lng Tr n Hy Hi n
Bi tp 16:
Vit chng trnh tnh lng ca nhn vin da theo thm nin cng tc (TNCT) nh sau:
L ng = h s * l ng c n b n, trong lng cn bn l 650000 ng.
Nu TNCT < 12 thng: h s = 1.92
Nu 12 <= TNCT < 36 thng: h s = 2.34
Nu 36 <= TNCT < 60 thng: h s = 3
Nu TNCT >= 60 thng: h s = 4.5
HD:
const int luongcb = 650;
int tnct;
double heso, luong;
if (tnct < 12) heso = 1.92;
else if (tnct < 36) heso = 2.34;
else if (tnct < 60) heso = 3;
else heso = 4.5;
luong = luongcb * heso;
Bi tp 17: (*):
Mt im KARAOKE tnh tin khch hng theo cng thc sau:
Bi tp 31:
Vit chng trnh m v in ra s lng cc s nguyn chia ht cho 3 hoc 7 nm trong
on 1 n 100.
HD:
int Dem = 0;
for (int i = 1; i <= 100; i++)
if( (i % 3 ==0) || (i % 7 == 0))
{
Dem++;
}
Bi tp 32:
Vit chng trnh nhp vo mt s nguyn dng, kim tra c phi l s nguyn t hay
khng?
Bi tp lp trnh C++ 9/18 GV: Lng Tr n Hy Hi n
Bi tp 33:
Vit chng trnh nhp vo mt s nguyn dng, xut ra dng phn tch tha s nguyn
t ca s .
HD:
int n;
cout<<Nhap n: ;
cin>>n;
cout<<n<<" = ";
int i= 2;
while(i <= n)
{
if(n % i == 0){
cout<<i;
n /= i;
if(n != 1) cout<<"*";
}
else i++;
}
Bi tp 34:
Vit chng trnh nhp vo im trung bnh ca mt s sinh vin cho trc. In ra im
trung bnh ca tt c cc sinh vin.
Bi tp 35:
Vit chng trnh tnh v in ra trung bnh cng ca mt dy s c nhp vo t bn phm
(khng hn ch s lng s nhp vo). Qui c s nhp c gi tr l 9999 l s cm canh
(ngha l nhp n khi nhp s 9999 th dng vic nhp).
V d: nhp 10 8 11 10 7 9999 2.9
5
71011810 =++++=gttb
Bi tp 36:
Vit chng trnh in ra bng cu chng.
HD:
for(int i = 1; i < 10; i++)
{
for(int j = 2; j < 6; j++)
cout<<j<<" x "<<i<<" = "<<setw(2)<<j*i<<" ";
cout<<endl;
}
Bi tp 37:
Vit chng trnh in ra bng lng gic sin, cos, tan ca cc gc t 0..180 dn cch 5 .
S dng hm sin, cos, tan trong cmath.
Bi tp 38:
Vit chng trnh tm c chung ln nht, bi chung nh nht ca 2 s nguyn M, N nhp
t bn phm.
Bi tp 39:
Vit chng trnh hin ln mn hnh cc k t c m ASCII t 33 n 255.
Bi tp lp trnh C++ 10/18 GV: Lng Tr n Hy Hi n
Bi tp 40:
Vit chng trnh i tin vi cc yu cu sau:
Nhp vo s N l gi tr tin cn i, in ra chi tit s t tin i cho khch hng.
Cc loi tin i l (n v ngn ng): 500, 200, 100, 50, 20, 10, 5, 2, 1.
u tin i t t c gi tr cao nht n t c gi tr thp nht.
Bi tp 41: (*)
Tr chi on s c m t nh sau:
C hai ngi chi.
Ngi chi th nht ngh ra mt s x ngu nhin t 1..100 v yu cu ngi th
hai on trng s mnh ngh. Ngi th hai c quyn on nhiu ln nhng
khng vt qu n ln (n xc nh trc).
Mi ln ngi th hai on sai, ngi th nht s thng bo cho ngi th hai
bit l s x ln hn hay nh hn s ngi th hai on.
Tr chi kt thc khi ngi th hai on trng s x hoc ngi th hai khng
on trng s x sau n ln on.
a) Vit chng trnh th hin tr chi on s gia ngi v my. Vi my ng
vai tr l ngi th hai (ngi on).
b) Vit chng trnh th hin tr chi on s gia ngi v my. Vi my ng
vai tr l ngi th nht (ngi ngh ra s).
Bi tp 42: (*)
Vit chng trnh nhn 1 gi tr nguyn di v cho hin th ra mn hnh s dng: h 10,
h 16, h 8, h 2.
Bi tp 43: (*)
Vit chng trnh gii phng trnh bc 2 vi cc h s nhp t bn phm (xt y cc
trng hp).
Bi tp 44: (*)
Vit chng trnh tnh sin(x) theo cng thc xp x:
( ) ( ) ( )!12
1.....
!5!3
sin
1253
+
+++=
+
n
xxxxx
n
n vi chnh xc 0.00001. Tc l tnh cho ti n
sao cho: 00001.0
!
<
n
xn
.
CH NG 3. Hm
Bi tp 45:
Vit chng trnh nhp h tn, im Ton, im Vn ca mt hc sinh. Tnh im trung
bnh v xut ra kt qu. (Yu c u: Vit hm nh p, xu t, tnh trung bnh).
HD:
void Nhap(char HT[50], double &T, double &V)
{
cout<<Ho ten: ; cin>>HT;
Bi tp kh
Bi tp lp trnh C++ 11/18 GV: Lng Tr n Hy Hi n
cout<<Toan: ; cin>>T;
cout<<Van: ; cin>>V;
}
void Xuat(char HT[50], double T, double V, double DTB)
{
cout<<Sinh vien: <<HT<<endl;
cout<<Toan: <<T<<, Van: <<V<< ==> DTB : <<DTB<<endl;
}
void TinhTB(T, double V, double &DTB)
{
DTB = (T + V) / 2;
}
Bi tp 46:
Vit nh ngha cho hm tongLe trong C++ vi mu khai bo:
long tongLe(int N);
Hm ny tr v tng ca tt c s l t 1 n N (gm c s 1 v s N nu N l, v ta phi gi s N
1). V d khi gi tongLe(7), kt qu tr v s l 16; hoc khi gi tongLe(12) th kt qu l 36.
Vit chng trnh cho php c gi tr s nguyn N t bn phm, gi hm tnh tng cc s l
trong khong t 1 n N, hy in ra gi tr tng .
Bi tp 47:
Vit cc nh ngha cho hm:
(a) ktNgTo, vi mu khai bo: bool ktNgTo(int N);
Hm thc hin vic kim tra xem mt s nguyn c phi l s nguyn t hay khng,
nu ng l s nguyn t th tr v gi tr true, nu khng phi th tr v gi tr false.
(b) Hm nhoHonM vi mu khai bo: void nhoHonM(int M);
Hm ny thc hin vic gi hm ktNgTo v in ra tt c cc s nguyn t nh hn
hoc bng M. V d gi nhoHonM(8) th s in ra cc s nguyn t: 2, 3, 5, 7.
(c) Vit nh ngha cho hm MsoNgTo vi mu khai bo: void MsoNgTo(int M);
Hm ny thc hin vic gi hm ktNgTo v in ra M s nguyn t u tin. V d
gi MsoNgTo(8) th s in ra 8 s nguyn t u tin l: 2, 3, 5, 7, 11, 13, 17, 19.
Vit chng trnh cho c vo gi tr 1 s nguyn dng, gi cc hm nhoHonM v
MsoNgTo in ln lt cc s nguyn t ln mn hnh.
Bi tp 48:
Chng trnh tnh lng ca nhn vin
Vit hm nhp h tn, qu qun, thm nin cng tc ca mt nhn vin.
Vit hm tnh lng da vo thm nin cng tc
Vit hm xut h tn, qu qun, thm nin cng tc v lng ca nhn vin.
Vit chng trnh nhp thng tin ca nhn vin, tnh lng v xut thng tin ca
nhn vin (k c lng) ra mn hnh bng cch s dng 3 hm trn.
Bi tp 49:
Bi tp 53:
Vit chng trnh: (d ng hm)
Nhp vo mt mng (n phn t, n nhp t bn phm)
Bi tp lp trnh C++ 13/18 GV: Lng Tr n Hy Hi n
Khi to mng ngu nhin
Xut mng ra mn hnh
Tm phn t ln nht, nh nht ca mng
Tm v in ra phn t m u tin tn cng bng 6
Tm v in ra v tr phn t dng nh nht
Tnh tng ca mng
Tnh trung bnh cng ca mng
Tm kim mt phn t x cho trc (x nhp t bn phm)
Sp xp mng theo th t tng dn, gim dn
Xut dy o ngc ca dy ban u
Thm mt phn t x vo v tr k (x, k nhp t bn phm)
Hy mt phn t v tr th k
m s phn t dng v in ra tng cc phn t dng ca mng
Kim tra mng c i xng hay khng?
Kim tra mng c sp th t tng hay khng?
Bi tp 54:
Cho mng mt chiu cc s thc hy tm on [a,b] sao cho on ny cha tt c cc gi tr
trong mng (a,b: s nguyn).
4.2. M ng 2 chiu
Bi tp 55:
Vit chng trnh:
Nhp vo mng 2 chiu (kch thc m,n: nhp t bn phm)
Xut mng 2 chiu
Tm phn t Min, Max
Sp xp theo th t zigzag
Sp xp theo th t trn c xoy vo trong
Thm mt dng v vo ma trn cui ma trn
Thm mt dng v vo ma trn dng th k
Xa dng th k khi ma trn
Tm v tr ca phn t va l phn t ln nht trn dng ca n ng thi nh
nht trn ct ca n.
Tnh tng, tch 2 ma trn
Tnh tng theo mt iu kin no .
m s lng cc phn t dng nm ma trn tam gic trn.
Tnh trung bnh cng trn mt ct trong ma trn cc s thc.
Tnh tng cc phn t nm trn bin ca ma trn.
m s lng phn t "yn nga" ca ma trn, bit phn t yn nga l phn t
ln nht trn dng v nh nht trn ct ti v tr ang xt.
m s lng phn t "hong hu" ca ma trn, bit phn t hong hu l phn
t ln nht trn dng, trn ct v hai ng cho i qua n.
o S ln nht,
o S b nht,
o S nguyn t du tin,
o S chnh phng u tin,
o S nguyn t ln nht,
o S nguyn t b nht.
Sp xp trn danh sch.
6.2. K thu t quy
Bi tp 65:
Ci t bi ton tm phn t th n trong dy Fibonaci theo 2 cch: quy v khng quy.
Bi tp 66:
Ci t bi ton thp H Ni. Nhp vo s a, in ra kt qu chuyn a tng bc vi s ct l 3.
Bi tp 67:
Ci t hm tnh ly tha nhanh. V d: x14 = (x7)2, x11 = x6.x5=x.(x5)2,...
Bi tp 68:
Nhp vo s nguyn dng n v s nguyn k (0 <= k <= n) v in ra gi tr C(n,k) ca t hp n ly
k bng cch da vo cng thc: C(n, k) = C(n-1, k) + C(n-1, k-1)
Bi tp 69:
Bi ton 8 con hu: Sp xp n = 8 con hu trn bn c vua 8 x 8 (n x n) sao cho khng c bt k 2
con hu no c th n ln nhau theo lut c vua.
Bi tp lp trnh C++ 16/18 GV: Lng Tr n Hy Hi n
6.3. Lm vic vi t p tin
Bi tp 70:
Mi a thc a0 + a1x + a2x2 + + anxn c lu trong tp tin vn bn theo quy c sau y:
Dng 1: Lu gi tr n
Dng 2: Lu ln lt cc h s: a0, a1, a2, ..., an
Vit chng trnh nhp vo tn mt tp tin vn bn lu a thc, sau cho php ngi
nhp vo gi tr x, chng trnh tnh v in ra gi tr ca a thc ti x. Qu trnh nhp x v
tnh gi tr a thc kt thc khi ngi dng nhp gi tr x = 0.
Bi tp 71:
Nhp ma trn n x n t tp tin vn bn INPUT.TXT c ni dung nh sau:
Dng u tin cha ch s n
Mi dng k tip cha n s tng ng vi mi dng ca ma trn.
V d: Ni dung trong tp tin vn bn INPUT.TXT:
3
45 1 3
2 66 67
1 2 3
Thc hin:
Kim tra hp l ca d liu.
Vit hm kim tra tng cc phn t trn tng hng v ct c bng nhau khng?
Bi tp 72:
Vit chng trnh c vo mt file input.txt v thc hin cc yu cu sau:
c tng dng, kim tra xem chui k t cha dng c phi l mt s nguyn
dng khng? In ra mn hnh tng s dng tha mn.
Ghi ra file output.txt tt c cc s chia ht cho 2 tm thy trong file input.txt.
Bi tp 73:
Cho bit thng tin c nh v lng ca mi cn b trong trng HSP TpHCM gm nhng thng
tin sau:
H v tn
M s nhn vin
Bc lng
Yu cu: