A. Karen and Morning
time limit per test2 seconds
memory limit per test512 megabytes
inputstandard input
outputstandard output
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<bits/stdc++.h>
using namespace std;
#define mem(a,b) memset(a,b,sizeof(a))
const int maxn=5;
bool judge(int x,int y)
{
//printf(" %d %d\n",x,y);
int a,b,c,d;
if(x<10)
{
a=0;
b=x;
}
else
{
a=x/10;
b=x%10;
}
if(y<10)
{
c=0;
d=y;
}
else
{
c=y/10;
d=y%10;
}
//printf(" %d %d %d %d\n",a,b,c,d);
if(a==d&&b==c)
return true;
else
return false;
}
int main()
{
int a,b;
while(~scanf("%d:%d",&a,&b))
{
int ans=0;
while(1)
{
if(judge(a,b)) break;
b++;
if(b==60)
{
b=0;
a++;
if(a==24)
a=0;
}
//printf("%d %d\n",a,b);
ans++;
}
printf("%d\n",ans);
}
return 0;
}