Advertisement
Reemind

Untitled

Jun 11th, 2020
101
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
C 1.57 KB | None | 0 0
  1. /******************************************************************************
  2.  
  3. Welcome to GDB Online.
  4. GDB online is an online compiler and debugger tool for C, C++, Python, PHP, Ruby,
  5. C#, VB, Perl, Swift, Prolog, Javascript, Pascal, HTML, CSS, JS
  6. Code, Compile, Run and Debug online from anywhere in world.
  7.  
  8. *******************************************************************************/
  9. #include <iostream>
  10.  
  11. using namespace std;
  12.  
  13. int kratnoe(int** mat, int m, int n, int del)
  14. {
  15.     for(int i = 0; i < n; i++)//строки
  16.     {
  17.         for(int j = 0; j < i; j++)//столбцы
  18.         {
  19.             if(mat[i][j] % del == 0)
  20.                 return 1;
  21.         }
  22.     }
  23.     return 0;
  24. }
  25.  
  26. int findmax(int** mat, int m, int n, int* result)
  27. {
  28.     return 1; //в result значение, 1 или 0 - это bool
  29. }
  30.  
  31. void enter_mat(int** mat, int* n, int* m)
  32. {
  33.     cin >> *n >> *m;
  34.    
  35.     mat = new int*[*n];
  36.     for(int i = 0; i < *n; i++)
  37.     {
  38.         mat[i] = new int[*n];
  39.         for(int j = 0; j < *m; j++)
  40.         {
  41.             cin >> mat[i][j];
  42.         }
  43.     }
  44. }
  45.  
  46.  
  47. int enter_val()
  48. {
  49.     int n;
  50.     cin >> n;
  51.     return n;
  52. }
  53.  
  54. int main()
  55. {
  56.     int** mat1;
  57.     int n1, m1, r1, v1;
  58.     enter_mat(mat1, &n1, &m1);
  59.     v1 = enter_val();
  60.    
  61.     int** mat2;
  62.     int n2, m2, r2, v2;
  63.     enter_mat(mat2, &n2, &m2);
  64.     v2 = enter_val();
  65.    
  66.     if(findmax(mat1, n1, m1, &r1))
  67.         cout << kratnoe(mat1, n1, m1, v1);
  68.        
  69.     if(findmax(mat2, n2, m2, &r2))
  70.         cout << kratnoe(mat2, n2, m2, v2);
  71.    
  72.  
  73.     return 0;
  74. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement