Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include "stdafx.h"
- #include <iostream>
- #include <stdio.h>
- #include <fstream>
- using namespace std;
- int main()
- {
- /*freopen("datein.txt", "r", stdin);*/
- ifstream f("datein.txt");
- int n;
- f >> n;
- switch (n)
- {
- case 1:
- int v[50], ma;
- ma = 0;
- f >> n;
- for (int i = 0; i < n; i++)
- {
- f >> v[i];
- ma += v[i];
- }
- ma /= n;
- cout << "Urmatoarele elemente au valoare mai mare decat ma a vectorului: " << endl;
- for (int i = 0; i < n; i++)
- if (v[i] > ma) cout << v[i] << " ";
- cout << "ma= " << ma << endl;
- break;
- case 2:
- int v1[50], S;
- S = 0;
- f >> n;
- for (int i = 0; i < n; i++)
- f >> v1[i];
- cout << "Numerele care au valoarea eagala cu suma elementelor vecine sunt: " << endl;
- for (int i = 0; i < n; i++)
- {
- S = v1[i - 1] + v1[i + 1];
- if (S == v1[i]) cout << v1[i] << " ";
- S = 0;
- }
- break;
- case 3:
- int v2[50], s;
- s = 0;
- f >> n;
- for (int i = 0; i < n; i++)
- f >> v2[i];
- cout << "Suma elementelor impare aflate pe pozitii pare este: " << endl;
- for (int i = 0; i <= n; i += 2)
- if (v2[i] % 2 != 0) s += v2[i];
- cout << s << endl;
- break;
- case 4:
- int v3[50], v4[50], cont;
- cont = 0;
- f >> n;
- for (int i = 0; i < n; i++)
- f >> v3[i];
- for (int j = 0; j < n; j++)
- f >> v4[j];
- cout << "Urmatoarele elemente din primul vector sunt mai mari decat toate din al doilea: ";
- for (int i = 0; i < n; i++)
- {
- for (int j = 0; j < n; j++)
- {
- if (v3[i] > v4[j]) cont++;
- }
- if (cont == n) cout << v3[i] << " ";
- cont = 0;
- }
- break;
- }
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement