... b[ i]); break; } } if(flag == 1) printf("\n%d", b[ i]); } } int main() { int na, nb; int a[MAX], b[ MAX]; printf("\nNhap mang a:"); nhap (a, < /b> na); xuat (a, < /b> na); printf("\nNhap mang b: "); nhap (b, nb); ... LietKePhanTuXuatHien 1Trong2 Mang(int a[], int b[ ], int na, int nb) { int i, j, flag; for(i = 0; i < na; i++) { flag = 1; for(j = 0; j < nb; j++) { if(a[i] == b[ j]) { flag = 0; printf("\nTrong mang A ... na); printf("\nNhap mang b: "); nhap (b, nb); xuat (b, nb); printf("\nCac phan tu xuat hien mang: "); LietKePhanTuXuatHien 1Trong2 Mang (a, < /b> b, na, nb); getch(); return 0; } ...