#include <iostream>
#include <string>
#include <fstream>
#include <math.h>
#define JOJO 64
using namespace std;
int **getM(int **M, int N, int k) {
    int **A = new int *[N - 1];
    for (int i = 1; i < N; i++) {
        A[i - 1] = new int[N - 1];
        int m = 0;
        for (int j = 0; j < N; j++) {
            if (j == k) m++;
            else A[i - 1][j - m] = M[i][j];
        }
    }
    return A;
}

int getDet(int **M, int N) {
    if (N == 1) return M[0][0];
    int D = 0;
    for (int i = 0; i < N; i++)
        D += (((i + 1) % 2) ? 1 : -1) * M[0][i] * getDet(getM(M, N, i), N - 1);
    return  D;
}

int main() {

    srand(time(NULL));
    //getting info from config
    ifstream suk("C:\\Users\\student\\Documents\\CHERNEVICH\\CONFIG\\CONFIG.txt");

    int N, x;
    string U[] = {"a","b","c","d","e", "f", "g", "h", "i", "k"};
    cout << "How many equation must be in your system?" << endl;
    cin >> N;
    cout << "How many variation of tasks you need?" << endl;
    cin >> x;
    char buff[100];
    suk.getline(buff, 50);
    suk.getline(buff, 50);
    suk.getline(buff, 50);
    int min, max, no;
    min = atoi(buff);
    suk.getline(buff, 50);
    suk.getline(buff, 50);
    max = atoi(buff);
    suk.getline(buff, 100);
    suk.getline(buff, 50);
    no = atoi(buff);
    suk.close();


    char s1[JOJO] = "C:\\Users\\student\\Documents\\CHERNEVICH\\TASKS\\Var00000.txt";
    char s2[JOJO] = "C:\\Users\\student\\Documents\\CHERNEVICH\\ANSWERS\\ANS00000.txt";
    ofstream out2;
    out2.open(s2);
    for(int k = 1; k < x + 1; k++) {

    ofstream out1;
    int OP =0;
    OP = k;
   if(OP/10000>0){s1[47]='0' +OP/10000; OP -= (OP/10000)*10000; }
   if(OP/1000>0){s1[48]='0' +OP/1000; OP -= (OP/1000)*1000; }
   if(OP/100>0){s1[49]='0' +OP/100; OP -= (OP/100)*100; }
   if(OP/10>0){s1[50]='0' +OP/10; OP -= (OP/10)*10; }
   s1[51]='0' +OP; OP=0;
  //  OP = k;
   //if(OP/10000>0){s2[49]='0' +OP/10000; OP -= (OP/10000)*10000; }
   //if(OP/1000>0){s2[50]='0' +OP/1000; OP -= (OP/1000)*1000; }
   //if(OP/100>0){s2[51]='0' +OP/100; OP -= (OP/100)*100; }
   //if(OP/10>0){s2[52]='0' +OP/10; OP -= (OP/10)*10; }
   //s2[53]='0' +OP; OP=0;


    //cout << s1 << endl;
    out1.open(s1);
    int s=0;
    int C[N-1];
    int **A = new int *[N];
    int B[x][N];
    int SCHET=0;
    for (int i = 0; i < N; i++) {B[k][i] = rand()%20 -10; if(B[k][i]==0) SCHET+=1;}
    if(SCHET>no){k--; continue;}
    for (int i = 0; i < N; i++) {
        A[i] = new int[N];
        for (int j = 0; j < N; j++)
        {
         //   cin >> A[i][j];
          A[i][j] = rand()%(abs(max-min)+1)+min;
          s += A[i][j]*B[k][j];
          // cout << A[i][j] << " " << B[k][j] << " ";
        }
        C[i] = s;
        s = 0;
        //cout << endl;
    }
    if(getDet(A, N)==0) {k--; continue;}
    if (out1.is_open()){
        for(int i = 0; i < N; i++) {
            int OPEL = -1;
            for(int j = 0; j < N; j++){
                OPEL+=1;
                if(A[i][j]==0) {OPEL = 0; continue;}
                if((OPEL != 0)&&(A[i][j]>0)) out1 << "+";
                if((OPEL != 0)&&(A[i][j]<0)) out1 << "-";
                if(A[i][j]==1){ out1 << U[j]; continue;}
                if(A[i][j]==-1){out1 << U[j]; continue;}
             out1 << abs(A[i][j])<< U[j];
            }
            out1<<"= " << C[i];
            out1<< endl;
        }
     //out <<    "JKF";
    }
        if(out2.is_open()){
            out2 << "VAR" << k << "    " ;
         for(int i = 0; i< N; i++){
             out2<< U[i] << " = " << B[k][i] << " ";

            }
            out2 << endl;
        }
       // cout << getDet(A, N) << endl;
    }

system("pause");
    return 0;
}