Question

Aflati de cate ori apare intr-un sir de numere intregi minimul si maximul sau. Calculati apoi s1 =min+max, s2=nmin+nmax, si sa se verfice daca s1%s2==0 Notatii : min= minimul, max= maximul nmin -nr de aparitii ale minimului nmax- nr de aparitii ale maximului s1=min+max s2=nmin+nmax​

Answer 1

#include <iostream>

using namespace std;

int main() {

int n, sir[10000];

cin >> n;

for (int i = 0; i < n; i++)

cin >> sir[i];

int maxx = sir[0], minn = sir[0];

int nminn = 1, nmaxx = 1;

for (int i = 1; i < n; i++) {

if (sir[i] > maxx) {

maxx = sir[i];

nmaxx = 1;

}

if (sir[i] == maxx)

nmaxx++;

if (sir[i] < minn) {

minn = sir[i];

nminn = 1;

}

if (sir[i] == minn)

nminn++;

}

int s1 = minn + maxx;

int s2 = nminn + nmaxx;

if (s1 % s2 == 0)

cout << "DA\n";

else

cout << "NU\n";

return 0;

}