// #include <bits/stdc++.h> #define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); #include <iostream> #include <vector> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void solve() { } int main() { FAST int n; cin >> n; const int group_size = n / 10; int total = 0; char tmp; for (int i = 0; i < 10; i++) { bool success = true; for (int j = 0; j < group_size; j++) { cin >> tmp; if (tmp == 'N') { success = false; } } if (success) { total++; } } cout << total << endl; }
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 | // #include <bits/stdc++.h> #define FAST ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0); #include <iostream> #include <vector> using namespace std; int gcd(int a, int b) { return b ? gcd(b, a % b) : a; } void solve() { } int main() { FAST int n; cin >> n; const int group_size = n / 10; int total = 0; char tmp; for (int i = 0; i < 10; i++) { bool success = true; for (int j = 0; j < group_size; j++) { cin >> tmp; if (tmp == 'N') { success = false; } } if (success) { total++; } } cout << total << endl; } |