[ create a new paste ] login | about

Link: http://codepad.org/btaDn3kC    [ raw code | output | fork | 3 comments ]

C, pasted on Oct 13:
#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 DemPhanTuChiXuatHien1Trong2Mang(int a[], int b[], int na, int nb)
{
	int flag, dem = 0;
	for(int i = 0; i < na; i++)
	{
		flag = 1;
		for(int j = 0; j < nb; j++)
		{
			if(a[i] == b[j])
			{
				flag = 0;
				break;
			}
		}
		if(flag == 1)
		{
			dem++;
		}
	}
	for(int i = 0; i < nb; i++)
	{
		flag = 1;
		for(int j = 0; j < na; j++)
		{
			if(b[j] == a[i])
			{
				flag = 0;
				break;
			}
		}
		if(flag == 1)
		{
			dem++;
		}
	}
	return dem;
}
int main()
{
	int na, nb;
	int a[MAX], b[MAX];

	printf("\nNhap mang a:");
	nhap(a, na);
	xuat(a, na);

	printf("\nNhap mang b:");
	nhap(b, nb);
	xuat(b, nb);
	
	int dem = DemPhanTuChiXuatHien1Trong2Mang(a, b, na, nb);
	printf("\nSo phan tu chi xuat hien 1 trong 2 mang la: %d", dem);
	getch();
	return 0;
}


Output:
1
2
3
4
5
6
7
8
9
10
11
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 'DemPhanTuChiXuatHien1Trong2Mang':
Line 35: error: 'for' loop initial declaration used outside C99 mode
Line 38: error: 'for' loop initial declaration used outside C99 mode
Line 51: error: redefinition of 'i'
Line 35: error: previous definition of 'i' was here
Line 51: error: 'for' loop initial declaration used outside C99 mode
Line 54: error: 'for' loop initial declaration used outside C99 mode


Create a new paste based on this one


Comments:
posted by rongqui on Jul 5
sẽ ra sai nếu xuất hiện THop: mảng có 2 pt chỉ xuất hiện 1 lần.
VD: 7 7 8 9 5
6 8 9 5 3
output: 4--> sai.
reply
posted by Dgls on Mar 20

reply
posted by Dgls on Mar 20
//Bài này ad làm thiếu TH có các phần tử trùng nhau trong 1 mảng.
#include<iostream>
using namespace std;
int demPT(int a[], int b[], int n, int m){
int dem=0;
for(int i=0; i<n; i++){
int stop=0;
for(int j=0; j!=i && j<n; j++){
if(a[i]==a[j]){
stop=1;
break;
}
}
if(stop==0){
for(int k=0; k<m; k++){
if(a[i]==b[k]){
stop=1;
break;
}
}
if(stop==0) dem++;
}
}
return dem;
}
main(){
int n, m, dem=0;
cin>>n>>m;
int a[n], b[m];
for(int i=0; i<n; i++) cin>>a[i];
for(int i=0; i<m; i++) cin>>b[i];
cout<<demPT(a,b,n,m) + demPT(b,a,m,n)<<endl;
}
reply