Submission #74646640

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using ld=long double;
using sti=string;
ll inf=9223372036854775807,mod=998244353;//llの最大値,mod;
ll flg=1,ans=0,sum=0,cnt=0,i=0,j=0,k=0,l=0,mx=-1*inf,mn=inf,len=0;
ll dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
ll dxx[8]={1,1,1,0,-1,-1,-1,0},dyy[8]={-1,0,1,1,1,0,-1,-1};
template<class T> using vc=vector<T>;
template<class T,class TT> using pa=pair<T,TT>;
template<class T> using pq=priority_queue<T>;//大きい順;
template<class T> using rpq=priority_queue<T, vc<T>, greater<T>>;//小さい順;
#define F first
#define S second
#define ed cout<<endl;
#define yes cout<<"yes"<<endl;
#define no cout<<"No"<<endl;
#define as if(flg==0)	cout<<"Yes"<<endl;	else cout<<"No"<<endl;
#define asa(a) if(!flg)	{cout<<"Yes"<<endl;cout<<a<<endl;}	else cout<<"No"<<endl;
#define pb push_back
#define pob pop_back
#define sr(a) sort(a)
#define all(a) a.begin(),a.end()
#define rall(a) a.rbegin(),a.rend()
#define nall(a,b) a,a+b
#define rnall(a,b) a,a+b,greater<int>()
#define rep(i,a,b) for(ll i=(ll)(a);i<(ll)(b);i++)
#define repp(i,a,b) for(ll i=(ll)(a);i<=(ll)(b);i++)
#define rrep(i,a,b) for(ll i=(ll)(b)-1;i>=(ll)(a);i--)
#define rrepp(i,a,b) for(ll i=(ll)(b);i>=(ll)(a);i--)
#define reep(i,a,b,c) for(ll i=(ll)(a);i<(ll)(b);i+=(ll)(c))
#define reepp(i,a,b,c) for(ll i=(ll)(a);i<=(ll)(b);i+=(ll)
#define rreep(i,a,b,c) for(ll i=(ll)(b)-1;i>=(ll)(a);i-=(ll)(c))
#define rreepp(i,a,b,c) for(ll i=(ll)(b);i>=(ll)(a);i-=(ll)(c))
#define rev(x) reverse(x.begin(),x.end())
using vl=vc<ll>;
using vs=vc<sti>;
using mll=map<ll,ll>;
using msl=map<sti,ll>;
using mss=map<sti,sti>;
using mls=map<ll,sti>;
//puts(x==2 ? "1":"0");
int main()
{
	ll m,d;
    cin>>m>>d;
    if((m == 1 && d == 7)||(m == 3 && d == 3)||(m == 5 && d == 5)||(m == 7 && d == 7)||(m == 9 && d == 9)){
        cout<<"Yes"<<endl;
    }
    else{
        cout<<"No"<<endl;
    }
	return 0;
}

Submission Info

Judge Result