Daffodil International University
Problem Link
//Please follow from main function
#include<stdio.h>
int check(int arr[], int n){
int i, m=arr[0];
for(i=0; i<n; i++){
if(arr[i]<m){
m=arr[i];
}
}
return m;
}
int main()
{
int tc, bus, cur_hour, cur_time, min, j, minute, cur_min, i, fin_hour, fin_min, Fin, extra_min,hour;
int arr[1005];
scanf("%d", &tc);
for(i=1; i<=tc; i++){
scanf("%d %d:%d", &bus, &cur_hour, &cur_min);
j=0;
while(bus--){
scanf("%d:%d %d", &fin_hour, &fin_min, &extra_min);
hour=fin_hour-cur_hour;
minute=fin_min-cur_min;
if(hour==0 && minute==0){
hour=0;
minute=0;
}
else if(hour<=0 && minute<0){
hour=24+(fin_hour-cur_hour);
minute=60+(fin_min-cur_min);
hour=hour-1;
}
else if(hour<0 && minute>0){
hour=24+(fin_hour-cur_hour);
}
else if(hour>0 && minute<0){
minute=60+(fin_min-cur_min);
hour=hour-1;
}
else if(hour<0 && minute==0){
hour=24+(fin_hour-cur_hour);
}
hour=(hour*60)+minute+extra_min;
arr[j]=hour;
j++;
}
min=check(arr, j);
printf("Case %d: %d\n", i, min);
}
return 0;
}
0 Comments