If divisors [ j ] is equal to j then this means that i is the first prime divisor for j so we update divi [ j ] = i
if ( divisors [ j ] == j ) divisors [ j ] = i ; } } } for ( int i = 0 ; i < n ; i ++ ) {