//#include <fstream>
#include <iostream>
//#include <algorithm>
//#define VMAX 250010
using namespace std;

//ifstream fin("cykablyat.in");
//ofstream fout("cykablyat.out");

int n, m;
int i, j, imax, jmax, i1, j1;
int dimensiune, dimensiunemax, nrmese;
int a[260][260];

int main()
{
    cin >> n >> m;
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= m; j ++)
            cin >> a[i][j];
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= m; j ++)
        {
            if (a[i][j] == 1)
            {
                nrmese ++;
                for (imax = i; a[imax][j] == 1; imax ++);
                for (jmax = j; a[i][jmax] == 1; jmax ++);
                imax --;
                jmax --;
                //fout << i << ' ' << imax << "    " << j << ' ' << jmax << '\n';
                for (i1 = i; i1 <= imax; i1 ++)
                    for (j1 = j; j1 <= jmax; j1 ++)
                        a[i1][j1] = 0;
                dimensiune = (imax - i + 1) * (jmax - j + 1);
                if (dimensiune > dimensiunemax)
                    dimensiunemax = dimensiune;
            }
        }
    cout << nrmese << ' ' << dimensiunemax << '\n';
    return 0;
}
566






#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("a.in");
ofstream fout ("a.out");

int prim(long long int n)
{
    int d;
    if (n == 1 || n == 0)
        return 0;
    if (n == 2)
        return 1;
    if (n % 2 == 0)
        return 0;
    d = 3;
    while (d * d <= n && n % d != 0)
        d ++;
    if (d * d > n)
        return 1;
    return 0;
}

int n, m;
int i, j;
int a[110][110];
int linminim, linmaxim, colminim, colmaxim;
int minim, maxim;

int main()
{
    cin >> n >> m;
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= m; j ++)
            cin >> a[i][j];
    for (i = 1; i <= n; i ++)
    {
        if (!prim(a[i][1]))
        {
            for (j = 1; j <= m; j ++)
                cout << a[i][j] << ' ';
            cout << '\n';
        }
    }
    return 0;
}
774






#include <iostream>
#include <algorithm>

using namespace std;

int v[10005], n, m;
char c;

int main()
{
    int i, j, cate, semn;
    cin >> n >> m;
    cin >> c;
    for (i = 1; i <= n * m; i ++)
        cin >> v[i];
    sort(v + 1, v + n * m + 1);
    if (c == '+')
    {
        cate = 1;
        semn = 1;
    }
    else
    {
        cate = n * m;
        semn = -1;
    }
    for (i = 1; i <= n; i ++)
    {
        for (j = 1; j <= m; j ++)
        {
            cout << v[cate] << ' ';
            cate = cate + 1 * semn;
        }
        cout << '\n';
    }
    return 0;
}
2873







#include <fstream>
#define VMAX 250010
using namespace std;

ifstream fin("lincol.in");
ofstream fout("lincol.out");

int n, m, nr;
int a[110][110];
char c;
int i, j, k;
int x, s;

int main()
{
    fin >> n >> m;
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= m; j ++)
            fin >> a[i][j];
    fin >> nr;
    for (k = 1; k <= nr; k ++)
    {
        fin >> c;
        fin >> x;
        if (c == 'C')
        {
            s = 0;
            for (i = 1; i <= n; i ++)
                s += a[i][x];
            fout << s << '\n';
        }
        else
        {
            s = 0;
            for (j = 1; j <= m; j ++)
                s += a[x][j];
            fout << s << '\n';
        }
    }
    return 0;
}
669




#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin ("a.in");
ofstream fout ("a.out");

int n, m;
int i, j;
int a[1010][1010];
int s, minim;

int main()
{
    cin >> n >> m;
    for (i = 1; i <= n; i ++)
        for (j = 1; j <= m; j ++)
            cin >> a[i][j];
    for (j = 1; j <= m; j ++)
    {
        minim = a[1][j];
        for (i = 2; i <= n; i ++)
            if (a[i][j] < minim)
                minim = a[i][j];
        s += minim;
    }
    cout << s << '\n';
    return 0;
}
568