fork download
  1. #include <iostream>
  2. #include <math.h>
  3. #include <stdlib.h>
  4.  
  5. void naVymenu(int *a, int n, int *b, int m){
  6. int pom1[n];
  7. for (int k = 0; k < n; k++){
  8. pom1[k] = a[k];
  9. }
  10. int x = m;
  11. int y = n;
  12. int pom2[m];
  13. for (int k = 0; k < m; k++){
  14. pom2[k] = b[k];
  15. }
  16. for (int i=0; i < n; i++){
  17. m = x;
  18. while (m > 0){
  19. if (pom1[i] == b[m-1]){
  20. pom1[i] = -1;
  21. }
  22. m--;
  23. }
  24. }
  25. m = x;
  26. for (int i=0; i < m; i++){
  27. n = y;
  28. while (n > 0){
  29. if (pom2[i] == a[n-1]){
  30. pom2[i] = -1;
  31. }
  32. n--;
  33. }
  34. }
  35. m = x;
  36. n = y;
  37. for (int i = 0; i < n; i++){
  38. if (pom1[i] > 0){
  39. printf("%d ", pom1[i]);
  40. }
  41. }
  42. printf("\n");
  43. for (int i = 0; i < m; i++){
  44. if (pom2[i] > 0){
  45. printf("%d ", pom2[i]);
  46. }
  47. }
  48. }
  49.  
  50.  
  51. int main() {
  52. int A[5] = {10, 11, 12, 13, 14};
  53. int B[9] = {10, 13, 15, 18, 20, 22, 25, 28, 31};
  54. naVymenu(A, 5, B, 9);
  55. }
Success #stdin #stdout 0s 15232KB
stdin
Standard input is empty
stdout
11 12 14 
15 18 20 22 25 28 31