16382022-11-30 21:31:22TimiKvázi-Izogramcpp11Accepted 100/10061ms4328 KiB
#include <iostream>
#include <string>
#include <cctype>
#include <map>
using namespace std;

int main()
{
    int n, db=0;
    string s;
    map<char, int> betuk;
    cin>>n;
    cin.get();
    for (int i=0; i<n; i++)
    {
        getline(cin,s);
        for (int j=0; j<s.size(); j++)
        {
            if ((tolower(s[j])>='a')&&(tolower(s[j])<='z'))
            betuk[tolower(s[j])]++;
        }
        int ok=0;
        for (auto it : betuk)
            if (it.second>2)
              ok++;
        if (ok==0)
            db++;
        betuk.clear();
    }
    cout<<db;
    return 0;
}
SubtaskSumTestVerdictTimeMemory
subtask10/0
1Accepted3ms1812 KiB
2Accepted2ms2004 KiB
subtask230/30
3Accepted2ms2208 KiB
4Accepted2ms2452 KiB
5Accepted2ms2560 KiB
6Accepted2ms2692 KiB
7Accepted4ms2728 KiB
subtask350/50
8Accepted2ms2820 KiB
9Accepted3ms3024 KiB
10Accepted3ms3224 KiB
11Accepted3ms3432 KiB
12Accepted3ms3512 KiB
13Accepted3ms3616 KiB
subtask420/20
14Accepted4ms3504 KiB
15Accepted8ms3912 KiB
16Accepted14ms3860 KiB
17Accepted26ms3980 KiB
18Accepted43ms3996 KiB
19Accepted54ms4084 KiB
20Accepted61ms4328 KiB