link : https://www.codechef.com/problems/LEGSP
题目大意:
判断 n ≤ m n \le m n≤m 是否成立。
code:
/*
1. sqrt(m*2/3)
*/
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define fi first
#define se second
#define rg register
#define il inline
#define forz(i,a,b) for(register int i((a));i<=(b);++i)
#define forn(i,a,b) for(register int i((a));i>=(b);--i)
#define IOS ios::sync_with_stdio(0),cin.tie(0),cout.tie(0)
inline int read()
{
int x=0,f=1;
char ch=getchar();
while (ch<'0'||ch>'9') {if(ch=='-') f=-1;ch=getchar();}
while (ch>='0'&&ch<='9') {x=(x<<3)+(x<<1)+ch-'0';ch=getchar();}
return x*f;
}
inline void write(int x)
{
if(x<0){putchar('-');x=-x;}
if(x>9) write(x/10);
putchar(x%10+'0');
}
const int maxn=1;
const int mod=993244853;
const int inf=9e18;
inline void solve()
{
int n=read(),m=read();
if(n<m) puts("YES");
else puts("NO");
putchar('\n');
}
signed main()
{
// IOS;
int _=1;
while (_--) solve();
return 0;
}