# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
167155 | 2019-12-06T07:04:05 Z | Atill83 | Imena (COCI16_imena) | C++14 | 2 ms | 420 KB |
#include <bits/stdc++.h> #define ff first #define ss second #define endl '\n' using namespace std; const long long INF = (long long) 1e18; const int mod = (int) 1e9+7; const int MAXN = (int) 3e5+5; typedef long long ll; typedef unsigned long long ull; typedef pair<int,int> pii; typedef pair<ll,ll> pll; ll n; int main(){ ios_base::sync_with_stdio(false); cin.tie(nullptr);cout.tie(nullptr); #ifdef Local freopen("../IO/int.txt","r",stdin); freopen("../IO/out.txt","w",stdout); #endif cin>>n; int cnt = 0; string s; int count = 0; while(cnt != n){ cin>>s; bool cn = 1; if(s.back() == '.' || s.back() == '!' || s.back() == '?'){ if(!isupper(s[0])){ cn = 0; } for(int i = 1;i < s.length() - 1; i++){ if(!islower(s[i])) cn = 0; } cnt++; if(cn) count++; cout<<count<<endl; count = 0; }else{ if(!isupper(s[0])){ cn = 0; } for(int i = 1;i < s.length(); i++){ if(!islower(s[i])) cn = 0; } if(cn) count++; } } #ifdef Local cout<<endl<<fixed<<setprecision(2)<<1000.0 * clock() / CLOCKS_PER_SEC<< " milliseconds "; #endif }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 2 ms | 376 KB | Output is correct |
2 | Correct | 2 ms | 376 KB | Output is correct |
3 | Correct | 2 ms | 376 KB | Output is correct |
4 | Correct | 2 ms | 420 KB | Output is correct |
5 | Correct | 2 ms | 256 KB | Output is correct |
6 | Correct | 2 ms | 376 KB | Output is correct |
7 | Correct | 2 ms | 376 KB | Output is correct |
8 | Correct | 2 ms | 376 KB | Output is correct |
9 | Correct | 2 ms | 256 KB | Output is correct |
10 | Correct | 2 ms | 420 KB | Output is correct |