2 lygis | 6 pamokėlė | 2. Matematikos kontroliniai darbai

#include <iomanip>
using namespace std;

//konstantos
const char Cdfv[] = "Duomenys2.txt";
const char Crfv[] = "Rezultatai.txt";
const int Cm = 30;
const int Ck = 10;

int P[Cm][Ck];

//proceduros
void Skaito (int & n, int & m);
void Vidurkis_m (int n, int m, double V[]);
void Vidurkis_k (int n, int m, double V[]);
void Rikiuoti (int n, int m, double V[]);
void Raso (int n, int m, double Vm[], double Vk[]);

int main()
{
    int n, m;
    double Vm[Cm], Vk[Ck];
    Skaito (n, m);
    Vidurkis_m (n, m, Vm);
    Vidurkis_k (n, m, Vk);
    Rikiuoti (n, m, Vm);
    Raso (n, m, Vm, Vk);
    return 0;
}
//skaito duomenis is failo
void Skaito (int & n, int & m)
{
    ifstream fd (Cdfv);
    fd >> n >> m;
    for (int i = 0; i < n; i++)
        for (int j = 0; j < m; j++)
            fd >> P[i][j];
    fd.close ();
}
//randa vidurki mokiniu
void Vidurkis_m (int n, int m, double V[])
{
    int sum;
    for (int i = 0; i < n; i++)
    {
        sum = 0;
        for (int j = 0; j < m; j++)
            sum += P[i][j];
        V[i] = (double) sum / m;
    }
}
//randa vidurki kontroliniu
void Vidurkis_k (int n, int m, double V[])
{
    int sum;
    for (int j = 0; j < m; j++)
    {
        sum = 0;
        for (int i = 0; i < n; i++)
            sum += P[i][j];
        V[j] = (double) sum / n;
    }
}

//rikiuoja
void Rikiuoti (int n, int m, double V[])
{
    double tarp;
    int tarp1;
    int ind;
    for (int i = 0; i < n - 1; i++)
    {
        for (int k = i; k < n; k++)
        {
            if (V[i] < V[k])
            {
                tarp = V[i];
                V[i] = V[k];
                V[k] = tarp;
                for (int j = 0; j < m; j++)
                {
                    tarp1 = P[i][j];
                    P[i][j] = P[k][j];
                    P[k][j] = tarp1;
                }
            }
        }
    }
}

//duomenu rasymas i faila
void Raso (int n, int m, double Vm[], double Vk[])
{
    ofstream fr (Crfv);
    fr << " ";
    for (int j = 0; j < m; j++)
    fr << setw(6) << left << j + 1;
    fr << "vid" << endl;
    for (int i = 0; i < n; i++)
    {
        fr << setw(4) << i + 1;
        for (int j = 0; j < m; j++)
            fr << setw(6) << P[i][j];
        fr << setw(6) << fixed << setprecision(2) << Vm[i] << endl;
    }
    fr << "vid ";
    for (int j = 0; j < m; j++)
        fr << setw(6) << fixed << setprecision(2) << Vk[j];
    fr << endl;
    fr.close ();
}