Advertisement
Guest User

Untitled

a guest
Dec 9th, 2019
91
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.35 KB | None | 0 0
  1. #include <iostream>
  2. #include <cmath>
  3.  
  4. using namespace std;
  5.  
  6. void cit(int &n, int &m, int a[11][11])
  7. {
  8. int i, j;
  9. cout<<"m = ";
  10. cin>>m;
  11. cout<<"n = ";
  12. cin>>n;
  13. for(i=1; i<=m; i++)
  14. {
  15. for(j=1; j<=n; j++)
  16. cin>>a[i][j];
  17. }
  18. }
  19.  
  20. void afis(int n, int m, int a[11][11])
  21. {
  22. int i, j;
  23. for(i=1; i<=m; i++)
  24. {
  25. for(j=1; j<=n; j++)
  26. cout<<a[i][j]<<" ";
  27. cout<<endl;
  28. }
  29. }
  30.  
  31. void sortare(int n, int m, int a[11][11], int y)
  32. {
  33. int i, k;
  34. for(i=1; i<=m-1; i++)
  35. for(k=i+1; k<=m; k++)
  36. if(a[i][y]<a[k][y])
  37. {
  38. a[i][y]=a[i][y]+a[k][y];
  39. a[k][y]=a[i][y]-a[k][y];
  40. a[i][y]=a[i][y]-a[k][y];
  41. }
  42. }
  43.  
  44. int contur_pp(int n, int m, int a[11][11])
  45. {
  46. int i, j, k=0;
  47. for(j=1; j<=m; j++)
  48. {
  49. if(sqrt(a[1][j])==(int)sqrt(a[1][j]))
  50. k++;
  51. if(sqrt(a[n][j])==(int)sqrt(a[n][j]))
  52. k++;
  53. }
  54. for(i=2; i<=n-1; i++)
  55. {
  56. if(sqrt(a[i][1])==(int)sqrt(a[i][1]))
  57. k++;
  58. if(sqrt(a[i][m])==(int)sqrt(a[i][m]))
  59. k++;
  60. }
  61. return k;
  62. }
  63.  
  64. int main()
  65. {
  66. int n, m, a[11][11];
  67. cit(n, m, a);
  68. cout<<endl;
  69. afis(n, m, a);
  70. cout<<endl;
  71. cout<<contur_pp(n, m, a);
  72. return 0;
  73. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement