Professional Documents
Culture Documents
Baitaptindc-1.doc 1464524006991
Baitaptindc-1.doc 1464524006991
Cu 8: A (101.112=22+20+2-1+2-2=5.7510)
Cu 9: C ( 200816=2x163+0x162+0x161+8x160=820010)
KT
CN
-K
58
SV
Ch : 1TB=210GB=220MG=230KB=240B, 1B=8bit.
Cu 22: C (1MB=210KB)
Cu 23: A (1MB=220KB)
Cu 24: A (1TB=210GB).
LI GII SBT TIN I CNG
Page 1
Cu 25: C
Cu 26: A.
58
-K
KT
CN
Cch 2
195=11000011
143=10001111
SV
Cch 1
195+143=338
=>195+143=1 101010010=82
Page 2
-K
58
KT
CN
Cu 44: D (Chuyn 106 sang h nh phn sau thc hin o bit ca s nh phn ny (NOT
0=>1 v NOT 1=>0), 10610=01101010 =>NOT 10610=10010101).
Cu 45: C (Thc hin tng ng tng bit, 1 XOR 0=1, 0 XOR 1=1, 1 XOR 1=0, 0 XOR 0=0)
=>10010110 XOR 01101001=11111111
Cu 46: C (Theo chun IEEE 754/85, cch biu din s thc chnh xc n (dng 32 bit) th s
bt sung biu din phn m lnh (e) l 8 bit)
SV
Cu 47: D (Theo chun IEEE 754/85 cch biu din s thc chnh xc n (dng 64 bit) th s
bit dng biu din phn m lnh (e) l 11 bit)
X= 0 01111111 000000000000000000000002
Page 3
Cu 55: A
58
-K
Cu 63: C (Thanh ghi ni lu tr lnh ang c thc hin v a ch ca lnh tip theo)
KT
CN
SV
Cu 74: B
Cu 75: D
Cu 76: A
Cu 77: B
Cu 78: A
Cu81: B
Page 4
Cu 91: B
-K
Cu 90: C
58
Cu 89: A (Mng LAN-mng cc b trong bn knh vi trm mt, WAN-mng din rng trong
bn knh vi trm km, GAN-mng ton cu)
KT
CN
Cu 94: D (Lp trnh programming khng phi dch v trn mng internet)
Cu 95: D (FPT vit tt ca file transfer protocol l giao thc truyn file trn TCP/IP)
Cu 96: C
SV
Cu 100: B
Cu 99: D
Cu 101: B (Mi tng tc gia phn mm vi phn cng u phi qua h iu hnh).
Cu 103: B
Cu 105: C
Cu 106: D
Cu 108: C
Cu 107: A
Page 5
58
Cu 118: C (Win 95 =>win 98, win me => win 2000, win xp, win 2003 =>win vista (2007) =>win
7 (2009) => win 8 (2011))
Cu 119: D (Windows Explorer l chng trnh duyt v qun l cc file v th mc my cc b).
-K
Cu 120: A (Cc thit b Plug and Play c th cm v s dng lun (khng cn phi khi ng li,
hoc ci t driver)
Cu 121: A
KT
CN
Cu 122: B (My in khng phi dng Plug and Play, ta cn ci Driver trc khi dng)
Cu 123: D ( g b phn mm khng dng ta dng Add and Remove Programs hoc Programs
and Features trong Windows 8)
Cu 124: B
Cu 125: C
Cu 126: C (Vng i phn mm gm 7 giai on. Phn tch vn , a ra thut ton, kim tra
code, kim tra, ci t trin khai, bo tr)
SV
Cu 132: A
Cu 130: D
Cu 131: B
Cu 133: C
Cu 135: D
Page 6
Cu 142: C
Cu 143: D
Cu 144: D
Cu 145: C (Doanh nghip=Business, ngi dng= Customer)
Cu 148: A
Cu 149: B
Cu 150: B
Cu 151: A
Cu 152: A
Cu 153: B
Cu 154: C
Cu 155: A
Cu 156: D
-K
Cu 147: D
58
KT
CN
B5 a=b-a SAI
B6 a>b-a ng
B7 gn a=a-b+a
SV
B3 a>b SAI
B4 gn b=b-a
Cu 160: B (Gn MAX=3 MAX<B l sai nn thc hin lnh sau end if MAX=5)
Cu 162: B
i
10
A=A+2
S=S+i
10
15
21
28
36
45
Cu 164: B (thc hin cu lnh X=2x va n=n+1 n khi no X>1000 th dng li)
X
16
Page 7
X=2X
16
65536>1000
n=n+1
16
32
64
128
256
512
x=2*x
16
32
64
128
256
512
1024>1000
10
11
58
Cu 167: D
T(2)=2*T(1)+3*T(0)=2*1+3*1=5
-K
T(3)=2*T(2)+3*T(1)=2*5+3*1=13
T(4)=2*13+3*5=41
KT
CN
Cu 171: A (Ngn ng lp trnh C trnh bin dch s bin dch ngn ng C thnh m my)
Cu 172: C (Thng dch)
SV
Cu 179: D (nh ngha khai bo hm main() v trc hm main() l phn khai bo th vin nu
khng c hm main() th ta s khng vit c chng trnh)
Cu 180: A (D:\TC\BIN\Tc.exe ta th l bit ngay)
Cu 181: C ( chy c mt chng trnh vit bng ngn ng lp trnh bc cao trc ht cn
bin dch hoc thng dch trng trnh)
Cu 182: A (Ngn ng lp trnh dng vit chng trnh)
LI GII SBT TIN I CNG
Page 8
Cu 183: A
Cu 184: B (int (2 byte), long (4 byte) float (4byte), double(8byte)).
Cu 185: D (Xem iu kn nh danh cu 174)
Cu 186: D (ch : While khng phi l t kha m l while, cc t kha vit thng).
Cu 189: D (C 2 cch khai bo hng: #define tn_hng gi_tr hoc
const kiu_hng tn_hng=gi_tr;).
Cu 191: A (Cch khai bo hng cu 189)
-K
Cu 194: /A: B
58
KT
CN
SV
Cu 201: D
Cu 204: C ( 1<7(ng)(1=>a=1<7<5(a=1<5(ng)(a=1)
Cu 205: B 7+5&&4<=1+3-2/3||5<2+1 (Th t u tin: /, +, -, <, <=, &&, || tham kho th t u
tin SGK trang 153)
Page 9
58
-K
KT
CN
SV
Cu 221: B (%c hin th k t, %s hin th xu k t) tham kho bng trang 159 SGK.
Cu 222: D
Cu 226: B
Page 10
58
Cu 238: A (v 5>5 l sai nn ta thc hin lnh sau else m lnh printf(3) v printf(5) khng
c k t xung dng hay cch th nn n s c vit lin vi nhau)
-K
Cu 239: C (0<1 ng nn thc hin gn A=B=1(A gn bng B), B=A=1 (B gn bng A))
Cu 240: A (y l cu lnh tm s ln nht trong 2 s)
Cu 242: C
KT
CN
Cu 241: B (0<1 ng thc hin lnh gn C=B (B=1) =1,B=A (A=0) =0,A=C (C=1) =1)
A=A+2
Cu 247: B
i
10
10 kt thc
10
12
20
30
sum
SV
Page 11
58
-K
KT
CN
Cu 254: D (Vng lp for b li c php, for(i<5;i++) thiu khi to gi tr ban u cho bin i)
Cu 255: A
Cu 256: D (Lnh while kim tra iu kin vng lp trc ri mi thc hin lnh)
SV
10 kt thc
Page 12
printf
10
58
Cu 263: B (Lnh while(++i<=5) c ++i l tin t nn s c thc hin trc sau mi thc
hin kim tra i<=5 vi gi tr ban u ca i l 0. Vng lp ny s lp vi cc gi tr ca i l
1,2,3,4,5)
-K
KT
CN
Cu 265: C (iu kin dng l ngi dng nhp vo gi tr n tha mn trong khong t 0 ti 100.
Vy vng lp s tip tc lp khi m n cn nhp sai)
Cu 266: D (Lnh while kim tra iu kin vng lp trc ri mi thc hin lnh)
Cu 267: A ( y nhp sai l gi tr n<0, vy A v B tng ng l cc biu thc n<0)
Cu 268: A (Trong vng lp for lnh continue lun c thc hin, nn n s lun b qua lnh
A=A+1 do khi kt thc vng lp gi tr ca A vn l 0)
SV
Cu 269: B (Trong vng lp for lnh break xy ra ngay khi thc hin ln lp u tin, vy vng
lp ny ch lp c 1 ln gi tr A s l A=A+100=100)
Cu 270: A
Cu 272: A
Ch : break l lnh ngt vng lp, gp break vng lp s c dng ngay c iu kin vng lp
vn tha mn.
Cu 271: D (Lun gp lnh continue)
a=5->in ra b=4+5=9
a=7->in ra b=9+7=16
a=1-> in ra b=0+1=1
a=9->in ra b=16+9=25
Cu 274: B
Cu 275: B Vng lp lp khi i cn nh hn 10, tuy nhin nu i chn n dng ngay vng lp
LI GII SBT TIN I CNG
Page 13
-K
58
KT
CN
i=9,i++ thnh 10,i%10= =0 l ng, b qua lnh sau, vng lp dng v iu kin i<10 l sai vy
chng trnh in ra cc s 1 3 5 7 9
SV
Cu 278: D i%2==0 ng => gp continue => quay li vng lp => i lung bng 0 => lp v hn
i++ => i=2: tha m iu kin if => gp break => kt thc vng lp.
Cu 280: C (Chng trnh hin th bin i chn, I t 10->2 => khng bao gi lnh if xy ra)
Cu 281: C
Cu 282: C
Cu 285: D
Page 14
Cu 286: D (B[4] => gm cc phn t B[0], B[1], B[2], B[3] => khng c phn t B[4])
Cu 287: B (Hin th ra cc bin i vi a[i]#5)
Cu 288: A (In ra cc phn t khc 5)
Cu 289: B (In ra v tr cc phn t ca mng khng chia ht cho 3)
Cu 290: C (In ra v tr cc phn t ca mng khng chia ht cho3)
Cu 291: D (Khai bo mng c kch thc ti a 100 phn t kiu nguyn)
58
Cu 292: B (Ta khng th gn trc tip hai bin mng vi nhau c, thay vo ta phi duyt
v gn gi tr ca tng phn t trong mng)
Cu 294: A
Cu 295: A (Cc bn ch cc lnh gn v bin chy j v i)
-K
KT
CN
SV
Cu 299: B (Th t cc phn t mng M[4][5]: M[0][0], M[0][1], M[0][2], M[0][3], M[0][4],
M[1][0], M[1][1], M[1][2], M[1][3], M[1][4], M[2][0], M[2][1], M[2][2], M[2][3], M[2][4],
M[3][0], M[3][1], M[3][2], M[3][3], M[3][4])
Cu 300: B (Tng t cu 299 cc bn nh ^^)
Cu 303: D
Cu 305: D
Cu 301: D
Cu 304: C
Cu 306: D
Cu 310: C
Cu 311: A
Cu 315: A
Page 15
Cu 316: C (Ch : Lnh gets c th nhp c du cch, scanf khng nhp c cch)
Cu 317: A
Cu 318: B
Cu 319: A
Cu 320: C
Ch : strlen(S) di xu S
strcmp(S1,S2)
S1>S2 th tr v gi tr dng
58
S1=S2 th tr v 0
S1<S2 th tr v gi tr m
strcat(S1,S2) Ni S1=S1+S2
Cu 322: C
Cu 323: C
Cu 324: C
Cu 325: C
Cu 326: C
Cu 327: A
Cu 328: C
Cu 332: A
Cu 333: C
Cu 334: A
Cu 341: B
Cu 336: B
Cu 335: A
Cu 339: C
SV
Cu 331: C
Cu 337: A
KT
CN
Cu 321: A
-K
strcpy(S1,S2) Copy S2 thnh S1, xu khng dung lnh gn m phi dung strcpy
Cu 343: B
Cu 338: D
Cu 340: D
Cu 342: D
Cu 344: D
Cu 345: C
Page 16
#include <stdio.h>
#include <stdio.h>
#include <conio.h>
#include <conio.h>
#include <math.h>
#include <math.h>
float tinh(float x)
KT
CN
-K
Bi 1
58
BI TP T GII SBT
float tinh(float x) {
float d;
float d;
d=2*pow(x,4)-3;
d=3*pow(x,2)+5;
return d; }
return d; }
main()
{
int i,n;
float x;
SV
main()
{
int i,n;
float x;
scanf("%f",&x);
scanf("%f",&x);
printf("Gia tri ham voi cac doi so la: \n");
for(i=0;i<=19;i++)
for(i=0;i<=19;i++)
x=x+0.05; }
x=x-0.02; }
getch();
getch();
Bi 2
LI GII SBT TIN I CNG
Page 17
Bi 3
char s[5];
n=0;
#include<conio.h>
do
#include<math.h>
float ham(float x)
if(isalpha(s[0])) break;
float a,b;
a[n]=atoi(s); n++;
a=pow(3,2*x)+5;
}while (n<52);
b=(2*(log(-1*x)/log(3))+1)/3;
for(i=0;i<n;i++)
if(x>=0) return a;
if(a[i]%3==0)
else return b;
b[k]=a[i]; k++; }
KT
CN
-K
58
#include<stdio.h>
int main()
for(i=0;i<k;i++) printf("%3d",b[i]);
float x;
getch();
}
Bi 5
SV
getch();
}
Bi 4
#include <stdio.h>
#include <conio.h>
#include <ctype.h>
#include <stdio.h>
#include <conio.h>
#include <math.h>
int ucln(int a, int b)
{
while(a!=b)
{
#include <stdlib.h>
else b=b-a; }
int main()
{
int i,k=0,n;
int a[100],b[100];
LI GII SBT TIN I CNG
if(a>b) a=a-b;
return a; }
int main()
{
int a,b,c;
Page 18
}while(a==0 || b==0);
e=c; d=ucln(a,b);
while(d!=c)
}while(a==0 || b==0);
{ if(d>c) d=d-c;
else c=c-d; }
58
do
getch();
KT
CN
Bi 6
Bi 7
#include <stdio.h>
#include <stdio.h>
#include <conio.h>
#include <conio.h>
#include <math.h>
#include <math.h>
{
while(a!=b)
{ if(a>b) a=a-b;
int main()
SV
else b=b-a; }
return a; }
{
int i,x,S=0;
unsigned int n;
printf("Nhap n voi (n>0): ");scanf("%d",&n);
printf("\nNhap x= "); scanf("%d",&x);
for(i=0;i<=n;i++)
S=S+pow(x,i);
int main()
{
-K
getch();
printf("\nTong S= %d",S);
do
getch();
Bi 8
#include <stdio.h>
int a,b,c,d,e;
Page 19
#include <conio.h>
#include <math.h>
s=s+a[i]; dem++; }
int main()
getch();
int i,x,S=0;
#include <stdio.h>
-K
#include <conio.h>
for(i=0;i<=n;i++)
#include <math.h>
S=S+pow(-1,i)*pow(x,i);
int main()
printf("\nTong S= %d",S);
KT
CN
getch(); }
float a[1000],s;
Bi 9
int i,j,n,dem;
#include <stdio.h>
#include <conio.h>
for(i=0;i<n;i++)
#include <math.h>
{
float a[1000],s;
SV
int main()
int i,n,dem;
for(i=0;i<n;i++)
{
Bi 10
58
unsigned int n;
int temp;
temp=a[j];a[j]=a[i];a[i]=temp;
}}
s=0; dem=0;
for(i=0;i<n;i++)
for(i=0;i<n;i++)
if(a[i]>0)
LI GII SBT TIN I CNG
Page 20
printf("%6.2f",a[i]);
#include<conio.h>
getch();
#include<string.h>
#include<ctype.h>
Bi 11
int main()
#include<stdio.h>
{
char xau[100],kt,c;
#include<string.h>
int i;
58
#include<conio.h>
int main()
for(i=0;i<strlen(xau);i++)
-K
#include<ctype.h>
int i,j,k=0,kt=0;
kt=toupper(xau[i]);
KT
CN
char email[100];
printf("%c",kt); }
if(islower(xau[i]))
if(kt==1) break; }
SV
if(isspace(email[i])) kt=1;
for(i=0;i<strlen(email);i++)
getch();
}
if(k>=2||j==0||j==strlen(email)-1)
{kt=1;break;}
Bi 13
if(email[i]=='@') {k++;j=i;}
#include<stdio.h>
#include<conio.h>
#include<string.h>
int main()
{
char x[50][100],kt[50];
int n,i=0;
printf("hay nhap so xau:\n");
Page 21
#include<stdio.h>
for(i=0;i<n;i++)
#include<conio.h>
#include<math.h>
scanf("%s",x[i]); }
for(i=0;i<n;i++)
int i;
if(strlen(x[i])>strlen(kt)) strcpy(kt,x[i]);
while(a!=b)
-K
if(a>b) a-=b;
58
scanf("%d",&n);
else b-=a; }
KT
CN
if(a==1) return 1;
else return 0; }
Bi 16
int main()
#include<stdio.h>
#include<conio.h>
int x,y;
#include<math.h>
int u1=1,u2=1,u=0,n,i;
printf("Nhap so:");
SV
int main()
u=4*u2+3*u1;
u1=u2;u2=u; }
printf("\nU= %3d",u);
getch();
}
Bi 17
LI GII SBT TIN I CNG
int Bl;
}NHAN_VIEN;
int i;
NHAN_VIEN ds[70], k;
while(a!=b)
int main()
if(a>b) a-=b;
int i,j,bl,n=0;
char hoten[30],diachi[50];
if(a==1) return 1;
for(i=1;i<=70;i++)
else return 0; }
int main()
KT
CN
if(strcmp(hoten,"###")==0) break;
int x,y;
n++;
printf("Nhap so:");
printf("\nx= "); scanf("%d",&x);
printf("\ny= "); scanf("%d",&y);
SV
}
Bi 19
-K
58
else b-=a; }
#include<stdio.h>
strcpy(ds[i].hoten,hoten);
printf("\nNhap dia chi nv %d: ",i);
fflush(stdin); gets(diachi);
strcpy(ds[i].diachi,diachi);
printf("\nNhap bac luong nv %d: ",i);
scanf("%d",&ds[i].Bl); printf("\n"); }
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(ds[i].Bl>ds[j].Bl)
{ k=ds[i]; ds[i]=ds[j]; ds[j]=k; }
printf("\nDanh sach nhan vien theo bac
luong:");
#include<string.h>
for(i=1;i<=n;i++)
typedef struct
{
printf("\n%d.%s.%s.%d",i,ds[i].hoten,ds[i].d
iachi,ds[i].Bl);
getch();
#include<conio.h>
}
LI GII SBT TIN I CNG
Page 23
Bi 20
#include<stdio.h>
scanf("%f",&hs[i].dt);
#include<conio.h>
printf("\n"); }
#include<string.h>
for(i=0;i<n-1;i++)
typedef struct
for(j=i+1;j<n;j++)
if(hs[i].dt<hs[j].dt)
char dc[100];
int ns;
ds=hs[j]; hs[j]=hs[i];hs[i]=ds; }}
float dt;
-K
}hocsinh;
KT
CN
for(i=0;i<n;i++)
hocsinh hs[100],ds;
for(i=0;i<n;i++)
int main()
if(hs[i].dt==hs[n-1].dt) printf("\n
%s",hs[i].ht); }
char ht[30],dc[100];
getch();
float dt;
for(i=0;i<50;i++)
SV
int ns,i,j,n=0;
if(strcmp(ht,"NO")==0) break;
n++;
58
char ht[30],
strcpy(hs[i].ht,ht);
}
Bi 21
#include<stdio.h>
#include<conio.h>
#include<string.h>
typedef struct
{
char hoten[30];
char diachi[100];
int ns,ml;
}NHAN_VIEN;
fflush(stdin); gets(dc);
NHAN_VIEN ds[100], k;
int main()
Page 24
Bi 22
int i,j,ml,n=0;
#include<stdio.h>
char hoten[30],diachi[100];
#include<conio.h>
for(i=1;i<=100;i++)
#include<string.h>
typedef struct
58
char nhanhieu[50];
if(strcmp(hoten,"No")==0) break;
char bienso[50];
n++;
int dungtichxl;
strcpy(ds[i].diachi,diachi);
printf("\nNhap muc luong nv %d: ",i);
scanf("%d",&ds[i].ml); printf("\n");
}OTO;
KT
CN
-K
char tenhang[50];
strcpy(ds[i].hoten,hoten);
OTO ds[50], k;
int main()
{
int i,j,n=0;
char nhanhieu[50];
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(ds[i].ns>ds[j].ns)
SV
char tenhang[50];
for(i=1;i<=50;i++)
{
printf("Nhap nhan hieu xe %d: ",i);
fflush(stdin); gets(nhanhieu);
if(strcmp(nhanhieu,"No")==0) break;
for(i=1;i<=n;i++)
n++;
char bienso[50];
if(ds[i].ns==ds[1].ns)
strcpy(ds[i].nhanhieu,nhanhieu);
printf("\n%s.%d.%s.%d",ds[i].hoten,ds[i].ns
,ds[i].diachi,ds[i].ml);
getch();
strcpy(ds[i].bienso,bienso);
Page 25
strcpy(ds[i].tenhang,tenhang);
int main()
printf("\n"); }
int i,j,n=0;
char tenhang[100];
for(i=1;i<=n-1;i++)
char chungloai[100];
for(j=i+1;j<=n;j++)
for(i=1;i<=50;i++)
if(ds[i].dungtichxl<ds[j].dungtichxl)
58
if(strcmp(tenhang,"No")==0) break;
n++;
-K
KT
CN
strcpy(ds[i].tenhang,tenhang);
if(ds[i].dungtichxl==ds[n].dungtichxl)
printf("\n%s.%d.%s.%d",ds[i].nhanhieu,ds[i
].bienso,ds[i].tenhang,ds[i].dungtichxl);
getch();
}
#include<stdio.h>
#include<conio.h>
#include<string.h>
SV
Bi 23
typedef struct
for(i=1;i<=n-1;i++)
for(j=i+1;j<=n;j++)
if(ds[i].gia<ds[j].gia)
int ngaynhap;
char tenhang[100];
int soluong;
int gia;
char chungloai[100];
for(i=1;i<=n;i++)
}KHOHANG;
if(ds[i].gia==ds[n].gia)
KHOHANG ds[100], k;
printf("\n%s.%d.%d.%d.%s",ds[i].tenhang,d
Page 26
s[i].ngaynhap,ds[i].soluong,ds[i].gia,ds[i].ch
ungloai);
if(sodien>100&&sodien<=150)
td=100*550+(sodien-100)*1000;
getch();
if(sodien>150)
td=100*550+50*1000+(sodien-150)*1500;
return td; }
Bi 24
int main()
#include<stdio.h>
int N,i,k=0,t=0;
int main()
int a[30];
do
int i,kq=0,k=0;
-K
int sd [40];
58
#include<conio.h>
KT
CN
for(i=0;i<30;i++)
{
}while(N>40);
kq=kq+a[i];
if(a[i]==a[0]) k++; }
SV
if(kq>1000) break;
getch();
}
Bi 25
for(i=0;i<N;i++)
{
printf("\nSo dien hd %d: ",i+1);
scanf("%d",&sd[i]);}
for(i=0;i<N;i++)
{
stt[i]=TIENDIEN(sd[i]);
#include<conio.h>
t=t+stt[i]; }
#include<math.h>
#include<stdio.h>
getch();
}
Bi 27
Page 27
#include<stdio.h>
typedef struct
#include<conio.h>
#include<string.h>
char nsx[25];
typedef struct
int kt;
}giay;
char hsx[20];
int nsx;
int main()
}XEMAY;
XEMAY ds[30];
-K
char nsx[25];
58
giay stt[100];
int main()
int kt;
int i=0,k=0,ktkt[100];
int i,k=0;
KT
CN
for(i=0;i<100;i++)
char hsx[20];
for(i=1;i<=5;i++)
fflush(stdin); scanf("%s",nsx);
strcpy(ds[i].hsx,hsx);
SV
strcpy(stt[i].nsx,nsx);
printf("\nNhap kt doi thu %d: ",i+1);
scanf("%d",&stt[i].kt);
printf("\n"); }
for(i=0;i<100;i++)
if(strcmp(ds[i].hsx,"Honda")==0) k++;
if(strcmp(stt[i].nsx,"BinhTien")==0)
for(i=1;i<=5;i++)
getch();
}
{
ktkt[k]=stt[i].kt; k++;
}}
Bi 28
#include<stdio.h>
#include<conio.h>
for(i=0;i<k;i++)
#include<string.h>
printf("\n%d: %d.",i=1,ktkt[i]);
Page 28
getch();
if(ChinhPhuong(A[i])==1) printf("
%d",A[i]);
getch();
Bi 29
#include<stdio.h>
Bi 30
#include<conio.h>
#include<stdio.h>
#include<math.h>
#include<string.h>
i=(int)sqrt(x);
int tuso;
if(x==i*i) return 1;
int mauso;
KT
CN
else return 0; }
-K
typedef struct
int i;
58
#include<conio.h>
int ChinhPhuong(int x)
}PHANSO;
int main()
PHANSO a[5];
int A[100];
int n,i;
int kq;
SV
do
{
kq=(float)tuso/mauso;
return kq; }
int Sosanh(float a,float b)
{
}while(n<10||n>20);
int x,y,z,t;
a=Nhap(x,y); b=Nhap(x,y);
if(a==b) return 0;
if(a>b) return 1;
for(i=1;i<=n;i++)
Page 29
printf("\nts1= ");scanf("%d",&a[1].tuso);
printf("ms1= ");scanf("%d",&a[1].mauso);
printf("\nts2= ");scanf("%d",&a[2].tuso);
printf("ms2= ");scanf("%d",&a[2].mauso);
kt=Sosanh(Nhap(a[1].tuso,a[1].mauso),Nha
p(a[2].tuso,a[2].mauso));
if(kt==1) printf("\nPhanso 1 lon hon phan
so 2");
getch();
SV
KT
CN
-K
58
Page 30