int main()
{
    int a[50], n;

    NhapMang(a, &n);
    XuatMang(a,n);
    XoaSoNguyenTo(a,&n);
    XuatMang(a, n);

    return 0;
}
int main()
{
    int a[50], n;

    NhapMang(a, &n);
    XuatMang(a,n);
    XoayMang(a,n);
    XuatMang(a,n);

    return 0;
}
Пример #3
0
void BaiLam_v2(int a[], int na)
{
	int *b = NULL;
	int nb = 0;

	int i;

	for (i = 0; i < na; i++)
		if (a[i] % 2 != 0)
			nb++;

	b = (int*)malloc(nb * sizeof(int));

	nb = 0;
	for (i = 0; i < na; i++)
		if (a[i] % 2 != 0)
			b[nb++] = a[i];

	printf("\nMang b la: \n");
	XuatMang(b, nb);

	free(b);
	b = NULL;
	nb = 0;
}
Пример #4
0
int main()
{
	int b[MAXD][MAXC] = {
		{1,2,3},
		{4,5,6},
		{7,8,9}
	};
	int d=3, c=3, d1=0, d2=2;
	int t[] = {8,9,10}, k = 1;

	XuatMang(b, d, c);
	ChenDong(b, d, c, k, t);
	XuatMang(b, d, c);

	return 0;
}
int main()
{
    int a[50], n;

    NhapMang(a, &n);
    XuatMang(a, n);
    KiemTra(a, n);

    return 0;
}
int main()
{
    int a[100], n;

    NhapMang(a, &n);
    XuatMang(a,  n);
    TimMax(a, n);

    return 0;
}
int main()
{
    int a[50], n;

    NhapMang(a, &n);
    XuatMang(a, n);
    TinhTong(a, n);

    return 0;
}
Пример #8
0
void ChepDong(int a[][MAXC],int nd,int nc, int k, int b[])
{
	for(int ic=0;ic<=nc-1;ic++)
	{
		a[k][ic] = b[ic];
#ifdef LOG
		XuatMang(a, nd, nc);
#endif
	}
}
Пример #9
0
int main ()
{
    int b[MAX];
    int n, vtmax, max;
    NhapMang(b,n);
    XuatMang(b,n);
    TimMax(b, n, vtmax, max);
    printf("vi tri %d chua phan tu lon nhat co gia tri %d.\n", vtmax, max);
    return 0;
}
Пример #10
0
int main()
{
	double b[MAXD][MAXC];
	int nd = 0, nc = 0;
	int am,duong,khong;
	NhapMang(b,nd,nc);
	XuatMang(b,nd,nc);
	DemDau(b,nd,nc,am,duong,khong);
	printf("Ma tran co %d so am, %d so duong va %d so khong.",am,duong,khong);
	return 0;
}
Пример #11
0
void ChenDong(int a[][MAXC],int &nd,int nc, int k, int b[])
{
#ifdef LOG
		XuatMang(a, nd+1, nc);
#endif
	for(int i=nd-1;i>=k;i--)
	{
		DoiDong(a, nd, nc, i, i+1); // a[i+1][] = a[i][]
#ifdef LOG
		XuatMang(a, nd+1, nc);
#endif
	}
	ChepDong(a, nd+1, nc, k, b); // a[k][] = b[];
#ifdef LOG
		XuatMang(a, nd, nc);
#endif
	nd++;
#ifdef LOG
		XuatMang(a, nd, nc);
#endif
}
Пример #12
0
int main()
{
	int *a = NULL, n;

	NhapMang(&a, &n);
	XuatMang(a, n);
	SoLanMax(a, n);

	free(a);
	a = NULL;
	
	getch();
	return 0;
}
Пример #13
0
int main()
{
	int a[20];
	int n = 0;
	int *p = NULL;

	NhapMang(a, &n);
	XuatMang(a, n);

	p = TimKiemSNT(a, n);
	printf("Dia chi ket qua: %d \n", p);

	_getch();
	return 0;
}
Пример #14
0
int main()
{
	int *a = NULL;
	int n = 0;

	NhapMang(&a, &n);

	printf("\nMang ban dau: \n");
	XuatMang(a, n);


	XoaPhanTuCuoiCung_cach1(&a, &n);


	printf("\nMang sau khi xoa phan tu cuoi cung: \n");
	XuatMang(a, n);


	free(a);
	a = NULL;

	_getch();
	return 0;
}
Пример #15
0
int main()
{
	int a[50], n, i, dem = 0,  *p = NULL;

	NhapMang(a, &n);
	XuatMang(a, n);

	//Xóa các SNT
	for(i = 0; i < n; i++)
	{
		if (TimKiemSNT(a, n) != NULL)
		{
			p = TimKiemSNT(a, n);
			*p = 0;
		}
	}
	
	printf("\nMang thay doi la: \n");
	for (i = 0; i < n; i++)
		printf("%4d", a[i]);

	_getch();
	return 0;
}