I.

    1. c    double!
    2. b
        KIMENET: 22220444
    
        f(2024)
        |   cout << 2
        |   f(1012)
        |   |   cout << 2
        |   |   f(506)
        |   |   |   cout << 2
        |   |   |   f(253)
        |   |   |   |   f(126)
        |   |   |   |   |   cout << 2
        |   |   |   |   |   f(63)
        |   |   |   |   |   |   f(31)
        |   |   |   |   |   |   |   f(15)
        |   |   |   |   |   |   |   |   cout << 0
        |   |   |   |   |   |   |   []
        |   |   |   |   |   |   |   cout << 4
        |   |   |   |   |   |   []
        |   |   |   |   |   |   cout << 4
        |   |   |   |   |   []
        |   |   |   |   []
        |   |   |   |   cout << 4
        |   |   |   []
        |   |   []
        |   []
        []
        
    3. b
        1 2 8 9 nem 
        1 3 nem
        1 4 nem
        1 5 8 9 nem
        1 6 8 9
        
        1 6 8 9 * 
        1 7 ? ? nincs
        1 8 nincs
        1 9 nincs
        2 5 8 9 *
        2 6 7 9
        3 4 8 9
        
        ...
        3 6 7 8
        4 5 6 9
    
    4. ok
    
    5. E->D  vagy E->C  forduljon
    
II.
    1.
        a)  3+5+29 = 37
        b)  16 32 64 
        c)  ok
        d)  
            
II.
    2. ok
    3. 
        .... helyére: 
        
        Szilárd:
            if (i == 0 && j >= i)
                a[i][j]--;
            if (i >= 1 && j >= i)
                a[i][j] = a[i-1][j]+2;
            ?????
    
        Gergő:
            if (j == 0) a[i][j] = 0;
            else {
                if (i < j) a[i][j] = 2*i;
                else a[i][j] = 2*j;
            }
            
        Jonatán
            if (i == j) a[i][j] = i+j;
            if (i > j) a[i][j] = a[i-1][j];
            if (j > i) a[i][j] = a[i][j-1];
    
III.
    1. 
        int Impare (int n)
        {
            int m=0;
            int p=1;
            bool fel = true;
            while (n>0){
                if (n%10%2==1){
                    m=m+n%10*p+n%10*p*10;
                    p *= 100;
                    fel=false;
                }
                else {
                    m=m+n%10*p;
                    p*=10;
                }

                n/=10;
            }

            if (fel)
                return -1;
            else
                return m;
        }
    
    2.
        #include <iostream>
        #include <cstring>
        using namespace std;

        int main()
        {
            /*
            int n;
            char lista[100][11];

            cin >> n;

            for (int i = 0; i < n; i++)
                cin >> lista[i];

            cin.get();
            char mondat[101];
            cin.getline(mondat, 101);
            */

            // ------------


            int n;
            char lista[100][11];

            cin >> n;
            cin.get();

            for (int i = 0; i < n; i++)
                cin.getline(lista[i], 11);

            char mondat[101];
            cin.getline(mondat, 101);


            char eredmeny[102] = "";

            bool imposibil = false;

            char *p = strtok(mondat, " ");
            while (p != NULL) {
                if (p[0] == '*') {
                    int len = strlen(p);
                    int talalt_i = -1;

                    for (int i = 0; i < n; i++) {
                        if (strlen(lista[i]) == len) {
                            talalt_i = i;
                        }
                    }

                    if (talalt_i == -1)
                        imposibil = true;
                    else {
                        strcat(eredmeny, lista[talalt_i]);
                        strcat(eredmeny, " ");
                    }
                }
                else {
                    strcat(eredmeny, p);
                    strcat(eredmeny, " ");
                }

                p = strtok(NULL, " ");
            }

            if (imposibil)
                cout << "imposibil" << endl;
            else
                cout << eredmeny << endl;


            return 0;
        }
        
III.3.
    #include <iostream>
    #include <fstream>
    using namespace std;

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

        int frek[1001] = {};

        int szam;
        while (bemenet >> szam) {
            frek[szam]++;
        }

        bool jo = true;

        for (int i = 1; i <= 1000; i++) {
            if (frek[i] != 0) {
                //if (!(frek[i] <= i && frek[i]%2 == i%2))
                // VAGY:
                if (frek[i] > i || frek[i]%2 != i%2)
                    jo = false;

            }
        }

        if (jo)
            cout << "DA\n";
        else
            cout << "NU\n";

        return 0;
    }


HF. 2023 simulare!