#include <iostream> #include <vector> #include <set> #include <climits> #include <algorithm> #include <string> #include <cmath> #include <queue> #include <stack> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; n /= 10; string str; cin >> str; int wyn = 0, c = 0; for (int i = 0; i < str.size(); i++) { if (str[i] == 'T') c++; if ((i+1) % n == 0) { if (c == n) { wyn++; } c = 0; } } cout << wyn; 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 | #include <iostream> #include <vector> #include <set> #include <climits> #include <algorithm> #include <string> #include <cmath> #include <queue> #include <stack> using namespace std; int main() { ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0); int n; cin >> n; n /= 10; string str; cin >> str; int wyn = 0, c = 0; for (int i = 0; i < str.size(); i++) { if (str[i] == 'T') c++; if ((i+1) % n == 0) { if (c == n) { wyn++; } c = 0; } } cout << wyn; return 0; } |