You are on page 1of 14

Tm v in ra mn hnh tng/tch ca cp s ln nht/nh nht trong cc cp s

c to bi 4 s nhp. #inlcude "stdio.h" #include "conio.h" int a, b, c, d; int TimMin(int x, int y) { if(x < y) return x; else return y; } void main() { printf("nhap so thu nhat: "); scanf("%d", &a); printf("nhap so thu hai: "); scanf("%d", &b); printf("nhap so thu ba: "); scanf("%d", &c); printf("nhap so thu tu: "); scanf("%d", &d); printf("So nho nhat trong 4 so: %d", TimMin(a, TimMin(b, TimMin(c, d)))); }

Kim tra s n c l s hon thin/chnh phng/nguyn t/chn/l/chia ht cho

k/ko chia ht cho k/.. #include "stdio.h" #include "conio.h" #include "math.h" // neu dung tra ra 1 // sai tra ra 0 int KTSoNguyenTo(int n) { int i; if(n < 0) return 0; // n phai la so duong else { if(n == 1 || n == 2 || n == 3) return 1; else { for(i = 2; i < n; i++) { if(n % i == 0) {return 1;} } return 0; } } } // neu dung tra ra 1, sai tra ra 0 int KTSoHoanThien(int n) { int tong = 0; int i; for(i = 1; i < n / 2; i++) { if(n % i == 0) tong += i; } if(tong == n) return 1; else return 0; } int KTSoChinhPhuong(int n)

{ int tmp = (int) sqrt(n); if(tmp * tmp == n) return 1; else return 0; } int KTSoChan(int n) { if(n % 2 == 0) return 1; else return 0; }

Tnh tng/tch/m cc ch s c trong n.

#include "stdio.h" #include "conio.h" int TongCacChuSo(int n) { if(n % 10 == 0) return n; else return ((n % 10) + TongCacChuSo(n / 10)); } int TichCacChuSo(int n) { if(n % 10 == 0) return n; else return ((n % 10) * TongCacChuSo(n / 10)); } cai cuoi tu lam

Tm v in ra mn hnh cc c s chung/ c s chung ln nht/bi s chung nh

nht ca hai s a, b. #include "stdio.h" #include "conio.h" // dam bao cac so nhap vao phai > 0 - so duong int TimUocChungLonNhat(int a, int b) { if(a == b) return a; else { if(a > b) return TimUocChungLonNhat(a-b, b); else return TimUocChungLonNhat(a, b-a); } } int BoiChungNhoNhat(int a, int b) { int UC = TimUocChungLonNhat(a, b); if(a > b) return b * UC; else return UC * a; } void UocChung(int a, int b) { int i; int uc = TimUocChungLonNhat(a, b); for(i = 1; i <= uc; i++) { if(uc % i == 0) printf("%d\n", i); } }

Lit k/m s ln xut hin/tnh tng/tch/trung bnh cng ca cc s l cc

s chnh phng/nguyn t/chn/l/chia ht cho k/ko chia ht cho h/... trong 1 khong no . //" Tm v in ra mn hnh cc ??c s? chung/ ??c s? chung l?n nh?t/b?i s? chung nh? nh?t c?a hai s? a, b. #include "stdio.h" #include "conio.h"

int KTSoNguyenTo(int n) { int i; if(n < 0) return 0; // n phai la so duong else { if(n == 1 || n == 2 || n == 3) return 1; else { for(i = 2; i < n; i++) { if(n % i == 0) {return 1;} } return 0; } } } // tong cac so nguyen to trong 1 khoang tu n toi m // dk: n <= m int TongCacSoNgTo(int n, int m) { int tong = 0, i; for(i = n; i <= m; i++) { if(KTSoNguyenTo(i) == 1) tong += i; } return tong; }

// tich cac so nguyen to // dk: n <= m int TichCacSoNgTo(int n, int m) { int t = 1, i; for(i = n; i <= m; i++) { if(KTSoNguyenTo(i) == 1) t *= i; } return t; }

Nhp vo cc s nguyn. (Khng hn ch s lng nhp, vic nhp ch kt thc khi s c nhp vo l s 0) (2). #include "stdio.h" #include "conio.h" void main() { int n; do { printf("nhap so tu nhien(n==0): "); scanf("%d", &n); }while(n != 0); }
Trong cc s va nhp, lit k/m s ln xut hin/tnh tng/tch/trung bnh

cng cc s tha mn K. Trong K l chnh phng/nguyn t/chn/l/chia ht cho k/ko chia ht cho h/l c ca h/ko l c ca k..... Vi h,k l 1 s c th nh 2,3,4,5... gh p c c c u tr n ho n thi n b i to n.

S=1+3+5+n, nu n l; S=2+4+6+n, nu n chn. #include "stdio.h" #include "conio.h" void main() { int n, s = 0, i; do { printf("nhap so tu nhien(n > 0): "); scanf("%d", &n); }while(n <= 0); if(n % 2 == 0) i = 2; else i = 1; for(; i <= n; i += 2) { s += i; } printf("ket qua: % d", s); }

#include "stdio.h" #include "conio.h" void main() { int n, i; float s = 0; do { printf("nhap so tu nhien(n > 1): "); scanf("%d", &n); }while(n <= 1); for(i = 2; i <= n; i++) { s += 1.0/i; } }

x2 x3 xn S=x ... 3 32 3n 1
#include "stdio.h" #include "conio.h" #include "math.h" void main() { int n, i; float s = 0, x; printf("nhap so x: "); scanf("%f", &x); do { printf("nhap so tu nhien(n > 1): "); scanf("%d", &n); }while(n <= 1); for(i = 1; i <= n; i++) { s += pow(x, i) / pow(3, i - 1); } }

#include "stdio.h" #include "conio.h" #include "math.h" void main() { int n, i; float s = 0; do { printf("nhap so tu nhien(n > 1): "); scanf("%d", &n); }while(n <= 1); for(i = 1; i <= n; i++) { s += pow(-1, i) * i; } }

Lit k/m s ln xut hin/Tnh tng/tch/Tm phn t u tin ca cc

phn t l cc s tha mn K1 v K2. Trong K1, k2 l dng/ko dng/m/ko m /chnh phng/ ko chnh phng /nguyn t/ko nguyn t/chn/ko chn/l/ko l/chia ht cho k/ko chia ht cho h/ln hn k/nh hn k/nm ti v tr chn/ nm ti v tr l/bng x/khc x...
#include "stdio.h" #include "conio.h" #include "math.h" //Tnh tong/tich void main() { int a[100]; int n, i, tmp; printf("nhap so phan tu mang: "); scanf("%d", &n); // nhap mang for(i = 0; i < n; i++) { printf("a[%d] = ", (i + 1)); scanf("%d", a[i]); } // hien thi mang for(i = 0; i < n; i++) { printf("a[%d] = %d\n", (i + 1), a[i]); } // tinh tong khi thao man dk la so chan tmp = 0; for(i = 0; i < n; i++) { if(a[i] % 2 == 0) tmp += a[i]; } printf("Tong mang: %d\n", tmp); // tinh tich khi thao man dk la so chan tmp = 1; for(i = 0; i < n; i++) { if(a[i] % 2 == 0) tmp *= a[i]; }

printf("Tich mang: %d\n", tmp); }

You might also like