#include <omp.h>
#include <stdio.h>
#include <stdlib.h>
#include <math.h>
#include <stdbool.h>

#define N 1000
#define START (-100)
#define STOP (100)
#define ITERATIONS_COUNT 10000

double * generate_double_arr(size_t n){
    return (double *) malloc(n * sizeof(double));
}


double *fill_vector(){
    double * res = generate_double_arr(N);
    for(size_t i = 0; i < N; i++){
        res[i] = i*i;
    }
    return res;
}
void fill_vector_with_value(double *res, double value) {
    for (size_t i = 0; i < N; i++) {
        res[i] = value;
    }
}
double* generate_matrix_a() {
    double *res = generate_double_arr(N*N);
    for (size_t i = 0; i < N; i++) {
        for(size_t j = 0; j < N; j++){
            res[j*N +i] = (i == j ? (double)i : N);
        }
    }

    return res;
}

void calculate_squared_norm(const double *b, double *norm_b_square) {
    double kek = 0;
    #pragma omp for reduction(+:norm_b_square)
    for (size_t i = 0; i < N; i++) {
        *norm_b_square += b[i]*b[i];
    }
}

double calculate_right_part(double *b, double *norm_b_square){
    double epsilon = pow(10, -5);

    calculate_squared_norm(b, norm_b_square);

    #pragma omp master
    return epsilon*epsilon*(*norm_b_square);
}



int main(int argc, char* argv[]) {
    double start;
    double end;
    start = omp_get_wtime();

    double *a = generate_matrix_a();
    double *x = generate_double_arr(N);
    fill_vector_with_value(x, 0);
    double *b = fill_vector();
    double *y = generate_double_arr(N);

    double norm_b_square = 0;
    #pragma omp parallel shared(b, norm_b_square) default(none)
    {
        double right_part = calculate_right_part(b, &norm_b_square);
    }


}