#include <iostream> #include <bitset> #include <vector> #include <algorithm> #include <cmath> using namespace std; void solve() { int n, ans=0; string a; bool ok; cin >> n >> a; for (int i = 0; i < 10; i++) { ok = 1; for (int j = 0; j < n/10; j++) { if (a[i*(n/10)+j] == 'N') { ok = 0; break; } } if (ok == 1) ans++; } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); cout << '\n'; 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 34 35 36 37 38 | #include <iostream> #include <bitset> #include <vector> #include <algorithm> #include <cmath> using namespace std; void solve() { int n, ans=0; string a; bool ok; cin >> n >> a; for (int i = 0; i < 10; i++) { ok = 1; for (int j = 0; j < n/10; j++) { if (a[i*(n/10)+j] == 'N') { ok = 0; break; } } if (ok == 1) ans++; } cout << ans; } int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); solve(); cout << '\n'; return 0; } |