A. Jamie and Alarm Snooze

time limit per test2 secondsmemory limit per test256 megabytesinputstandard inputoutputstandard outputJamie 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: mmcontains the digit '7'.Jamie uses 24-hours clock, so after 23: 59 comes 00: 00.InputThe 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).OutputPrint the minimum number of times he needs to press the button.Examplesinput

3
11 23

output

2

input

5
01 07

output

0

NoteIn 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.
解题说明：此题是一道模拟题，每次向前倒退X分钟，知道数字中出现7位置。

#include<cstdio>
#include<iostream>
#include<string>
#include<cstring>
#include<cmath>
using namespace std;

int main()
{
int hh, mm, x, y = 0;
scanf("%d", &x);
scanf("%d %d", &hh, &mm);
while (hh % 10 != 7 && mm % 10 != 7)
{
mm = mm - x;
y++;
if (mm<0)

{
mm = mm + 60;
hh--;
}
if (hh<0)
{
hh = hh + 24;
}

}
printf("%d\n", y);
return 0;
}