#define _USE_MATH_DEFINES
#include "math.h"
#include <stdlib.h>
#include <stdio.h>
#include <locale.h>
#include <time.h>

#define N 4000
#define K 10

const int omega_rand_glial_min = 0;
const int omega_rand_glial_max = 1;

const int omega_rand_neuron_min = 5;
const int omega_rand_neuron_max = 6;

const int theta_rand_min = 0;
const int theta_rand_max = 2 * M_PI;

double A[N][N];
double omega[N];
double theta[N];

double kuramoto(int i, double theta[N])
{
	double sum = 0;

	for (int j = 0; j < N; j++)
		sum += A[i][j] * sin(theta[j] - theta[i]);

	return omega[i] + sum * (double)K / N;
}

void RungeKutta(double dt, double theta[N], double theta_next[N])
{
	double k[N][4];

	// k1
	for (int i = 0; i < N; i++)
		k[i][0] = kuramoto(i, theta) * dt;

	double theta_k1[N];
	for (int i = 0; i < N; i++)
		theta_k1[i] = theta[i] + k[i][0] / 2;

	// k2
	for (int i = 0; i < N; i++)
		k[i][1] = kuramoto(i, theta_k1) * dt;

	double theta_k2[N];
	for (int i = 0; i < N; i++)
		theta_k2[i] = theta[i] + k[i][1] / 2;

	// k3
	for (int i = 0; i < N; i++)
		k[i][2] = kuramoto(i, theta_k2) * dt;

	double theta_k3[N];
	for (int i = 0; i < N; i++)
		theta_k3[i] = theta[i] + k[i][2] / 2;

	// k4
	for (int i = 0; i < N; i++)
		k[i][3] = kuramoto(i, theta_k3) * dt;

	for (int i = 0; i < N; i++)
		theta_next[i] = theta[i] + (k[i][0] + 2 * k[i][1] + 2 * k[i][2] + k[i][3]) / 6;
}

void CopyArray(double source[N], double target[N])
{
	for (int i = 0; i < N; i++)
		target[i] = source[i];
}

int main()
{
	srand(time(NULL));

	for (int i = 0; i < N/2; i++)
	{
		omega[i] = ((double)rand() / RAND_MAX) * (omega_rand_glial_max - omega_rand_glial_min) + omega_rand_glial_min;
	}

	for (int i = N/2; i < N; i++)
	{
		omega[i] = ((double)rand() / RAND_MAX) * (omega_rand_neuron_max - omega_rand_neuron_min) + omega_rand_neuron_min;
	}

	for (int i = 0; i < N; i++)
	{
		theta[i] = ((double)rand() / RAND_MAX) * (theta_rand_max - theta_rand_min) + theta_rand_min;
	}

	//Зачищаем матрицу до нулей
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			A[i][j] = 0;
		}
	}

	//Накидываем 2*N связей в обе стороны
	for (int k = 0; k < 2*N; k++)
	{
		int i = ((double)rand() / RAND_MAX) * N;
		int j = ((double)rand() / RAND_MAX) * N;
		A[i][j] = 1;
		A[j][i] = 1;
	}

	//Считаем связи и пишем в матрицу
	FILE *fp0;
	fp0 = fopen("A.txt", "w+");
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < N; j++)
		{
			if (i == j)
			{
				A[i][j] = 0;
			}
			fprintf(fp0, "%d\t", (int)A[i][j]);
		}
		fprintf(fp0, "\n");
	}
	fclose(fp0);

	//Пишем в файл число связей у каждого осциллятора
	FILE *fp3;
	fp3 = fopen("links.txt", "w+");
	for (int i = 0; i < N; i++)
	{
		int links_count = 0;
		for (int j = 0; j < N; j++)
		{
			if (A[i][j] == 1)
			{
				links_count++;
			}
		}
		fprintf(fp3, "%d\t", (int)links_count);
		fprintf(fp3, "\n");
	}
	fclose(fp3);

	const double t_start = 0;
	const double t_max = 100;
	const double dt = 0.5;

	double t = t_start;

	FILE *fp1;
	fp1 = fopen("omega.txt", "w+");
	for (int i = 0; i < N; i++)
	{
		fprintf(fp1, "%f\n", omega[i]);
	}
	fclose(fp1);

	FILE *fp2;
	fp2 = fopen("results.txt", "w+");
	//setlocale(LC_NUMERIC, "French_Canada.1252");

	while (t < t_max + dt)
	{
		fprintf(fp2, "%f\t", t);
		for (int i = 0; i < N; i++)
		{
			fprintf(fp2, i == N - 1 ? "%f" : "%f\t", theta[i]);
		}
		fprintf(fp2, "\n");

		double theta_next[N];

		RungeKutta(dt, theta, theta_next);
		CopyArray(theta_next, theta);

		t += dt;
		//printf("Progress: %d%%\n", (int)(100 * (t - t_start) / (t_max - t_start)));
	}

	fclose(fp2);
}