oj.uz

답안 #1020276

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1020276 2024-07-11T19:12:30 Z ajay Imena (COCI16_imena) C++14
50 / 50
 0 ms 348 KB 
/* Ajay Jadhav */
 
#include <iostream>
#include <cstdio>
#include <algorithm>
#include <deque>
#include <vector>
#include <cstdlib>
#include <iomanip>
#include <cmath>
#include <queue>
#include <map>
#include <set>
#include <stack>
#include <ctime>
#include <string.h>
#include <climits>
#include <cstring>
using namespace std;
 
 
#define ll          long long
#define pb          push_back
#define pii         pair<int,int>
#define vi          vector<int>
#define vii         vector<pii>
#define mi          map<int,int>
#define mii         map<pii,int>
#define all(a)      (a).begin(),(a).end()
#define x           first
#define y           second
#define sz(x)       (int)x.size()
#define hell        1000000007
#define rep(i,a,b)  for(int i=a;i<b;i++)
#define endl        '\n'
  
 
void solve()
{
    int n;
    cin >> n;
    string s;
    int names = 0;
    while (cin >> s) 
    {
        int t = sz(s);
        if (int(s[0]) >= int('A') && int(s[0]) <= int('Z')) 
        {
            bool name = true;
            rep(i, 1, t - 1)
            {
                if (int(s[i]) < int('a') || int(s[i]) > int('z')) 
                {
                    name = false;
                }
            }
           
            if (int(s[t - 1]) >= int('a') && int(s[t - 1]) <= int('z')) 
                name &= true;
            else if (s[t - 1] == '.' || s[t - 1] == '?' ||s[t - 1] == '!') 
                name &= true;
            else if (t > 1) 
                name = false;
            if (name) 
                ++names;
        }
        if (s[t - 1] == '.' || s[t - 1] == '?' ||s[t - 1] == '!') 
        {
            cout << names << '\n';
            names = 0;
        }
    }
}
 
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int t = 1;
    // cin>>t;
    while (t--)
    {
        solve();
    }
    return 0;
}

Subtask #1
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 344 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 348 KB Output is correct