Advertisement
Alex2002s

Untitled

Dec 11th, 2019
359
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.30 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3. #include <algorithm>
  4. using namespace std;
  5. int **creat(int &n1,int &n2)
  6. {
  7. cout<<"n1=";cin>>n1;
  8. cout<<"n2=";cin>>n2;
  9. int **mas=new int*[n1];
  10. for (int i=0;i<n1;i++)
  11. mas[i]=new int [n2];
  12. for (int i=0;i<n1;i++)
  13. for (int j=0;j<n2;j++)
  14. cin>>mas[i][j];
  15. cout<<endl<<endl<<endl;
  16. return mas;
  17. }
  18. void print(int **mas,int n1,int n2)
  19. {
  20. for (int i=0;i<n1;i++,cout<<endl)
  21. for (int j=0;j<n2;j++)
  22. cout<<mas[i][j]<<" ";
  23.  
  24. }
  25.  
  26.  
  27. int main ()
  28. {
  29. int n1,n2,p;
  30.  
  31. int **a=creat(n1,n2);
  32.  
  33. for (int i=0;i<n1;i++)
  34. {
  35. p=0;
  36. for (int j=0;j<n2;j++)
  37. {
  38. if (a[i][j]%2==0)
  39. p++;
  40. }
  41. if (p==0)
  42. {
  43. delete[] a[i];
  44. for (int c=i;c<n1-1;c++)
  45. { a[c]=a[c+1];
  46. }
  47. a[n1-1]=NULL;
  48. --n1;
  49. i--;
  50. }
  51. }
  52.  
  53. print(a,n1,n2); }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement