因为这个复制有问题,所以说我就直接截图了,各位将就着看吧
题解:
#include <bits/stdc++.h>
using namespace std;
// typedef long long LL;
using LL = unsigned long long;
using loli = long long;
typedef pair<LL, LL> PLL;
LL read()
{
LL sum = 0, fl = 1;
int ch = getchar();
for (; !isdigit(ch); ch = getchar())
if (ch == '-')
fl = -1;
for (; isdigit(ch); ch = getchar())
sum = sum * 10 + ch - '0';
return fl * sum;
}
#include <queue>
constexpr int P = 998244353;
LL qpow(LL a, LL b)
{
LL res = 1;
while (b)
{
if (b & 1)
res = res * a % P;
a = a * a % P;
b >>= 1;
}
return res % P;
}
#define onani printf("\n")
/*
* .oooooo. oooo oooo .oooooo. .
* d8P' `Y8b `888 `888 d8P' `Y8b .o8
* 888 888 oooo oooo .ooooo. 888 .ooooo. .oooo.o .oooo.o 888 .oooo. .o888oo
* 888 888 `888 `888 d88' `88b 888 d88' `88b d88( '8 d88( '8 888 `P )88b 888
* 888 888 888 888 888ooo888 888 888ooo888 `'Y88b. `'Y88b. 888 .oP'888 888
* `88b ooo 888 888 888 888 .o 888 888 .o o. )88b o. )88b `88b ooo d8( 888 888 .
* `Y8bood8P' o888o `V88V'V8P' `Y8bod8P' o888o `Y8bod8P' 8''888P' 8''888P' `Y8bood8P' `Y888''8o '888' ''
*/
void solve()
{
vector<LL> a(3);
for (auto &x : a)
x = read();
sort(a.begin(), a.end());
if ((a[0] == a[1] && a[1] == a[2]) || (a[1] == a[0] + 1 && a[2] == a[1] + 1))
printf("Yes\n");
else
printf("No\n");
}
int main()
{
solve();
return 0;
}