/*
* @Description: To iterate is human, to recurse divine.
* @Autor: Recursion
* @Date: 2022-04-05 16:11:33
* @LastEditTime: 2022-04-05 16:46:04
*/
#include <bits/stdc++.h>
#define LL long long
using namespace std;
const int maxn = 1e6 + 10;
const int mod = 1e9 + 7;
const int INF = 1e9 + 10;
const int N = 1e6;
int m,s,t;
int s1,s2;
int main()
{
ios::sync_with_stdio(false);
cin >> m >> s >> t;
for(int i = 1;i <= t;i ++){
s1 += 17;
if(m >= 10){
m -= 10;
s2 += 60;
}
else
m += 4;
if(s1 < s2) s1 = s2;
if(s1 > s){
cout << "Yes" << endl << i;
return 0;
}
}
cout << "No" << endl << s1;
return 0;
}
P1095 [NOIP2007 普及组] 守望者的逃离
最新推荐文章于 2024-04-23 23:02:31 发布