[ create a new paste ] login | about

Link: http://codepad.org/1ukIkvFi    [ raw code | output | fork ]

C, pasted on Sep 21:
#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]);
	}
}

int kiemtrahoanthien(int n)
{
	int i = 1;
	int S = 0;
	while(i < n)
	{
		if(n % i == 0)
		{
			S = S + i;
		}
		i++;
	}
	if(S == n)
		return 1;
	else
		return 0;
}
int timvitrisohoanthiendau(int a[], int n)
{
	for(int i = 0; i < n; i++)
	{
		if(kiemtrahoanthien(a[i]) == 1)
		{
			return i;
		}
	}
	return -1;
}

int TimHoanThienBeNhat(int a[], int n, int ViTriHoanThienDau)
{

	int HoanThienMin = a[ViTriHoanThienDau];

	for (int i = ViTriHoanThienDau + 1; i < n; i++)
	{
		if (kiemtrahoanthien(a[i]) == 1 && a[i] < HoanThienMin)
		{
			HoanThienMin = a[i];
		}
	}
	return HoanThienMin;
}
int main()
{
	int n;
	int a[MAX];

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



	int vitrihoanthiendau = timvitrisohoanthiendau(a, n);
	
	
	if(vitrihoanthiendau == -1)
	{
		printf("\nmang khong co so hoan thien");
	}
	else
	{
		printf("\nVi tri hoan thien dau la %d", vitrihoanthiendau);
		int hoanthienmin = TimHoanThienBeNhat(a, n, vitrihoanthiendau);
		printf("\nso hoan thien be nhat la %d", hoanthienmin);
	}

	getch();
	return 0;
}


Output:
1
2
3
4
5
6
7
8
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
In function 'timvitrisohoanthiendau':
Line 51: error: 'for' loop initial declaration used outside C99 mode
In function 'TimHoanThienBeNhat':
Line 66: error: 'for' loop initial declaration used outside C99 mode


Create a new paste based on this one


Comments: