| n=1 | |
| while n: | |
| data = [int(x) for x in input().split()] | |
| if data[0]==0 and data[1]==0 and data[2]==0 and data[3]==0: | |
| break | |
| if data[0]> data[2] or (data[0]==data[2] and data[1]>data[3]): | |
| time = (60-data[1]) + (23-data[0]+data[2])*60 + data[3] | |
| else: | |
| time = (60-data[1]) + (data[2]-data[0]-1)*60 + data[3] | |
| print(time) | |
| del data[:] |
10 December 2017
uva 11677 - Alarm Clock
Subscribe to:
Post Comments (Atom)
-
This problem is quite easy. Look carefully that if we square root s and take it ceil n, then the abscissa or the ordinate will be equal to ...
-
#include<cstring> #include<iostream> #include<queue> #include<cstdio> using namespace std; const int Maxn = 10...
-
#include<cstdio> #include<queue> #include<map> using namespace std; const int maxt = 1000 + 10; int main() { #if...
No comments:
Post a Comment