# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
248688 | 2020-07-13T07:19:44 Z | Vladikus004 | Imena (COCI16_imena) | C++14 | 0 ms | 384 KB |
#include <bits/stdc++.h> #define inf 2e9 #define all(v) v.begin(), v.end() using namespace std; typedef long long ll; typedef long double ld; typedef pair <int, int> pii; int n; bool check(string &s){ int cnts = 0; for (int i = 1; i < s.size() - 1; i++) if (s[i] >= 'a' && s[i] <= 'z') cnts++; if ((s.back() >= 'a' && s.back() <= 'z') || (s.back() == '.' || s.back() == '?' || s.back() == '!')) cnts++; return (s[0] >= 'A' && s[0] <= 'Z' && cnts == s.size() - 1); } int main() { // ios_base::sync_with_stdio(false); // cin.tie(0); // #ifdef LOCAL // freopen("input.txt", "r", stdin); // #endif // LOCAL int cnt = 0; string s; while (cin >> s){ // if (s == "aue") break; if (check(s)) cnt++; if (s.back() == '.' || s.back() == '!' || s.back() == '?'){ cout << cnt << "\n"; cnt = 0; } } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 256 KB | Output is correct |
2 | Correct | 0 ms | 256 KB | Output is correct |
3 | Correct | 0 ms | 256 KB | Output is correct |
4 | Correct | 0 ms | 256 KB | Output is correct |
5 | Correct | 0 ms | 256 KB | Output is correct |
6 | Correct | 0 ms | 256 KB | Output is correct |
7 | Correct | 0 ms | 256 KB | Output is correct |
8 | Correct | 0 ms | 256 KB | Output is correct |
9 | Correct | 0 ms | 384 KB | Output is correct |
10 | Correct | 0 ms | 256 KB | Output is correct |