-
Notifications
You must be signed in to change notification settings - Fork 0
/
Copy pathA_A_Blend_of_Springtime.cpp
60 lines (54 loc) · 1.32 KB
/
A_A_Blend_of_Springtime.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
// Neepan Biswas
// neepanb ~ codeforces
#include <bits/stdc++.h>
using namespace std;
#define fr(i, n) for (lli i = 0; i < n; i++)
#define pb push_back
#define sz(x) (lli) x.size()
#define ff first
#define ss second
#define all(v) v.begin(), v.end()
#define debug(x) cout << '>' << #x << ':' << x << endl;
#define cd(condition, value_if_true, value_if_false) ((condition) ? (value_if_true) : (value_if_false))
using lli = long long int;
using ld = long double;
using pi = pair<lli, lli>;
using vp = vector<pi>;
using vi = vector<lli>;
using bl = bool;
using mp = map<lli, lli>;
using ump = unordered_map<lli, lli>;
using str = string;
#pragma GCC optimize("unroll-loops,O3,Ofast")
#pragma GCC target("avx2,avx,fma,bmi,bmi2,lzcnt,popcnt")
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
str s;
cin >> s;
lli cnt = 0;
fr(i, sz(s)-2)
{
if (s[i] != '.')
{
// if (s[i] != s[i + 1] && s[i] != s[i + 2] && s[i + 1] != s[i + 2] && s[i + 1] != '.' && s[i + 2] != '.')
if(s[i]*s[i+1]*s[i+2]==287430)
{
cnt = 1;
break;
}
else
{
cnt = 0;
}
}
}
if (cnt == 1)
{
cout << "YES" << endl;
}
else
cout << "NO" << endl;
return 0;
}