Truyen2U.Top - Tên miền mới của Truyen2U.Net. Hãy sử dụng ứng dụng 1.1.1.1 để đọc truyện nhé!

Mang 1 chieu

Màu nền
Font chữ
Font size
Chiều cao dòng

#include <stdio.h>

#include <conio.h>

#include <math.h>

void nhap_n(int &n)

{

printf("Nhap n: ");

scanf("%d",&n);

}

void nhapmang_songuyen(int a[], int n)

{

i = 0;

printf("Nhap mang so nguyen

");

for( i = 0; i< n ; i++)

{

printf("a[%d] = ",i);

scanf("%d",&a[i]);

}

}

void xuatmang_songuyen(int a[], int n)

{

i = 0;

printf("mang vua nhap :

");

for(i = 0; i <n ; i++)

{

printf("a[%d] = %d

",i, a[i]);

}

}

................................

//chuong trinh tim boi chung nho nhat cua mang 1 chieu.

#include <stdio.h>

#include <conio.h>

void main(){

clrscr();

int A[100];

int n; //so phan tu trong mang

printf("cho biet so phan tu trong mang:");

scanf("%d",&n);

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

printf("A[%d]=",i);

scanf("%d",&A[i]);

}

//tim gia tri lon nhat trong mang

int max=A[0];

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

if(max<A[i]) max=A[i];

}

int ucln;

int bcnn,tam;

ucln=A[0];

bcnn=A[0];

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

{

tam=A[i];

while(ucln!=tam)

{

if(ucln>tam) ucln=ucln-tam;

else tam=tam-ucln;

}

ucln=tam;

bcnn=(bcnn*A[i])/ucln;

ucln=bcnn;

}

printf("%d",bcnn);

getch();

}

................................

/*Viet ham nhan 1 mang so nguyen, tra ve:

0 neu mang sau khi dc sap tang dan ko la cap so cong

1 neu mang sau khi dc sap tang dan la cap so cong */

#include <conio.h>

#include <stdio.h>

void sapxep(int a[],int n)

{ int i,j,t,m,x;

x=1;

for(i=0;i<n-1;i++)

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

if(a[i]>a[j])

{ t=a[i];

a[i]=a[j];

a[j]=t;

}

m=a[1]-a[0];

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

if((a[i+1]-a[i])==m) x++;

if(x==(n-1)) printf("

1");

else printf("

0");

}

void main()

{ int a[100],i,n;

printf("

Nhap n:"); scanf("%d",&n);

for(i=0;i<n;i++)

{ printf("a[%d]=",i);

scanf("%d",&a[i]);

}

sapxep(a,n);

getch();

}

...........................

/* Nhap n Phan so, n nhap tu ban phim

Tinh tong cac phan so, in ra dang toi gian cua phan so*/

#include <stdio.h>

#include <conio.h>

typedef struct {int tuso, mauso;

} phanso;

phanso c;

int UCLN(int a, int b)

{ int y;

a= a>=0?a:-a;

b= b>=0?b:-b;

if(a>b) y=b;

else y=a;

while((a % y!=0)||(b % y!=0)) y--;

return y;

}

phanso uocluoc(phanso a)

{

c.tuso = a.tuso / UCLN(a.tuso, a.mauso);

c.mauso = a.mauso / UCLN(a.tuso, a.mauso);

return c;

}

void main()

{ int i,n;

phanso m[100];

printf("

Nhap n:"); scanf("%d",&n);

printf("

Nhap cac tuso va mauso:

");

for(i=0;i<n;i++)

{ printf("m[%d]:",i);

scanf("%d%d",&m[i].tuso,&m[i].mauso);

}

c.tuso=m[0].tuso;

c.mauso=m[0].mauso;

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

{ c.tuso = c.tuso * m[i].mauso + c.mauso * m[i].tuso;

c.mauso = c.mauso * m[i].mauso;

c=uocluoc(c);

}

printf("

Tong cac phan so sau khi gian luoc: %d/%d",c.tuso,c.mauso);

getch();

}

.....................................

/*Viet ham nhan 1 mang so nguyen, tra ve so luong so chinh phuong so trong mang da nhan*/

#include <conio.h>

#include <stdio.h>

#include <math.h>

void chinhphuong(int a[])

{ int i,j,*ps,*pe,n,b;

float k,m;

j=0;

ps=a;

pe=ps;

while(*pe) pe++;

n=pe-ps;

for(i=0;i<n;i++)

{ k=a[i];

m=sqrt(k);

b=m;

k=m-b;

if(k==0) j++;

}

printf("

So luong so chinh phuong co trong mang:%d",j);

}

void main()

{ int a[100],i,n;

clrscr();

printf("

Nhap n:"); scanf("%d",&n);

for(i=0;i<n;i++)

{ printf("a[%d]=",i);

scanf("%d",&a[i]);

}

chinhphuong(a);

getch();

}

.............................

//Nhap 1 day n so nguyen duong(n cung nhap tu ban phim)

//Xuat ra cac so nguyen to trong day nay.

#include<stdio.h>

#include<conio.h>

void main()

{ int i,j,n,x,m;

int a[100];

m=-1;

j=0;

printf("

Nhap n:"); scanf("%d",&n);

for(i=0;i<n;i++)

{ printf("a[%d]=",i);

scanf("%d",&a[i]);

}

for(i=0;i<n;i++)

{ if(a[i]>1)

{ x=a[i]-1;

while(a[i]%x!=0) x--;

if(x==1)

{ a[j]=a[i];

m++;

j++;

}

}

}

if(m>=0)

{ printf("

So nguyen to cua day:

");

for(i=0;i<j;i++)

printf("%d\t",a[i]);

}

else printf("

Day khong co so nguyen to:");

getch();

}

............................

//Nhap 1 day n so nguyen duong(n cung nhap tu ban phim)

//In ra gia tri UCLN cua day nay.

#include<stdio.h>

#include<conio.h>

void main()

{ int i,j,UCLN,n;

int a[100];

printf("

Nhap n:"); scanf("%d",&n);

for(i=0;i<n;i++)

{ printf("a[%d]=",i);

scanf("%d",&a[i]);

}

UCLN=a[0];

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

if(UCLN>a[i]) UCLN=a[i];

for(i=0;i<n-1;i++)

{ while(a[i]%UCLN!=0) UCLN--;

}

printf("

UCLN=%d",UCLN);

getch();

}

.............................

/* Nhap n Phan so, n nhap tu ban phim

Tinh tong cac phan so, in ra dang toi gian cua phan so*/

#include <stdio.h>

#include <conio.h>

typedef struct {int tuso, mauso;

} phanso;

phanso c;

int UCLN(int a, int b)

{ int y;

a= a>=0?a:-a;

b= b>=0?b:-b;

if(a>b) y=b;

else y=a;

while((a % y!=0)||(b % y!=0)) y--;

return y;

}

phanso uocluoc(phanso a)

{

c.tuso = a.tuso / UCLN(a.tuso, a.mauso);

c.mauso = a.mauso / UCLN(a.tuso, a.mauso);

return c;

}

void main()

{ int i,n;

phanso m[100];

printf("

Nhap n:"); scanf("%d",&n);

printf("

Nhap cac tuso va mauso:

");

for(i=0;i<n;i++)

{ printf("m[%d]:",i);

scanf("%d%d",&m[i].tuso,&m[i].mauso);

}

c.tuso=m[0].tuso;

c.mauso=m[0].mauso;

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

{ c.tuso = c.tuso * m[i].mauso + c.mauso * m[i].tuso;

c.mauso = c.mauso * m[i].mauso;

c=uocluoc(c);

}

printf("

Tong cac phan so sau khi gian luoc: %d/%d",c.tuso,c.mauso);

getch();

}

...............................

//In ra cac so thuoc day nay thoa t/c so bang

//tong lap phuong cac gia tri chu so tao thanh no.

#include<stdio.h>

#include<conio.h>

void main()

{ int i,j,n,m,k,t;

int a[100],b[10];

printf("

Nhap n:"); scanf("%d",&n);

printf("

Nhap cac so nguyen duong:

");

for(i=0;i<n;i++)

{ printf("a[%d]=",i);

scanf("%d",&a[i]);

}

printf("

Cac so thoa tinh chat so=tong lap phuong cac gt chu so tao thanh no:

");

for(i=0;i<n;i++)

{ k=b[0]=a[i]; t=j=m=0;

while(k>9)

{ b[j]=k%10;

k=k/10;

j++; m++;

if(k<10) b[j]=k;

}

for(j=0;j<=m;j++)

t=t+b[j]*b[j]*b[j];

if (a[i]==t) printf("%d\t",a[i]);

}

getch();

}

.............................

Bạn đang đọc truyện trên: Truyen2U.Top