Advertisement
Guest User

Untitled

a guest
Sep 20th, 2017
49
0
Never
Not a member of Pastebin yet? Sign Up, it unlocks many cool features!
text 1.20 KB | None | 0 0
  1. #include <iostream>
  2. #include <iomanip>
  3. #include <unistd.h>
  4.  
  5. using namespace std;
  6.  
  7. double func1(int M[], int n) {
  8. int iMax = M[1], Num = 0;
  9. for (int i = 1; i < n+1; i++)
  10. {
  11. if (M[i]>iMax)
  12. {
  13. Num = i;
  14. iMax = M[i];
  15. }
  16. }
  17. return Num;
  18. }
  19.  
  20. double func2(int M[], int n){
  21. double FirstPos, SecondPos, Pr;
  22. for(int i = 1; i < n+1; i++)
  23. {
  24. if (M[i] == 0)
  25. {
  26. FirstPos = i;
  27. break;
  28. }
  29. }
  30. for (int i = FirstPos + 1; i < n+1; i++)
  31. {
  32. if (M[i] == 0)
  33. {
  34. SecondPos = i;
  35. break;
  36. }
  37. }
  38. Pr = 1;
  39. for(int i = FirstPos + 1; i < (SecondPos); i++)
  40. {
  41. Pr *= M[i];
  42. }
  43. return Pr;
  44. }
  45.  
  46. void Swap(int M[], int P[], int n) {
  47. int u = 1;
  48. for (unsigned int i = 1; i < n+1; i = i + 2)
  49. {
  50. for(u; u < n+1; u++)
  51. {
  52. P[u] = M[i];
  53. break;
  54. }
  55. u++;
  56. }
  57. for (unsigned int i = 2; i < n+1; i = i + 2)
  58. {
  59. for(u; u < n+1; u++)
  60. {
  61. P[u] = M[i];
  62. break;
  63. }
  64. u++;
  65. }
  66. }
  67.  
  68.  
  69. int main() {
  70. int n;
  71. cin >> n;
  72. int *M = new int[n];
  73. int *P = new int[n];
  74. for (int i = 1; i < n+1; i++) {
  75. cin >> M[i];
  76. }
  77. cout << func1(M, n) << " " << func2(M, n) << endl;
  78. Swap(M, P, n);
  79. for (unsigned int u = 1; u < n+1; u++)
  80. cout << " " << P[u];
  81. cout << endl << endl;
  82. return 0;
  83. }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement