oj.uz

Submission #167157

# Submission time Handle Problem Language Result Execution time Memory
167157 2019-12-06T07:06:17 Z egekabas Imena (COCI16_imena) C++14
50 / 50
 2 ms 376 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
using namespace std;
typedef long long   ll;
typedef unsigned long long   ull;
typedef long double ld;
typedef pair<ll, ll>    pll;
typedef pair<ull, ull>    pull;
typedef pair<int, int>  pii;
typedef pair<ld, ld>  pld;
int n;
int cur;
int ans[10];
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    
//    freopen("in.txt", "r", stdin);
    //freopen("out.txt", "w", stdout);
    
    cin >> n;
    while(cur < n){
        string s;
        cin >> s;
        int upper = 0;
        int size = s.size();
        int next = 0;
        if(s[size-1] == '!' || s[size-1] == '.' || s[size-1] == '?'){
            --size;
            next = 1;
        }
        if(s[0] <= 'Z' && s[0] >= 'A')
            upper = 1;
        for(int i = 1; i < size; ++i)
            if(s[i] > 'z' || s[i] < 'a')
                upper = 0;
        if(upper)
            ++ans[cur];
        cur += next;
    }
    for(int i = 0; i < n; ++i)
        cout << ans[i] << "\n";
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory 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 376 KB Output is correct
5 Correct 2 ms 376 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 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct