int main(void){ take_input(); total_bigram(); printf("%d",dissimilarity()); return 0; }
int main() { int i, j, m; freopen( "a.in", "r", stdin ); //freopen( "a.out", "w", stdout ); while ( 1 ) { if ( take_input() == false ) { break; } for ( i = 0; i < MAXLIFTS; ++i ) { for ( j = 0; j < MAXFLOORS; ++j ) { distance[i][j] = INF; } } for ( i = 0; i < lifts; ++i ) { if ( r[i][0] == true ) { dijkstra( i, 0 ); } } m = INF; for ( i = 0; i < lifts; ++i ) { if ( distance[i][target] < m ) { m = distance[i][target]; } } if ( m != INF ) { printf( "%d\n", m ); } else { printf( "IMPOSSIBLE\n" ); } } return 0; }