记录编号	616314	评测结果	AAAAAAAAAA
题目名称	[NOIP 2007]守望者的逃离	最终得分	100
用户昵称	终焉折枝	是否通过	通过
代码语言	C++	运行时间	0.034 s
提交时间	2026-06-12 09:28:56	内存使用	3.80 MiB

#pragma GCC optimize(3)
#pragma GCC target("avx")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("inline")
#pragma GCC optimize("-fgcse")
#pragma GCC optimize("-fgcse-lm")
#pragma GCC optimize("-fipa-sra")
#pragma GCC optimize("-ftree-pre")
#pragma GCC optimize("-ftree-vrp")
#pragma GCC optimize("-fpeephole2")
#pragma GCC optimize("-ffast-math")
#pragma GCC optimize("-fsched-spec")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-falign-jumps")
#pragma GCC optimize("-falign-loops")
#pragma GCC optimize("-falign-labels")
#pragma GCC optimize("-fdevirtualize")
#pragma GCC optimize("-fcaller-saves")
#pragma GCC optimize("-fcrossjumping")
#pragma GCC optimize("-fthread-jumps")
#pragma GCC optimize("-funroll-loops")
#pragma GCC optimize("-fwhole-program")
#pragma GCC optimize("-freorder-blocks")
#pragma GCC optimize("-fschedule-insns")
#pragma GCC optimize("inline-functions")
#pragma GCC optimize("-ftree-tail-merge")
#pragma GCC optimize("-fschedule-insns2")
#pragma GCC optimize("-fstrict-aliasing")
#pragma GCC optimize("-fstrict-overflow")
#pragma GCC optimize("-falign-functions")
#pragma GCC optimize("-fcse-skip-blocks")
#pragma GCC optimize("-fcse-follow-jumps")
#pragma GCC optimize("-fsched-interblock")
#pragma GCC optimize("-fpartial-inlining")
#pragma GCC optimize("no-stack-protector")
#pragma GCC optimize("-freorder-functions")
#pragma GCC optimize("-findirect-inlining")
#pragma GCC optimize("-fhoist-adjacent-loads")
#pragma GCC optimize("-frerun-cse-after-loop")
#pragma GCC optimize("inline-small-functions")
#pragma GCC optimize("-finline-small-functions")
#pragma GCC optimize("-ftree-switch-conversion")
#pragma GCC optimize("-foptimize-sibling-calls")
#pragma GCC optimize("-fexpensive-optimizations")
#pragma GCC optimize("-funsafe-loop-optimizations")
#pragma GCC optimize("inline-functions-called-once")
#pragma GCC optimize("-fdelete-null-pointer-checks")
#pragma GCC optimize(2)
#include<iostream>
#include<algorithm>
#include<set>
#include<map>
#include<unordered_map>
#include<cmath>
#include<queue>
#include<stack>
#include<vector>
#include<stdio.h>
#include<stdlib.h>
#include<string>
#include<typeinfo>
#define ll long long
#define ull usigned long long
using namespace std;
namespace Math{
    template<typename T>
    inline T min(T a, T b){return a < b ? a : b;}
    template<typename T>
    inline T max(T a, T b){return a > b ? a : b;}
    template<typename T>
    inline T abs(T x){return x < 0 ? -x : x; }
    template<typename T>
    inline void swap(T &a, T &b){T x = a; a = b, b = x;}
    template<typename T>
    inline void Gmin(T &a, T b){a = b < a ? b : a; }
    template<typename T>
    inline void GMax(T &a, T b){a = b > a ? b : a; }
    template<typename T>
    inline T gcd(T a, T b){return b == 0 ? a : gcd(b, a % b);}
    template<typename T>
    inline T lcm(T a, T b){return (a / gcd(a, b)) * b;}
    template<typename T>
    inline T pow(T x, T n){
        T res = 1;
        while(n){
            if(n & 1) res = res * x;
            n >>= 1; x = x * x;
        }
        return res;
    }
    template<typename T>
    inline T pow(T x, T n, const T Mode){
        T res = 1;
        while(n){
            if(n & 1) res = (res * x) % Mode;
            n >>= 1;
			x = (x * x) % Mode;
        }
        return res % Mode;
    }
}

const int N = 3e5 + 5;
int M, S, T;
int f[N];

int main(){

	cin >> M >> S >> T;

	for(int i = 1;i <= T;i ++){
		f[i] = f[i - 1] + (60 * (M >= 10 ? 1 : 0));
		if(M < 10){
			M += 4;
		}
		else{
			M -= 10;
		}
	}

	for(int i = 1;i <= T;i ++){
		f[i] = max(f[i], f[i - 1] + 17);
		if(f[i] >= S){
			cout << "Yes\n";
			cout << i << '\n';
			return 0;
		}
	}

	cout << "No\n";
	cout << f[T] << '\n';
	return 0;
}