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.
The first and only line of input contains a single string in the format hh:mm (00 ≤ hh ≤ 23, 00 ≤ mm ≤ 59).
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.
05:39
11
13:31
0
23:59
1
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 <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
#define CLR(x,y) memset(x, y, sizeof(x))
using namespace std;
int bw(int hh, int mm)
{
int ha, hb, ma, mb;
ha = hh / 10;
hb = hh % 10;
ma = mm / 10;
mb = mm % 10;
if(ha == mb && hb == ma) return 0;
return 1;
}
int main()
{
int hh, mm, ha, hb, ma, mb, count = 0, t;
scanf("%d:%d", &hh, &mm);
t = bw(hh, mm);
while(t)
{
mm++;count++;
if(mm==60) {mm = 0; hh++;}
if(hh==24) {hh = 0;}
t = bw(hh, mm);
}
cout << count << endl;
return 0;
}