| 18799 | 2025-11-05 07:11:26 | diak | Kvázi-Izogram | cpp17 | Accepted 100/100 | 4ms | 556 KiB |
#include <iostream>
#include <string>
#include <algorithm>
using namespace std;
void solve() {
int ans = 0, n; cin >> n; cin.ignore();
while (n--) {
string s; getline(cin, s);
int a[26] = {0}; for (char& e : s) static_cast<int>(e) < 97 ? ++a[e - 65] : ++a[e - 97];
if (none_of(a, a + 26, [](int e){ return e > 2; })) ++ans; }
cout << ans << '\n'; }
int main() { ios::sync_with_stdio(false); cin.tie(nullptr); solve(); return 0; }| Subtask | Sum | Test | Verdict | Time | Memory | ||
|---|---|---|---|---|---|---|---|
| subtask1 | 0/0 | ||||||
| 1 | Accepted | 1ms | 508 KiB | ||||
| 2 | Accepted | 1ms | 316 KiB | ||||
| subtask2 | 30/30 | ||||||
| 3 | Accepted | 1ms | 316 KiB | ||||
| 4 | Accepted | 1ms | 328 KiB | ||||
| 5 | Accepted | 1ms | 500 KiB | ||||
| 6 | Accepted | 1ms | 316 KiB | ||||
| 7 | Accepted | 2ms | 316 KiB | ||||
| subtask3 | 50/50 | ||||||
| 8 | Accepted | 1ms | 316 KiB | ||||
| 9 | Accepted | 1ms | 316 KiB | ||||
| 10 | Accepted | 1ms | 316 KiB | ||||
| 11 | Accepted | 1ms | 316 KiB | ||||
| 12 | Accepted | 1ms | 316 KiB | ||||
| 13 | Accepted | 1ms | 316 KiB | ||||
| subtask4 | 20/20 | ||||||
| 14 | Accepted | 1ms | 316 KiB | ||||
| 15 | Accepted | 2ms | 556 KiB | ||||
| 16 | Accepted | 2ms | 316 KiB | ||||
| 17 | Accepted | 3ms | 500 KiB | ||||
| 18 | Accepted | 4ms | 428 KiB | ||||
| 19 | Accepted | 4ms | 316 KiB | ||||
| 20 | Accepted | 4ms | 332 KiB | ||||