A. 【五月份 -- 基础语法组】-- T1 -- 爬虫

zhangyuqiTAT · 2025-05-13 16:35:04 · 个人记录

https://cspjs.online/contest/688/problem/1

#include <bits/stdc++.h>
using namespace std;
struct sb {
    long long n = 0;
    char c = 0;
} sb[28];
int main() {
    freopen("scraper.in", "r", stdin);
    freopen("scraper.out", "w", stdout);
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    string s;
    cin >> s;
    for (int i = 0; i < 26; i++) {
        int k = i;
        sb[i].c = k + 'A';
    }
    int num = s.size();
    for (int i = 0; i < num; i++) {
        if (s[i] <= 'Z' && s[i] >= 'A') {
            sb[s[i] - 'A'].n++;
        } else if (s[i] >= 'a' && s[i] <= 'z') {
            sb[s[i] - 'a'].n++;
        }
    }
    for (int i = 0; i < 26; i++) {
        bool f = 1;
        for (int j = 0; j < 26 - i - 1; j++) {
            if (sb[j].n < sb[j + 1].n) {
                swap(sb[j].n, sb[j + 1].n);
                f = 0;
                swap(sb[j].c, sb[j + 1].c);
            }
        }
        if (f == 1)
            break;
    }
    for (int i = 0; i < 26; i++) {
        if (sb[i].n != 0)
            cout << sb[i].c << " " << sb[i].n << endl;
    }
    return 0;
}