Solving diophantine equation using genetic algorithm
vector<int> coeffs = {1, 2, 3, 4, 5, 6, 7, 8, 9};
int result = 10000;
// x1 * 1 + x2 * 2 + .. + x9 * 9 = 10000 population size = 50
mutation rate = 0.01
iterations = 8490
answer is ready = 1
670*1 + 357*2 + 1026*3 + 129*4 + 147*5 + 342*6 + 66*7 + 18*8 + 181*9 = 10000