Codefroces 916A Jamie and Alarm Snooze

Jamie loves sleeping. One day, he decides that he needs to wake up at exactly hh: mm. However, he hates waking up, so he wants to make waking up less painful by setting the alarm at a lucky time. He will then press the snooze button every x minutes until hh: mm is reached, and only then he will wake up. He wants to know what is the smallest number of times he needs to press the snooze button.

A time is considered lucky if it contains a digit ‘7’. For example, 13: 07 and 17: 27 are lucky, while 00: 48 and 21: 34 are not lucky.

Note that it is not necessary that the time set for the alarm and the wake-up time are on the same day. It is guaranteed that there is a lucky time Jamie can set so that he can wake at hh: mm.

Formally, find the smallest possible non-negative integer y such that the time representation of the time x·y minutes before hh: mm contains the digit ‘7’.

Jamie uses 24-hours clock, so after 23: 59 comes 00: 00.

Input
The first line contains a single integer x (1 ≤ x ≤ 60).

The second line contains two two-digit integers, hh and mm (00 ≤ hh ≤ 23, 00 ≤ mm ≤ 59).

Output
Print the minimum number of times he needs to press the button.

Examples
input
3
11 23
output
2
input
5
01 07
output
0
Note
In the first sample, Jamie needs to wake up at 11:23. So, he can set his alarm at 11:17. He would press the snooze button when the alarm rings at 11:17 and at 11:20.

In the second sample, Jamie can set his alarm at exactly at 01:07 which is lucky.

【分析】：自己当时真的是low 题意读错了 怪不得一直A不了 还是英语差呀
题目大意：Jamie要起床 但是要一定在带 ‘’7‘’的时候设定闹钟才可以，因为他认为那样是lucky的。然后给你了个 x，hh，mm。然后问你 经过几干x可以达到他的幸运时间
【代码思路】 ：直接向前暴力x 看什么时候有‘7’，在这里要注意分钟不够时小时借，当然也可以是前一天也就是hh=0时，再借就变成了23.

【代码】：

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <cstring>
#include <string>

using namespace std;
const int N=5e5+10;
int mm,hh;

int f()
{
    if(hh%10==7||hh/10==7)
        return 1;
    if(mm%10==7||hh/10==7)
        return 1;
    return 0;
}

int main()
{

    ios::sync_with_stdio(false);
    int x;
    while(cin>>x>>hh>>mm)
    {
        int ans=0;
        while(!f())
        {
            mm-=x;
            ans++;
            if(mm<0)
            {
                hh--;
                mm+=60;
            }
            if(hh<0)
                hh=23;
        }
        cout<<ans<<endl;
    }


    return 0;
}