forked from ngthanhtrung23/CompetitiveProgramming
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathA.cpp
More file actions
36 lines (29 loc) · 1020 Bytes
/
A.cpp
File metadata and controls
36 lines (29 loc) · 1020 Bytes
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
#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++)
#define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--)
#define REP(i,a) for(int i=0,_a=(a); i<_a; i++)
#define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it)
#define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; }
#define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; }
#define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; }
#define sqr(x) ((x) * (x))
using namespace std;
int n;
string s;
bool good(int u) {
return u < n && s[u] == '*';
}
int main() {
while (cin >> n >> s) {
bool ok = false;
FOR(d,1,n-1) {
REP(i1,n)
if (good(i1) && good(i1+d) && good(i1+2*d)
&& good(i1+3*d) && good(i1+4*d))
ok = true;
}
if (ok) cout << "yes"; else cout << "no";
cout << endl;
}
return 0;
}