Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <iomanip>
- #include <unistd.h>
- using namespace std;
- double func1(int M[], int n) {
- int iMax = M[1], Num = 0;
- for (int i = 1; i < n+1; i++)
- {
- if (M[i]>iMax)
- {
- Num = i;
- iMax = M[i];
- }
- }
- return Num;
- }
- double func2(int M[], int n){
- double FirstPos, SecondPos, Pr;
- for(int i = 1; i < n+1; i++)
- {
- if (M[i] == 0)
- {
- FirstPos = i;
- break;
- }
- }
- for (int i = FirstPos + 1; i < n+1; i++)
- {
- if (M[i] == 0)
- {
- SecondPos = i;
- break;
- }
- }
- Pr = 1;
- for(int i = FirstPos + 1; i < (SecondPos); i++)
- {
- Pr *= M[i];
- }
- return Pr;
- }
- void Swap(int M[], int P[], int n) {
- int u = 1;
- for (unsigned int i = 1; i < n+1; i = i + 2)
- {
- for(u; u < n+1; u++)
- {
- P[u] = M[i];
- break;
- }
- u++;
- }
- for (unsigned int i = 2; i < n+1; i = i + 2)
- {
- for(u; u < n+1; u++)
- {
- P[u] = M[i];
- break;
- }
- u++;
- }
- }
- int main() {
- int n;
- cin >> n;
- int *M = new int[n];
- int *P = new int[n];
- for (int i = 1; i < n+1; i++) {
- cin >> M[i];
- }
- cout << func1(M, n) << " " << func2(M, n) << endl;
- Swap(M, P, n);
- for (unsigned int u = 1; u < n+1; u++)
- cout << " " << P[u];
- cout << endl << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement