#include <bits/stdc++.h> #define ll long long #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define watch(x) cout << (#x) << " : " << x << '\n' using namespace std; void solve() { int n; cin >> n; string s; cin >> s; assert(n % 10 == 0); int block = n / 10; int ans = 0; for (int i = 0; i < n; i += block) { bool ok = true; for (int j = i; j < i + block; j++) if (s[j] == 'N') ok = false; ans += ok; } cout << ans << '\n'; } int main() { boost; solve(); return 0; }
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 | #include <bits/stdc++.h> #define ll long long #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() #define boost ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0) #define watch(x) cout << (#x) << " : " << x << '\n' using namespace std; void solve() { int n; cin >> n; string s; cin >> s; assert(n % 10 == 0); int block = n / 10; int ans = 0; for (int i = 0; i < n; i += block) { bool ok = true; for (int j = i; j < i + block; j++) if (s[j] == 'N') ok = false; ans += ok; } cout << ans << '\n'; } int main() { boost; solve(); return 0; } |