31 atestat

#include <iostream>
#include <fstream>
#include <math.h>

using namespace std;

bool prim(int x) {
    for (int i = 2; i <= sqrt(x); i++) {
        if (!(x % i))
            return 0;
    }
    return 1;
}

void mutare(int v[100], int &m, int z) {
    for (int j = m; j >= z; j--)
        v[j + 1] = v[j];
    m++;
}

int main() {
    int n, a[100][100], v[100], s = 0, m = 0;
    ifstream f("atestat.in");
    ofstream g("atestat.out");
    v[0] = -1;
    f >> n;
    for (int i = 1; i <= n; i++) {
        for (int j = 1; j <= n; j++) {
            f >> a[i][j];
            if (!m)
                v[++m] = a[i][j];
            else {
                if (a[i][j] > v[m])
                    v[++m] = a[i][j];
                else {
                    int p = 0;
                    while (p < m) {
                        if (v[p] < a[i][j] && a[i][j] < v[p + 1]) {
                            mutare(v, m, p + 1);
                            v[p + 1] = a[i][j];
                        }
                        p++;
                    }
                }
            }
        }
        if (prim(a[n - i + 1][i]))
            s++;
    }
    if (s)
        g << s << '\n';
    else
        g << "nu exista";
    for (int i = 1; i <= m; i++)
        g << v[i] << ' ';
    g << '\n' << m;
    f.close();
    g.close();
}