0% found this document useful (0 votes)
9 views15 pages

Phao Thuc Hanh 3

Uploaded by

Loan Kim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
9 views15 pages

Phao Thuc Hanh 3

Uploaded by

Loan Kim
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 15

Bai 1

#include<stdio.h>

int main(){

int a,b,i,s;

printf("nhap vao so nguyen a:");scanf("%d",&a);

printf ("nhap vao so nguyen b:");scanf("%d",&b);

s=0;

for (i=a;i<=b;i++){

s+=i;

printf("tong cac so tu %d den %d la %d",a,b,s);

return 0;

Bai 2

#include<stdio.h>

int main(){

int a,b,i;

printf("nhap vao gia tri a:");scanf("%d",&a);

printf("nhap vao gia tri b:");scanf("%d",&b);

printf("cac so chia het cho 3 tu a toi b la:");

for (int i=a;i<=b;i++){

if (i%3==0){

printf("%d",i);

return 0;

Bai 3
#include<stdio.h>

#include<conio.h>

int main(){

int ch;

for (ch=0;ch<=255;ch++){

printf("%d\t%c\t",ch,ch);

if ((ch+1)% 11==0){

printf("\n");

getch();

return 0;

Bai 4

#include<stdio.h>

int main(){

int n,i,s1,s2;

printf ("nhap n:");scanf("%d",&n);

s1=0;

s2=0;

for (i=1;i<=n;i++){

if (i%2==0){

s2+=i;

}else {

s1+=i;

printf ("tong cac so le la: %d\n",s1);


printf (" tong cac so chan la :%d\n",s2);

return 0;

BAI 5

#include<stdio.h>

#include<math.h>

int main (){

int n,i;

float s1=0,s2=0,s3=1;

do{

printf("nhap so nguyen duong n:");

scanf("%d",&n);

}while (n<=0);

for (i=1;i<=n;i++){

s1 = s1+i;

s2=s2 + i*i;

s3=s3 + (2*i+1)*(2*i+1);

s1=s1/n;

s2=sqrt(s2);

printf("s1=%f,s2=%f,s3=%f",s1,s2,s3);

return 0;

Bai 6

#include<math.h>

#include<stdio.h>

int main(){

int n,k,i;
double gt1,gt2,gt3;

printf("nhap n:");scanf("%d",&n);

printf("nhap k:");scanf("%d",&k);

gt1=1;

if (n!=0){

for (i=1;i<=n;i++){

gt1*=i;

gt2=1;

for (i=1;i<=k;i++){

gt2*=i;

gt3=1;

for (i=1;i<=(n-k);i++){

gt3*=i;

double ketqua=gt1/(gt2*gt3);

printf("ketqua: %lf",ketqua);

return 0;

Bai 7

#include <iostream>

#include <stdio.h>

#include <math.h>

int main() {

int n, i;

double f0, f1, fn, s;

printf("Nhap so nguyen n >= 0: ");


scanf("%d", &n);

f0 = 0;

f1 = 1;

s = 1;

printf("Day Fibonacci: %.0f %.0f ", f0, f1);

for(i = 1; i <= n - 2; i++) {

fn = f0 + f1;

printf("%.0f ", fn);

f0 = f1;

f1 = fn;

s += fn;

printf("\nTong S: %.0f\n", s);

return 0;

Bài 8

#include<stdio.h>

#include<math.h>

int main(){

int i;

for (i=10;i<=99;i++){

if ((i/10)*(i%10)==2*((i/10)+(i%10))){

printf("%d",i);

return 0;

Bài 9
#include <stdio.h>

#include <math.h>

int main() {

int i, j, sum;

for (i = 2; i <= 1000; i++) {

sum = 1;

for (j = 2; j <= i / 2; j++) {

if (i % j == 0) {

sum += j;

if (sum == i) {

printf("%d ", i);

return 0;

Bai 10

#include<stdio.h>

#include<math.h>

int main(){

int n,i,dem = 0;

printf("nhap vao mot so nguyen duong n(n>1):");

scanf("%d",&n);

for (i=2; i<= sqrt(n);i++){


if (n % i == 0){

dem++;

break;

if (dem== 0){

printf ("%d la so nguyen to.",n);

}else {

printf ("%d khong phai so nguyen to.",n);

return 0;

Bài 11

#include<stdio.h>

int main(){

int n,m =0,tam;

printf("nhap vao mot so nguyen :");scanf("%d",&n);

while (n>0){

tam = n%10;m=m*10+tam;n=n/10;

printf("so dao nguoc cua so nhap vao la:%d\n",m);

return 0;

Bai 12

#include<stdio.h>

int main(){

int a,b,ucln,bcnn,tam;

printf("nhap vao hai so nguyen a va b:");

scanf("%d%d",&a,&b);
tam = a*b;

while (a!=b){

if (a>b){

a=a-b;

}else {

b=b-a;

ucln = a;

bcnn = tam / ucln;

printf("uoc so chung lon nhat :%d\n",ucln);

printf("boi so chung nho nhat :%d\n",bcnn);

return 0;

Bai 13

#include<math.h>

#include<stdio.h>

int main(){

float x,epsilon;

int n;

float s,t,dau;

printf("nhap x:");scanf("%f",&x);

printf("nhap epsilon:");scanf("%f",&epsilon);

dau =-1;

n=1;

s=t=x;

while(fabs(t)>=epsilon){

n=n+2;

t=t*(x*x/(n*(n-1)));
s= s+dau*t;

dau = -dau;

printf("gia tri gan dung cua sin(%f)la:%f",x,s);

return 0;

Bai 14

#include <stdio.h>

int main()

float p, s, t;

printf("Nhap so tien goi: ");

scanf("%f", &s);

printf("Nhap lai suat (%/thang): ");

scanf("%f", &p);

p = 0.01*p;

printf("Nhap so tien nhan duoc: ");

scanf("%f", &t);

int n = 0;

while (s < t)

n++;

s = s + s*p;

}
printf("So thang can goi la: %d\n", n);

return 0;

Bai 15

#include <stdio.h>

int main() {

int n;

do {

printf("Nhap vao so nguyen duong n: ");

scanf("%d", &n);

} while (n <= 0);

float s4 = 0;

for (int i = 1; i <= n; i++) {

float term = (i % 2 == 0) ? -1.0 : 1.0;

term /= (2*i) * (2*i);

s4 += term;

float s5 = 1.0;

for (int i = 2; i <= 2*n; i += 2) {

s5 *= (float)(i-1) / i;

int sign = 1;

float s6 = 0;

for (int i = 1; i <= n; i++) {

int term = i * (i+1) * (i+2);

s6 += sign * term;

sign *= -1;

int s7 = 1;
if (n % 2 == 0) {

for (int i = 2; i <= n; i += 2) {

s7 *= i;

} else {

for (int i = 1; i <= n; i += 2) {

s7 *= i;

printf("s4 = %f\n", s4);

printf("s5 = %f\n", s5);

printf("s6 = %f\n", s6);

printf("s7 = %d\n", s7);

return 0;

Bai 16

#include <stdio.h>

#include <math.h>

int isPrime(int num) {

if (num < 2) return 0;

for (int i = 2; i <= sqrt(num); i++) {

if (num % i == 0) {

return 0;

return 1;

}
int main() {

int n;

printf("nhap mot so nguyen n: ");

scanf("%d", &n);

printf("cac so nguyen to nho hon hoac bang %d la: ", n);

for (int i = 2; i <= n; i++) {

if (isPrime(i)) {

printf("%d ", i);

return 0;

Bai 17

#include <stdio.h>

#include <math.h>

int isSymmetric(int num) {

int temp = num;

int reverse = 0;

while (temp != 0) {

reverse = reverse * 10 + temp % 10;

temp = temp / 10;

if (num == reverse)

return 1;

else
return 0;

int main() {

int num;

printf("Nhap vao mot so: ");

scanf("%d", &num);

if (isSymmetric(num))

printf("%d la so doi xung.\n", num);

else

printf("%d khong phai la so doi xung.\n", num);

return 0;

Bai 18

#include <stdio.h>

#include <cmath>

#include <conio.h>

int main() {

float so_tien_gui, lai_suat, so_thang;

printf("Nhap so tien gui: ");

scanf("%f", &so_tien_gui);

printf("Nhap so thang: ");


scanf("%f", &so_thang);

printf("Nhap lai suat (theo thang): ");

scanf("%f", &lai_suat);

float so_tien_nhan_duoc = so_tien_gui * pow(1 + lai_suat/100, so_thang);

printf("So tien nhan duoc sau %0.0f thang la: %0.2f", so_thang, so_tien_nhan_duoc);

getch();

return 0;

Bai 19

#include <stdio.h>

#include <math.h>

double tinhCos(double x, double epsilon) {

double e;

double cosx = 1.0;

double term = 1.0;

int n = 2;

do {

term *= -x * x / (n * (n - 1));

cosx += term;

e = fabs(term);

n += 2;

} while (e > epsilon);


return cosx;

int main() {

double x, epsilon;

printf("Nhap gia tri x: ");

scanf("%lf", &x);

printf("Nhap do chinh xac epsilon: ");

scanf("%lf", &epsilon);

double result = tinhCos(x, epsilon);

printf("cos(%lf) = %lf\n", x, result);

return 0;

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy