h=[]
m=[]
for _ in range(2):
x,y = list(map(int, input().split(':')))
h.append(x)
m.append(y)
h[0]=h[0]-h[1]
m[0]=m[0]-m[1]
if m[0]<0:
h[0]-=1
m[0]+=60
if h[0]<0:
h[0]+=24
if h[0]>=0 and h[0]<=9:
h[0]='0'+str(h[0])
if m[0]>=0 and m[0]<=9:
m[0]='0'+str(m[0])
print(f"{h[0]}:{m[0]}")#include <cstdio>
int main() {
int h[2], m[2];
for(int i = 0; i < 2; i++)
scanf("%d:%d", &h[i], &m[i]);
h[0] -= h[1];
m[0] -= m[1];
if (m[0] < 0)
m[0] += 60, h[0]--;
if (h[0] < 0)
h[0] += 24;
printf("%02d:%02d\n", h[0], m[0]);
return 0;
}70. Climbing Stairs | 53. Maximum Subarray |
1527A. And Then There Were K | 1689. Partitioning Into Minimum Number Of Deci-Binary Numbers |
318. Maximum Product of Word Lengths | 448. Find All Numbers Disappeared in an Array |
1155. Number of Dice Rolls With Target Sum | 415. Add Strings |
22. Generate Parentheses | 13. Roman to Integer |
2. Add Two Numbers | 515. Find Largest Value in Each Tree Row |
345. Reverse Vowels of a String | 628. Maximum Product of Three Numbers |
1526A - Mean Inequality | 1526B - I Hate 1111 |
1881. Maximum Value after Insertion | 237. Delete Node in a Linked List |
27. Remove Element | 39. Combination Sum |
378. Kth Smallest Element in a Sorted Matrix | 162. Find Peak Element |
1529A - Eshag Loves Big Arrays | 19. Remove Nth Node From End of List |
925. Long Pressed Name | 1051. Height Checker |
695. Max Area of Island | 402. Remove K Digits |
97. Interleaving String | 543. Diameter of Binary Tree |