1
2
3
4
5
6
7
8

struct lalea {
    char denumire[21];
    struct {
        int nrFire;
        int pretFir;
    } stoc;

} f[10];

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18

int abundent(int n)
{
    int sn = 0;
    for (int i = 1; i <= n; i++)
        if (n % i == 0) sn += i;

    for (int k = 1; k <= n-1; k++) {

        int sk = 0;
        for (int i = 1; i <= k; i++)
            if (k % i == 0) sk += i;

        if ((double)sk/k >= (double)sn/n)
            return 0;
    }

    return 1;
}

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31

#include <iostream>
#include <fstream>
using namespace std;

int main()
{
    ifstream fin("bac.txt");

    int hanyszor_prefix[100] = {};
    int hanyszor_sufix[100] = {};

    int x;
    while (fin >> x) {
        if (x > 99) {
            hanyszor_sufix[x%100]++;

            while (x >= 100)
                x = x / 10;

            hanyszor_prefix[x]++;
        }
    }

    int db = 0;
    for (int i = 10; i <= 99; i++)
        if (hanyszor_prefix[i] > 0 && hanyszor_prefix[i] == hanyszor_sufix[i])
            db++;

    cout << db << endl;
    return 0;
}