POJ 1922 Ride to School

# include<stdio.h>
# define MAX 10000
int a[ MAX ][ 2 ];
float  b[ MAX ];
int main()
{
    int n ,  i;
     float   min ;
     while (scanf( " %d " ,   & n))
    {
         if (n  ==   0 )
             break ;
         for (i = 0 ; i < n; i ++ )
        {
            scanf( " %d " ,  a[i]);
            scanf( " %d " ,  a[i] + 1 );
             if (a[i][ 1 ]  >=   0 )
            {
                b[i]  =  ( float ) 4500   *   18   /  (a[i][ 0 ]  *   5 )  +  a[i][ 1 ];
                 if (b[i]  !=  (int)b[i])
                    b[i] ++ ;
            }
             else
                b[i]  =   11111 ;
        }
         min   =  b[ 0 ];
         for (i = 1 ; i < n; i ++ )
        {
             if (b[i]  <   min )
                 min   =  b[i];
        }
         printf ( " %d " ,  (int) min );
    }
     return   0 ;
}