#include <iostream> #include <vector> #include <map> #include <algorithm> using namespace std; #define pb push_back #define mp make_pair #define st first #define nd second #define x first #define y second typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int m = n/10; int cnt = 0; for(int i=0; i<10; i++){ bool cnd = true; for(int j=0; j<m; j++){ char c; cin >> c; if(c=='N'){ cnd=false; } } if(cnd==true){ cnt++; } } cout << cnt; 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 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 | #include <iostream> #include <vector> #include <map> #include <algorithm> using namespace std; #define pb push_back #define mp make_pair #define st first #define nd second #define x first #define y second typedef long long ll; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef vector<int> vi; typedef vector<ll> vll; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr); int n; cin >> n; int m = n/10; int cnt = 0; for(int i=0; i<10; i++){ bool cnd = true; for(int j=0; j<m; j++){ char c; cin >> c; if(c=='N'){ cnd=false; } } if(cnd==true){ cnt++; } } cout << cnt; return 0; } |