Submission #370976

#TimeUsernameProblemLanguageResultExecution timeMemory
370976maozkurtImena (COCI16_imena)C++17
30 / 50
1 ms384 KiB
#include <cctype> #include <cstdio> #include <cstdlib> #include <cstring> #include <cmath> #include <ctime> #include <iostream> #include <algorithm> #include <queue> #include <map> #include <set> #include <vector> #include <string> #include <stack> #include <numeric> #include <cassert> #define endl '\n' #define sp ' ' #define pb push_back #define mp make_pair #define ff first #define ss second using namespace std; typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll; int main(){ ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);cerr.tie(nullptr); int n;cin>>n; string s; for(int i=0;i<n;i++){ int cur = 0; while(true){ cin >> s; if(isupper(s[0])){ bool valid = true; for(int j = 1;j<(int)s.size()-2;j++){ if(!islower(s[j])){ valid = false; break; } } if(!ispunct(s[s.size()-1]) && !islower(s[s.size()-1])) valid = false; if(valid) cur++; } if(ispunct(s[s.size()-1])) break; } cout << cur << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...