Treatment of previous cases [0;i] before the loop [i+1;n]

[ayman-erroutabi]

CodinGame/Dwarfs standing on the shoulders of giants.txt

Line 36 in 0434041

perhaps adding this after the [i+1;n] loop might solve the issue like this :

for (int j = i+1; j < n; j++) { if(tmp[0] == nombre[j][1]){ compteur[i]++; tmp[0] = nombre[j][0]; }else if(tmp[1] == nombre[j][0]){ compteur[i]++; tmp[1] = nombre[j][1]; } } for (int k = i-1; k > 0; k--) { if(tmp[0] == nombre[k][1]){ compteur[i]++; tmp[0] = nombre[k][0]; }else if(tmp[1] == nombre[k][0]){ compteur[i]++; tmp[1] = nombre[k][1]; } }