C code - 90 lines

Link:

C, pasted on Sep 26:

#include<stdio.h>
#include<conio.h>
#include<math.h>
#define MAX 100

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

void xuat(int a[], int n)
{
	for(int i = 0; i < n; i++)
	{
		printf("%4d", a[i]);
	}
}
// nguyên tố => true
bool KiemTraNguyenTo(int n)
{
	if (n < 2)
	{
		return false;
	}
	else if (n > 2)
	{
		if (n % 2 == 0)
		{
			return false;
		}
		for (int i = 3; i <= sqrt((float)n); i += 2)
		{
			if (n % i == 0)
			{
				return false;
			}
		}
	}
	return true;
}

int TimSoLonNhat(int a[], int n)
{
   int max = a[0];
   for(int i = 1; i < n; i++)
      max = (max > a[i]) ? max : a[i];
   return max;
}

int TimNguyenToNhoNhatLonHonMoiGiaTriTrongMang(int a[], int n)
{
	int max = TimSoLonNhat(a, n);
	int SoCanTim = max + 1;
	for(SoCanTim = max + 1;; SoCanTim++)
	{
		if(max < SoCanTim)
		{
			if(KiemTraNguyenTo(SoCanTim) == 1)
			break;
		}
	}
	return SoCanTim;
}
int main()
{
	int n;
	int a[MAX];

	nhap(a, n);
	xuat(a, n);

	int Kq = TimNguyenToNhoNhatLonHonMoiGiaTriTrongMang(a, n);
	printf("\nKet qua la %d", Kq);

	getch();
	return 0;
}

Output:

Line 17: error: conio.h: No such file or directory
Line 6: error: expected ';', ',' or ')' before '&' token
In function 'xuat':
Line 26: error: 'for' loop initial declaration used outside C99 mode
t.c: At top level:
Line 32: error: expected '=', ',', ';', 'asm' or '__attribute__' before 'KiemTraNguyenTo'
In function 'TimSoLonNhat':
Line 58: error: 'for' loop initial declaration used outside C99 mode

Create a new paste based on this one

Comments:

posted by luongphongnhan on Oct 29

#include<iostream>
#define MAX 100
using namespace std;

void nhapMang(int arr[], int& n) {
do
{
cout << "Moi nhap so phan tu cua mang: ";
cin >> n;
if (0 >= n || n > 100)
{
system("cls");
cout << "Gia tri nhap n ko hop le, vui long nhap lai!" << endl;
}
} while (0>=n || n>100);
for (int i = 0; i < n; i++)
{
cout << "Moi nhap phan tu thu " << i << " cua mang: ";
cin >> arr[i];
}
cout << endl;
}

void xuatMang(int arr[], int n) {
cout << "Mang vua nhap: ";
for (int i = 0; i < n; i++)
{
cout << arr[i] << " ";
}
cout << endl;
}

bool checkNguyenTo(int a) {
if (a < 2) {
return false;
}
else if (a > 2) {
if (a % 2 == 0) {
return false;
}
for (int i = 3; i < (a/2); i++)
{
if (a % i == 0)
return false;
}
}
return true;
}

int timMax(int arr[], int n) {
int max = arr[0];
for (int i = 0; i < n; i++)
{
max = (arr[i] > arr[0]) ? arr[i] : max;
}
return max;
}

int timNguyenToMin(int arr[], int n, int max) {
while (1)
{
if (checkNguyenTo(max) == true) {
return max;
}
max++;
}

}

int main(){
int numOfArr;
int* Arr = new int[100];
nhapMang(Arr, numOfArr);
xuatMang(Arr, numOfArr);
int max = timMax(Arr, numOfArr);
cout << "So nguyen to min lon hon tat ca phan tu trong mang la: " << timNguyenToMin(Arr, numOfArr, max) << endl;
delete []Arr;
system("pause");
return 0;
}