【Codeforces Round #457 (Div. 2) A】 Jamie and Alarm Snooze
2018-01-20 08:47
471 查看
【链接】 我是链接,点我呀:)
【题意】
在这里输入题意
【题解】
暴力往前走x分钟就好。
直到出现7为止。
【代码】
#include <bits/stdc++.h> using namespace std; int hh,mm,x,cnt; bool find7(){ if (hh%10==7 || (hh/10)==7) return true; if (mm%10==7 || (mm/10)==7) return true; return false; } int main(){ #ifdef LOCAL_DEFINE freopen("rush_in.txt", "r", stdin); #endif ios::sync_with_stdio(0),cin.tie(0); cin >> x; cin >> hh >> mm; while (!find7()){ mm-=x; cnt++; if (mm<0){ hh--; mm+=60; if (hh<0){ hh = 23; } } } cout <<cnt<<endl; return 0; }
相关文章推荐
- Codeforces Round #457 (Div. 2) A. Jamie and Alarm Snooze简单模拟
- Jamie and Alarm Snooze(暴力+思维)
- Jamie and Alarm Snooze
- A. Jamie and Alarm Snooze
- VJ2-Jamie and Alarm Snooze
- codeforces 916 A Jamie and Alarm Snooze
- Codefroces 916A Jamie and Alarm Snooze
- Jamie and Alarm Snooze(起床时间,延迟闹铃)
- A. Jamie and Alarm Snooze
- 916A - Jamie and Alarm Snooze
- Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence (changed after round)贪心
- Codeforces Round #229 (Div. 2) Inna and Alarm Clock
- Codeforces Round #229 (Div. 2) A. Inna and Alarm Clock
- Codeforces Round #229 (Div. 2)A. Inna and Alarm Clock
- 【Codeforces Round #457 (Div. 2) B】Jamie and Binary Sequence
- 【Codeforces Round #457 (Div. 2) C】Jamie and Interesting Graph
- Codeforces Round #457 (Div. 2) C. Jamie and Interesting Graph
- Codeforces Round #229 (Div. 2) A. Inna and Alarm Clock
- Codeforces Round #457 (Div. 2)——B. Jamie and Binary Sequence(贪心)
- Codeforces Round #457 (Div. 2) B. Jamie and Binary Sequence(思路+模拟)