Karen is getting ready for a new school day!
It is currently hh:mm, given in a 24-hour format. As you know, Karen loves palindromes, and she believes that it is good luck to wake up when the time is a palindrome.
What is the minimum number of minutes she should sleep, such that, when she wakes up, the time is a palindrome?
Remember that a palindrome is a string that reads the same forwards and backwards. For instance, 05:39 is not a palindrome, because 05:39 backwards is 93:50. On the other hand, 05:50 is a palindrome, because 05:50 backwards is 05:50.
Input The first and only line of input contains a single string in the format hh:mm (00 ≤ hh ≤ 23, 00 ≤ mm ≤ 59).
Output Output a single integer on a line by itself, the minimum number of minutes she should sleep, such that, when she wakes up, the time is a palindrome.
Examples Input 05:39 Output 11 Input 13:31 Output 0 Input 23:59 Output 1 Note In the first test case, the minimum number of minutes Karen should sleep for is 11. She can wake up at 05:50, when the time is a palindrome.
In the second test case, Karen can wake up immediately, as the current time, 13:31, is already a palindrome.
In the third test case, the minimum number of minutes Karen should sleep for is 1 minute. She can wake up at 00:00, when the time is a palindrome.
题意：给一个时间，问再过多久这个时间能变成回文
搜一遍即可
#include<iostream> #include<cstdio> #include<cstring> #include<algorithm> using namespace std; int main() { int n,m; scanf("%d:%d",&n,&m); int i,j; if(n==m/10&&n/10==m) printf("0\n"); else { for(i=1; i<=3600; i++) { m++; int t = m/60; m %=60; n +=t; n %=24; if(n==m/10&&n/10==m) break; } printf("%d\n",i); } return 0; }