Advertisement
Guest User

Untitled

a guest
Apr 10th, 2019
215
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 0.54 KB | None | 0 0
  1. #include <iostream>
  2. #define n 3
  3. #include <cstdlib>
  4. using namespace std;
  5.  
  6.  
  7. bool metodo (int A[][n], double w )
  8. {
  9. int somma_diagonale =0;
  10. int somma_colonna=0;
  11. int j=0;
  12.  
  13. for (int j=0; j<n;j++) {
  14.  
  15. for (int i=0; i<n; i++){
  16.  
  17. somma_diagonale = somma_diagonale + A [j][i];
  18.  
  19. }
  20.  
  21. }
  22.  
  23. int i=0;
  24. j=0;
  25. qui:
  26. while ( j<n ){
  27.  
  28. somma_colonna=somma_colonna + A[j][i];
  29. j++;
  30. }
  31.  
  32. if ((somma_colonna/somma_diagonale)>w)
  33. return true;
  34. else
  35. i++;
  36. goto qui;
  37.  
  38.  
  39.  
  40.  
  41. }
  42.  
  43. int main () {
  44. return 0;
  45. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement