BAC 2021 TEST 3 ANTRENAMENT INFO

I.
1.b
2.c
3.b
4.a
5.d

II.
1.
a.
250887
b.
22 44
c.
#include <bits/stdc++.h>

using namespace std;

int main() {
  int n, cn, x, m, p, c;
  cin >> n;
  x = 0;
  m = 0;
  p = 1;
  while (x < 10) {
    cn = n;
    while (cn != 0) {
      c = cn % 10;
      cn = cn / 10;
      if (c == x) {
        m = c * p + m;
        p = p * 10;
      }
    }
    x = x + 2;
  }
  cout << m;
  return 0;
}
d.
-
2.
struct{int numar;
       struct{int nume[21];
              int colectie[21];}exponat[20];
                      }m;
3.
un
zeu

III.
1.
int prim(int n) {
  int j;
  if (n == 1 || n == 0)
    return 0;
  if (n == 2)
    return 1;
  if (n % 2 == 0)
    return 0;
  for (j = 3; j < n; j = j + 2)
    if (n % j == 0)
      return 0;
  return 1;
}

int suma(int n) {
  int s = 0, i, d;
  for (i = 1; i * i <= n; i++) {
    if (n % i == 0) {
      if (prim(i) == 0)
        s = s + i;
      if (i * i < n) {
        if (prim(n / i) == 0)
          s = s + n / i;
      }
    }
  }
  return s;
}

2.
#include <bits/stdc++.h>

using namespace std;
int ap[401];
int main() {
  int n, m, ok = 0, i, j, x, maxi = 2e-9, mini = 2e9;
  cin >> m >> n;
  for (i = 1; i <= m; i++)
    for (j = 1; j <= n; j++) {
      cin >> x;
      if (j == 1 || j == n) {
        maxi = max(maxi, x);
        mini = min(mini, x);
        ap[x]++;
      }
    }
  for (i = mini; i <= maxi; i++)
    if (ap[i] == 2) {
      cout << i << " ";
      ok = 1;
    }
  if (ok == 0)
    cout << "nu exista";
  return 0;
}

3.
#include <bits/stdc++.h>

using namespace std;
ifstream fin("bac.in");
long long v[10], ap[10];
int main() {
  int x, maxi = 2e-9, i = 0, loc = 0;
  while (fin >> x) {
    i++;
    x /= 10;
    ap[x % 10]++;
    if (ap[x % 10] == maxi)
      v[++loc] = i;
    else
    if (ap[x % 10] > maxi) {
      maxi = ap[x % 10];
      loc = 0;
      v[++loc] = i;
    }
  }
  for (i = 1; i <= loc; i++)
    cout << v[i] << " ";
  return 0;
}