XXXX by fdgerf

153

16521685 — 2016-11-30 08:14:24 UTC

int channhonhat(int a[], int n)

{

int chanmin = chandau(a, n);

if (chanmin == -1) return 0;

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

{

if (a[i] % 2 == 0 && a[i] < chanmin)

{

a[i] = chanmin;

}

}

return chanmin;

}

152

16521685 — 2016-11-30 15:27:35 UTC

int hoanthiennhonhat(int *a, int n)

{

int hoanthienmin = hoanthiendau(a, n);

if (hoanthienmin == -1) return 0;

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

{

if (kiemtrahoanthien(a[i])==1 && a[i]
{

a[i] = hoanthienmin;

}

}

return hoanthienmin;

}

156

2016-12-01 03:49:37 UTC

void TaoMang(float a[], int n, float b[], int x)

{

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

{

b[i] = abs(x - a[i]);

}

}

float TimMin(float b[], int n)

{

float Min = b[0];

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

{

if (b[i] < Min)

{

Min = b[i];

}

}

return Min;

}

void XuatKetQua(float a[], float b[], int n)

{

std::cout<<"\nGia tri trong mang gan gia tri x nhat la: ";

float Min = TimMin(b, n);

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

{

if (b[i] == Min)

{

std::cout<
}

}

}

157

2016-12-01 03:54:08 UTC

void timdoan(float a[], int n)
{
float max = a[0];
float min = a[0];
for (int i = 0; i < n; i++)
{
max = (a[i] > max) ? a[i] : max;
min = (a[i] < min) ? a[i] : min;
}
std::cout<<"\n["<}

267

2016-12-01 03:54:12 UTC

void nhap (int *a, int &n)
{
do
{
cout<<"\nNhap so phan tu: ";
cin< if(n <= 0 || n > MAX)
{
cout<<"\nnhap lai";
cin>>n;
}
}while(n <= 0 || n > MAX);
for(int i = 0; i < n; i++)
{
cout<<"\na["< cin>>a[i];
for(int j = 0; j < i; j++)
{
if(a[i] > a[j])
{
int temp = a[i];
for(int k = i; k > j; k--)
{
a[k] = a[k - 1];
}
a[j] = temp;
}
}
}
}

158

2016-12-01 03:56:56 UTC

float timx(float a[], int n)
{
float x = a[0];
for (int i = 1; i < n; i++)
{
x = (x >(fabs)(a[i])) ? x : (fabs)(a[i]);
}
return x;
}

159

2016-12-01 03:59:53 UTC

float dautien(float a[], int n)
{
for (int i = 0; i < n; i++)
{
if (a[i] > 2003)
{
return a[i];
}
}
return 0;
}

160

2016-12-01 04:02:49 UTC

float TimAmCuoiCung(float a[], int n)
{
for (int i = n - 1; i >= 0; i--)
{
if (a[i] > -1 && a[i] < 0)
{
return a[i];
}
}
return 0;
}

161

2016-12-01 04:05:58 UTC

int dautientrongdoan(int a[], int n, int x, int y)
{
int dem = 0;
int i;
for (i = 0; i < n; i++)
{
if (a[i] >= x && a[i] <= y)
{
dem++;
break;
}
}
if (dem == 0)
{
return x;
}
return a[i];
}

176

2016-12-01 04:08:46 UTC

void LietKeCacSoAm(float a[], int n)
{
std::cout<<"\nCac so am trong mang la: ";
for (int i = 0; i < n; i++)
{
if (a[i] < 0)
{
std::cout << a[i] << " ";
}
}
}

177

2016-12-01 04:11:44 UTC

void LietKeTrongDoanXY(float a[], int n, float x, float y)
{
for (int i = 0; i < n; i++)
{
if (x <= a[i] && a[i] <= y)
{
std::cout< }
}
}

178

2016-12-01 04:13:16 UTC

void LietKeChanTrongDoanXY(int a[], int n, int x, int y)
{
for (int i = 0; i < n; i++)
{
if (a[i] % 2 == 0 && x <= a[i] && a[i] <= y)
{
std::cout<< a[i]<<" ";
}
}
}

179

2016-12-01 04:16:22 UTC

void LietKe(int a[], int n)
{
int flag = 0;
for (int i = 0; i < n; i++)
{
if (a[i] > abs(a[i + 1]))
{
flag = 1;
std::cout << a[i] << " ";
}
}
if (flag == 0)
std::cout<<"Mang ko co gia tri do";
}

180

2016-12-01 04:18:00 UTC

void LietKe(int a[], int n)
{
int flag = 0;
for (int i = 0; i < n; i++)
{
if (a[i] > abs(a[i - 1]) && a[i] < abs(a[i + 1]))
{
flag = 1;
std::cout << a[i] << " ";
}
}
if (flag == 0)
std::cout<<"Mang ko co gia tri do";
}

200

2016-12-01 04:19:06 UTC

int TinhTong(int a[], int n)
{
	int tong = 0;
	for(int i = 0; i < n; i++)
	{
		tong += a[i];
	}
	return tong;
}

201

2016-12-01 04:20:05 UTC


float tinhtongcacphanduong(float a[], int n)
{
	int Tong = 0;
	for(int i = 0; i < n; i++)
	{
		if(a[i] > 0)
		{
			Tong += a[i];
		}
	}
	return Tong;
}

202

2016-12-01 04:22:23 UTC

int TimChuSoDauLe(int n)
{
int donvi;
n = abs(n);
while (n >= 10)
{
donvi = n % 10;
n /= 10;
}
if (n % 2 == 0)
{
return 0;
}
return 1;
}

int TinhTongCacSoChuSoDauLe(int a[], int n)
{
int Tong = 0;
for (int i = 0; i < n; i++)
{
if (TimChuSoDauLe(a[i]) == 1)
{
Tong += a[i];
}
}
return Tong;
}

203

2016-12-01 04:25:29 UTC

int TimSoHangChuc5(int n)
{
n = abs(n);
n = n / 10;
int hangchuc = n % 10;
if (hangchuc == 5)
{
return 1;
}
return 0;
}

int TinhTongSoHangChuc5(int a[], int n)
{
int Tong = 0;
for (int i = 0; i < n; i++)
{
if (TimSoHangChuc5(a[i]) == 1)
{
Tong += a[i];
}
}
return Tong;
}

204

2016-12-01 04:41:32 UTC

int tongcacphantulonhondungtruocno(int a[], int n)
{
int Tong = 0;
for (int i = 1; i < n; i++)
{
if (a[i] > a[i - 1])
{
Tong += a[i];
}
}
return Tong;
}

205

2016-12-01 05:05:34 UTC

int TinhTongCacPhanTuLonHonTriTuyetDoiCuaPhanTuDungLienSauNo(int a[], int n)
{
	int Tong = 0;
	for(int i = 0; i < n; i++)
	{
		if(a[i] > abs(a[i + 1]))
		{
			Tong += a[i];
		}
	}
	return Tong;
}

206

2016-12-01 05:06:34 UTC

int TinhTongCacPhanTuLonHonPhanTuXungQuanh(int a[], int n)
{
int Tong = 0;
for (int i = 0; i < n; i++)
{
if (i == 0 && a[i] > a[i + 1])
{
Tong += a[i];
}
else if (i != 0 && a[i] > a[i + 1] && a[i] > a[i - 1])
{
Tong += a[i];
}
else if (i == n - 1 && a[i] > a[i - 1])
{
Tong += a[i];
}
}
return Tong;
}

207

2016-12-01 05:08:39 UTC

int TinhTongCacPhanTuCucTri(int a[], int n) { int Tong = 0; for(int i = 0; i < n; i++) { if(i == 0 && a[i] != a[i + 1])

{
Tong += a[i];
}
else if(i == n - 1 && a[i] != a[i - 1])
{
Tong += a[i];
}
else if((a[i] < a[i + 1] && a[i] < a[i - 1]) || (a[i] > a[i + 1] && a[i] > a[i - 1])) { Tong += a[i]; } } return Tong; }

208

2016-12-01 05:09:31 UTC

int KiemTraChinhPhuong(int n)
{
	return sqrt((float)n) == (int)sqrt((float)n);
}

int TinhTongCacSoChinhPhuong(int a[], int n)
{
	int Tong = 0;
	for(int i = 0; i < n; i++)
	{
		if(KiemTraChinhPhuong(a[i]) == 1)
		{
			Tong += a[i];
		}
	}
	return Tong;
}

209

2016-12-01 05:10:56 UTC

int KiemTraDoiXung(int n)
{
	int donvi, tam = n;
	int sodaonguoc = 0;
	while(tam != 0)
	{
		donvi = tam % 10;
		sodaonguoc = sodaonguoc * 10 + donvi;
		tam /= 10;
	}
	if(sodaonguoc == n)
	{
		return 1;
	}
	return 0;
}

int TongCacSoDoiXung(int a[], int n)
{
	int Tong = 0;
	for(int i = 0; i < n; i++)
	{
		if(KiemTraDoiXung(a[i]) == 1)
		{
			Tong += a[i];
		}
	}
	return Tong;
}

210

2016-12-01 05:11:43 UTC


int KiemTraChuSoDauChan(int n)
{
	while(n >= 10)
	{
		n /= 10;
	}
	if(n % 2 == 0)
	{
		return 1;
	}
	return 0;
}

int TinhTongCacSoChuSoDauChan(int a[], int n)
{
	int Tong = 0;
	for(int i = 0; i < n; i++)
	{
		if(KiemTraChuSoDauChan(a[i]) == 1)
		{
			Tong += a[i];
		}
	}
	return Tong;
}

211

2016-12-01 05:12:58 UTC

float TinhTBCongNguyenTo(int a[], int n)

{

int Tong = 0;

float dem = 0;

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

{

if (Ngto(a[i]) == 1)

{

Tong += a[i];

dem++;

}

}

if (dem == 0)

{

std::cout<<"\nMang khong co so nguyen to";

return 0;

}

return Tong / dem;

}

269

2016-12-01 08:21:55 UTC

void chẽ_x_vao_mang_tang(int a[], int &n, int x)
{
	int i, j;
	for(i = 0; i < n; i++)
	{
		if(x < a[i])
		{
			int temp = x;
			for(j = n; j > i; j--)
			{
				a[j] = a[j - 1];
			}
			a[i] = temp;
		}
	}
	n++;
}

271

2016-12-01 08:25:23 UTC

void xoaphantu(int *a, int &n, int vitrixoa)
{
do{
cout<<"\nNhap vi tri xoa: ";
cin>>n;

if(vitrixoa < 0 || vitrixoa >= n)
{
cout<<"nhap lai";
cin>>vi
}
}while(vitrixoa < 0 || vitrixoa >= n);
for(int i = ViTriXoa; i < n; i++)
{
a[i] = a[i + 1];
}
n- -;
}

273

2016-12-01 08:33:12 UTC

void xoacacsoam(int a, int &n)
{
	for(int i = 0; i < n; i++)
	{
		if(a[i] < 0)
		{
			xoaphantu(a, n, i);
			i--;
		}
	}
}

274

2016-12-01 08:34:47 UTC

void xoacasochan(int a[], int &n)
{
	for(int i = 0; i < n; i++)
	{
		if(a[i] % 2 == 0)
		{
			xoaphantu(a, n, i);
			i--;
		}
	}
}

278

2016-12-01 08:38:48 UTC

void xoacacphantutrungnhau(int a, int &n)
{
	for(int i = 0; i < n; i++)
	{
		for(int j = i + 1; j < n; j++)
		{
			if(a[i] == a[j])
			{
				xoaphantu(a, n, j);
				j--;
			}
		}
	}
}

266

2016-12-01 08:44:53 UTC

void themphantu(int *a, int &n, int vitri, int k)
{
do
{
cout<<"nhap vi tri can them"<"< cin>>n;
if (vitri <0|| vitri>n)
cout<<"nhap lai";
cin>>n;
}while (vitri<0 || vitri>n)
cout<<"nhap vi tri va k";
cin>>vitri>>k;
n++
for (int i=n;i>vitri;i--)
a[i]=a[i-1];
a[vitri]=k;
}

255

2016-12-01 08:48:36 UTC

void hoanvi(int &a, int &b)

{

int temp=a;

a=b;

b=temp;

}

void giamdan(int *a; int &n)

{

for(int i=0;i
for (int j=i+1;j
if (a[i]
hoanvi(a[i],a[j])

}

256

2016-12-01 08:52:21 UTC

void tangdan(int *a; int &n)

{

for(int i=0;i
for(int j=i+1;i
if (a[i]>a[j])

hoanvi(a[i], a[j])

}

257

2016-12-01 08:56:58 UTC

void vitriletangdan(int *a, int &n)
{
for (int i=0;i if(a[i]%2!=0)
for(int j=i+1;j if a[i]%2!=0 && a[i]>a[j]
hoanvi(a[i],a[j])
}

261

2016-12-01 08:58:17 UTC

void vitriamtangdan(int *a, int &n)
{
for (int i=0;i if(a[i]<0)
for(int j=i+1;j if a[i]<0 && a[i]>a[j]
hoanvi(a[i],a[j])
}2

260

2016-12-01 09:04:34 UTC

void kiemtrahoanvi(int *a, int *b, int na; int nb)
{
if(na!=nb)
cout<<"khong phai";
tangdan(a,na);
tangdan(b;nb);
for (int i=0;i {
if (a[i]!=b[i])
cout<<"khong phai";
}
cout<<"phai";
}

129

2016-12-01 09:54:26 UTC

void nhap(int a[], int &n)
{
do
{
cout<<"\nNhap so phan tu: ";
cin >> n;
if (n <= 0 || n > 1000)
{
cout<<"\nSo phan tu khong hop le. Xin kiem tra lai !";
}
} while (n <= 0 || n > 1000);
for (int i = 0; i < n; i++)
{
cout << "Nhap a[" << i << "]: ";
cin >> a[i];
}
}

128

2016-12-01 09:55:40 UTC

void nhap(float a[], int &n)
{
do
{
cout<<"\nNhap so phan tu: ";
cin >> n;
if (n <= 0 || n > 1000)
{
cout<<"\nSo phan tu khong hop le. Xin kiem tra lai !";
}
} while (n <= 0 || n > 1000);
for (int i = 0; i < n; i++)
{
cout << "Nhap a[" << i << "]: ";
cin >> a[i];
}
}

130

2016-12-01 09:56:44 UTC

void xuat(float *a, int n)
{
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
}

131

2016-12-01 09:57:32 UTC

void xuat(int *a, int n)
{
for (int i = 0; i < n; i++)
{
cout << a[i] << " ";
}
}

134

2016-12-01 10:01:17 UTC

float lonnhat(float *a, int n)
{
float ln = a[0];
for (int i = 0; i < n;i++)
if (a[i]>ln) ln = a[i];
return ln;
}

135

2016-12-01 10:04:36 UTC

float duongdautien(float *a, int n)
{
for (int i = 0; i < n; i++)
if (a[i]>0) return a[i];
return -1;
}

136

2016-12-01 10:07:46 UTC

int timchancuoi(int *a, int n)
{
for (int i = n - 1; i >= 0; i--)
if (a[i] % 2 == 0) return a[i];
return -1;
}

137

2016-12-01 10:12:36 UTC

int vtnhonhat(float *a, int n)
{
int vtnhonhat = 0;
for (int i = 0; i < n; i++)
if (a[i] < a[vtnhonhat]) vtnhonhat = i;
return vtnhonhat;
}

138

2016-12-01 10:15:58 UTC

int vtchandau(int *a, int n)
{
for (int i = 0; i < n;i++)
if (a[i] % 2 == 0) return i;
return -1;
}

139

2016-12-01 10:22:25 UTC

bool kiemtrahoanthien(int n)
{
int i = 1; int s = 0;
while (i < n)
{
if (n%i == 0) s = s + i;
i++;
}
if (s == n)return true;
return false;
}
int vthoanthiencuoi(int *a, int n)
{
for (int i = n - 1; i >= 0;i--)
if (kiemtrahoanthien(a[i]) == true) return i;
return -1;
}

140

2016-12-01 11:23:10 UTC

float duongnhonhat(float *a, int n)
{
float duongnhonhat = duongdautien(a, n);
if (duongnhonhat == -1) return -1;
for (int i = 0; i < n; i++)
{
if (a[i]>0 && a[i] < duongnhonhat) duongnhonhat = a[i];
}
return duongnhonhat;
}

141

2016-12-01 11:23:48 UTC

int vtduongnhonhat(float *a, int n)
{
int i, min, dem = 0;
for (i = 0; i < n; i++)
{
if (a[i]>0)
{
dem++;
min = i;
break;
}
}
if (dem == 0) return -1;
for (i = i + 1; i < n;i++)
if ((a[i]>0) && (a[i] < a[min])) min = i;
return min;
}

142

2016-12-01 11:24:47 UTC

float nhonhat(float *a, int n)
{
float min = a[0];
for (int i = 1; i < n; i++)
{
if (a[i] < min) min = a[i];
}
return min;
}

143

2016-12-01 11:25:53 UTC

int chandau(int *a, int n)
{
for (int i = 0; i < n; i++)
if (a[i] % 2 == 0) return a[i];
return -1;
}

144

2016-12-01 11:27:22 UTC

bool Ngto(int n)
{
if (n < 2) return false;
if (n>2)
{
if (n % 2 == 0) return false;
for (int i = 3; i < n; i += 2)
{
if (n%i == 0) return false;
}
}
return true;
}
int nguyentodau(int *a, int n)
{
for (int i = 0; i < n; i++)
if (Ngto(a[i]) == true) return a[i];
return -1;
}

145

2016-12-01 11:29:28 UTC

int hoanthiendau(int *a, int n)
{
for (int i = 0; i < n; i++)
{
if (kiemtrahoanthien(a[i]) == true) return a[i];
}
return -1;
}

216

16521685 — 2016-12-01 11:31:43 UTC

int DemSoChan(int A[], int &n)
{
int dem = 0;
for (int i = 0; i < n; i++)
{
if (A[i] % 2 == 0)
{
dem++;
}
}
return dem;
}

146

2016-12-01 11:34:14 UTC

int amdau(int *a, int n)
{
for (int i = 0; i < n; i++)
{
if (a[i] < 0) return a[i];
}
return -1;
}

147

2016-12-01 11:34:55 UTC

float duongcuoi(float *a, int n)
{
for (int i = n - 1; i >= 0; i--)
if (a[i]>0) return a[i];
return -1;
}

148

2016-12-01 11:35:18 UTC

int nguyentocuoi(int *a, int n)
{
for (int i = n - 1; i >= 0; i--)
{
if (Ngto(a[i]) == true) return a[i];
}
return -1;
}

217

16521685 — 2016-12-01 11:35:38 UTC

int demchiahetbay(int A[], int &n) {
int dem = 0;
for (int i = 0; i < n; i++) {
if (A[i] < 0 && A[i] % 7 == 0) {
dem++;
}
}
return dem;
}

149

2016-12-01 11:35:48 UTC

int hoanthiencuoi(int *a, int n)
{
for (int i = n - 1; i >= 0;i--)
if (kiemtrahoanthien(a[i]) == true) return a[i];
return -1;
}

150

2016-12-01 11:36:06 UTC

float amlonnhat(float *a, int n)
{
float ammax = amdau(a, n);
if (ammax == -1) return 0;
for (int i = 0; i < n; i++)
{
if (a[i]<0 && a[i]> ammax) ammax = a[i];
}
return ammax;
}

219

16521685 — 2016-12-01 11:36:19 UTC

int tansuat(float A[], int n,int &x) {
int dem = 0;
cout << "\n Nhap vao gia tri ma ban can tim: ";
cin >> x;
for (int i = 0; i < n; i++) {
if (A[i] ==x) {
dem++;
}
}
return dem;
}

151

2016-12-01 11:36:23 UTC

int nguyentolonnhat(int *a, int n)
{
int nguyentomax = nguyentodau(a, n);
if (nguyentomax == -1) return 0;
for (int i = 0; i < n;i++)
if (Ngto(a[i]) == true && Ngto(a[i])> nguyentomax)
nguyentomax = a[i];
return nguyentomax;
}

154

2016-12-01 11:36:37 UTC

float vtamlonnhat(float *a, int n)
{
float ammax = amdau(a, n); int k=-1;
for (int i = 0; i < n; i++)
{
if (a[i]<0 && a[i]> ammax)
k = i;
}
if (k == -1) return -1;
return k;
}

155

2016-12-01 11:36:57 UTC

float xanhat(float *a, int n)
{
float x;
cout << "Nhap gia tri can tinh : ";
cin >> x;
float xanhat = a[0] - x;
for (int i = 0; i < n; i++)
if ((a[i] - x)> xanhat) xanhat = a[i] - x;
return xanhat + x;
}

220

16521685 — 2016-12-01 11:37:34 UTC

int tancung5(int A[], int &n) {
int dem = 0;
for (int i = 0; i < n; i++) {
if (A[i] % 10 == 5) {
dem++;
}
}
return dem;
}

222

16521685 — 2016-12-01 11:38:38 UTC

int DemCucTri(int A[], int n)

{

int dem = 0;

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

{

if (i == 0 && A[i] != A[i + 1])

{

dem++;

}

else if (i == n - 1 && A[i - 1] != A[i])

{

dem++;

}

else if ((A[i - 1] > A[i] && A[i] < A[i + 1]) || (A[i - 1] < A[i] && A[i] > A[i + 1]))

{

dem++;

}

}

return dem;

}

223

16521685 — 2016-12-01 11:39:46 UTC

int DemSoNguyenTo(int A[], int n)
{
int dem = 0;
for (int i = 0; i < n; i++)
{
if (Ngto(A[i]) == 1)
{
dem++;
}
}
return dem;
}

225

16521685 — 2016-12-01 11:40:29 UTC

int DemSoLuongGiaTriLonNhat(float A[], int n)
{
int dem = 0;
int max = A[0];
for (int i = 0; i < n; i++)
{
if (max == A[i])
{
dem++;
}
else if (A[i] > max)
{
max = A[i];
dem = 1;
}
}
return dem;
}

226

16521685 — 2016-12-01 11:41:06 UTC

int DemKeChan(int A[], int n)

{

int dem = 0;

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

{

if (A[i] % 2 == 0 && A[i + 1] % 2 == 0)

{

dem++;

}

}

if (dem != 0)

{

dem++;

}

return dem;

}

227

16521685 — 2016-12-01 11:41:44 UTC

int DemTraiDau(int A[], int n)

{

int dem = 0;

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

{

if (A[i] * A[i + 1] < 0)

{

dem++;

}

}

if (dem != 0)

{

dem++;

}

return dem;

}

230

16521685 — 2016-12-01 11:42:21 UTC

void LietKeTanSuatXuatHien(int A[], int n)
{
for (int i = 0; i < n; i++)
{
int dem = 0;
for (int j = 0; j < n; j++)
{
if (A[i] == A[j])
{
if (i <= j)
{
dem++;
}
else
{
break;
}
}
}
if (dem != 0)
{
cout << "\n Gia tri " << A[i] << " xuat hien " << dem << " lan.\n";
}
}
}

231

16521685 — 2016-12-01 11:44:37 UTC

int KiemTraBiTrung(int A[], int n, int ViTri)
{
for (int i = ViTri - 1; i >= 0; i--)
{
if (A[i] == A[ViTri])
{
return 0;
}
}
return 1;
}

int DemSoLuongPhanTuTrung(int A [], int n, int ViTri)
{
int dem = 1;
for (int i = ViTri + 1; i < n; i++)
{
if (A[i] == A[ViTri])
{
dem++;
}
}
return dem;
}

void LietKeCacGiaTriXuatHienDung1Lan(int A [], int n)
{
for (int i = 0; i < n; i++)
{
int CheckTrung = KiemTraBiTrung(A, n, i);
if (CheckTrung == 1)
{
int dem = DemSoLuongPhanTuTrung(A, n, i);
if (dem == 1)
{
cout << "\nCac phan tu xuat hien dung 1 lan la: " << A[i];
}
}
}
}

232

16521685 — 2016-12-01 11:45:29 UTC

void LietKeCacGiaTriXuatHienQua1Lan(int A[], int n)

{

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

{

int CheckTrung = KiemTraBiTrung(A, n, i);

if (CheckTrung == 1)

{

int dem = DemSoLuongPhanTuTrung(A, n, i);

if (dem != 1)

{

cout << "\nCac phan tu xuat hien qua 1 lan la: " << A[i];

}

}

}

}

280

2016-12-01 12:03:02 UTC

void motvedau(int *mang, const int n) {
int vt = 0;
if (mang[0] == 1) vt++;
for (int i = 1; i < n; i++) {
if (mang[i] == 1) if (vt == i) { vt++; }
else { mang[i] = mang[vt]; mang[vt] = 1; vt++; }
}
}

281

2016-12-01 12:03:28 UTC

void chandaulecuoi(int *mang, const int n) {
int vt = 0;
int temp;
if (mang[0] % 2 == 0) vt++;
for (int i = 1; i < n; i++) {
if (mang[i] % 2 == 0) {
if (vt == i) { vt++; }
else {
temp = mang[i];
mang[i] = mang[vt];
mang[vt] = temp;
vt++;
}
}
}
if (mang[vt] == 0) vt++;
for (int i = vt; i < n; i++) {
if (mang[i] == 0) {
if (vt == i) { vt++; }
else {
temp = mang[i];
mang[i] = mang[vt];
mang[vt] = temp;
vt++;
}
}
}
}

282

2016-12-01 12:04:02 UTC

void chiahetchoba(int *mang, const int n) {
int vt = 0;
if (mang[0] % 3 == 0) vt++;
for (int i = 1; i < n; i++) {
if (mang[i] % 3 == 0) {
if (vt == i) { vt++; }
else { mang[i] = mang[vt]; mang[vt] = 1; vt++; }
}
}
}

284

2016-12-01 12:05:32 UTC

void daochan(int *mang, const int n) {
int temp;
for (int i = 0; i < n / 2; i++) {
if (mang[i] % 2 == 0 || mang[n - 1 - i] % 2 == 0) {
temp = mang[i];
mang[i] = mang[n - i - 1];
mang[n - i - 1] = temp;
}
}
}

283

2016-12-01 12:12:42 UTC

void daomang(int *mang, const int n) {
int temp;
for (int i = 0; i < n / 2; i++) {
temp = mang[i];
mang[i] = mang[n - i - 1];
mang[n - i - 1] = temp;
}
}

286

2016-12-01 12:24:13 UTC

void dichtrai(int *mang, const int n, int k) {
int temp;
for (int j = 1; j <= k;j++) {
temp = mang[0];
for (int i = 1; i < n; i++) {
temp = mang[i];
mang[i] = mang[i-1];
mang[i-1] = temp;
}
mang[n - 1] = temp;
}
}

287

2016-12-01 12:24:31 UTC

void dichphai(int *mang, const int n, int k) {
int temp;
for (int j = 1; j <= k;j++) {
temp = mang[n-1];
for (int i = 0; i < n-1; i++) {
temp = mang[i];
mang[i] = mang[i+1];
mang[i+1] = temp;
}
mang[0] = temp;
}
}

293

2016-12-01 13:01:32 UTC

void lietkecon(int *a, int n)
{
int ChieuDai;
for (int i = 0; i {
for (ChieuDai = 1 + i; ChieuDai <= n; ChieuDai++)
{
for (int j = i; j {
cout << a[j];
}
cout << "\n";
}
}
}

294

2016-12-01 13:02:13 UTC

void conlonhonhai(int *a, int n)
{
	int ChieuDai;
	for (int i = 0; i < n; i++)
	{
		for (ChieuDai = 3 + i; ChieuDai <= n; ChieuDai++)
		{
			for (int j = i; j < ChieuDai; j++)
			{
				cout << a[j];
			}
			cout << "\n";
		}
	}
}

295

2016-12-01 13:17:05 UTC

bool kiemtramangtang(int *b, int nb)
{
	for(int i=0; iif (b[i]>b[i+1])
			return false;
	}
	return true;
}

void lietkecontang(int *a, int n)
{
	int ChieuDai;
	int b[100], nb;
	for (int i=0; ifor (ChieuDai = 1+i; ChieuDai<=n; ChieuDai++)
		{
			nb=0;
			for(int j=i; jif (kiemtramangtang(b,nb)==1)
			{
				xuatmang(b,nb);
			}
		}
	}
}

301

2016-12-01 13:22:16 UTC

bool kiemtramangcon(int *a, int *b, int n, int m)
{
	int i,j,test = false;
	for (i=0; iif (b[i]==a[0])
		{
			int h = i;
			for (test=true, j=0; jif (a[j] != b[h])
				{
					test = false;
					break;
				}
			}
			if (test == true)
				return test;      
		}
	}
	return test;
}

302

2016-12-01 13:23:36 UTC

int Dem(int *a, int *b, int n, int m)
{
	int i,j,test,dem=0;
	for (i=0; iif (b[i]==a[0])
		{
			int h = i;
			for (test=1, j=0; jif (a[j] != b[h])
				{
					test = 0;
					break;
				}
			}
			if (test == 1)
				dem++;
		}
	}
	return dem;
}

240

16521685 — 2016-12-01 13:37:31 UTC

int KiemTraCoGiaTri0(int A [], int n)
{
int kt = 0;
for (int i = 0; i < n; i++)
{
if (A[i] == 0)
{
kt = 1;
}
}
return kt;
}

241

16521685 — 2016-12-01 13:38:41 UTC

int KiemTraCo2GiaTri0LienTiep(int A[], int n)
{
int kt = 0;
for (int i = 0; i < n; i++)
{
if (A[i] == 0 && A[i + 1] == 0)
{
kt = 1;
break;
}
}
return kt;
}

242

16521685 — 2016-12-01 13:39:11 UTC

int KiemTraCoSoChan(int A[], int n)
{
int kt = 0;
for (int i = 0; i < n; i++)
{
if (A[i] % 2 == 0)
{
kt = 1;
break;
}
}
return kt;
}

243

16521685 — 2016-12-01 13:39:38 UTC

int KiemTraNguyenTo(int n)
{
if (n < 2)
{
return 0;
}
else if (n > 2)
{
if (n % 2 == 0)
{
return 0;
}
for (int i = 3; i <= sqrt((float)n); i += 2)
{
if (n % i == 0)
{
return 0;
}
}
}
return 1;

}
int KiemTraMangCoSoNguyenTo(int A[], int n)
{
int kt = 0;
for (int i = 0; i < n; i++)
{
if (KiemTraNguyenTo(A[i]) == 1)
{
kt = 1;
}
}
return kt;
}

245

16521685 — 2016-12-01 13:40:08 UTC

int KiemTraToanChan(int A[], int n)
{
int kt = 1;
for (int i = 0; i < n; i++)
{
if (A[i] % 2 != 0)
{
kt = 0;
break;
}
}
return kt;
}

248

16521685 — 2016-12-01 13:41:30 UTC

int KiemTraTangDan(int A[], int n)
{
int kt = 1;
for (int i = 0; i < n - 1; i++)
{
if (A[i] > A[i + 1])
{
kt = 0;
break;
}
}
return kt;
}

249

16521685 — 2016-12-01 13:42:00 UTC

int KiemTraGiamDan(int A[], int n)
{
int kt = 1;
for (int i = 0; i < n - 1; i++)
{
if (A[i] < A[i + 1])
{
kt= 0;
break;
}
}
return kt;
}

251

16521685 — 2016-12-01 13:42:32 UTC

int KiemTraBangNhau(int A[], int n)
{
int kt = 0;
for (int i = 0; i < n - 1; i++)
{
for (int j = i + 1; j < n; j++)
{
if (A[i] == A[j])
{
kt = 1;
break;
}
}
}
return kt;
}

218

2016-12-01 16:28:01 UTC

int DemDoiXung(int a[], int n)
{
	int dem = 0;
	for(int i = 0; i < n; i++)
	{
		if(a[i] < 0)
		{
			break;
		}
		if(KiemTraDoiXung(a[i]) == 1)
		{
			dem++;
		}
	}
	return dem;
}