VJ2-Jamie and Alarm Snooze
2018-02-21 12:44
344 查看
A. Jamie and Alarm Snoozetime 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 notlucky.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 alucky 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
public class Main{
static int x;
static int hh;
static int mm;
private void dec() {
mm = mm - x;
if (mm < 0) {
mm += 60;
hh--;
}
if (hh < 0)
hh += 24;
}
private boolean luck() {
if (hh % 10 == 7 || mm % 10 == 7)
return true;
else
return false;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
x = sc.nextInt();
hh = sc.nextInt();
mm = sc.nextInt();
Main time = new Main();
int i;
for ( i = 0; !time.luck(); i++) {
time.dec();
}
System.out.println(i);
}
}
3 11 23output
2input
5 01 07output
0NoteIn 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.import java.util.*;
public class Main{
static int x;
static int hh;
static int mm;
private void dec() {
mm = mm - x;
if (mm < 0) {
mm += 60;
hh--;
}
if (hh < 0)
hh += 24;
}
private boolean luck() {
if (hh % 10 == 7 || mm % 10 == 7)
return true;
else
return false;
}
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
x = sc.nextInt();
hh = sc.nextInt();
mm = sc.nextInt();
Main time = new Main();
int i;
for ( i = 0; !time.luck(); i++) {
time.dec();
}
System.out.println(i);
}
}
相关文章推荐
- 916A - Jamie and Alarm Snooze
- codeforces 916 A Jamie and Alarm Snooze
- A. Jamie and Alarm Snooze
- 【Codeforces Round #457 (Div. 2) A】 Jamie and Alarm Snooze
- Codeforces Round #457 (Div. 2) A. Jamie and Alarm Snooze简单模拟
- Jamie and Alarm Snooze
- Codefroces 916A Jamie and Alarm Snooze
- A. Jamie and Alarm Snooze
- Jamie and Alarm Snooze(起床时间,延迟闹铃)
- Jamie and Alarm Snooze(暴力+思维)
- 闹钟AlarmAndMusic 和支持播放音乐效果的
- Codeforces-916B:Jamie and Binary Sequence (changed after round)(思维)
- alarm and pause Functions
- codeforces 390A Inna and Alarm Clock
- Hit rate and False alarm rate
- Codeforces 916 C. Jamie and Interesting Graph (构造)
- Using AlarmManager and BroadcastReceiver in Android
- A. Inna and Alarm Clock
- aodh M版本新特性 - queue between alarm evaluator and alarm notifier
- Codeforces Round #457 (Div. 2) C. Jamie and Interesting Graph