Salut!
Ai mai jos rezolvarile in C++
1.
#include <iostream>
using namespace std;
int main()
{
int a[1000], n;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
if (a[i] % 2 == 0)
{
cout << a[i] << " ";
}
}
return 0;
}
2.
#include <iostream>
using namespace std;
int main()
{
int a[1000], n;
bool exista = false;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
}
for (int i = n - 1; i >= 0; --i)
{
if (a[i] % 2 != 0)
{
exista = true;
cout << a[i] << " ";
}
}
if (!exista)
{
cout << "NU EXISTA";
}
return 0;
}
3.
#include <iostream>
using namespace std;
int main()
{
int a[1000], n, maxi = -10000000;
bool exista = false;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
if (a[i] % 2 == 0)
{
exista = true;
if (a[i] > maxi)
{
maxi = a[i];
}
}
}
if (!exista)
{
cout << "NU EXISTA";
}
else
{
cout << maxi;
}
return 0;
}
4.
#include <iostream>
using namespace std;
int main()
{
int a[1000], n, maxi = -10000000, p, u, s = 0;
cin >> n;
for (int i = 0; i < n; ++i)
{
cin >> a[i];
if (a[i] > maxi)
{
maxi = a[i];
}
}
for (int i = 0; i < n; ++i)
{
if (a[i] == maxi)
{
p = i;
break;
}
}
for (int i = n - 1; i >= 0; --i)
{
if (a[i] == maxi)
{
u = i;
break;
}
}
for (int i = 0; i < n; ++i)
{
if (i >= p && i <= u)
{
s += a[i];
}
}
cout << s;
return 0;
}
