UVA 10008 - What's Cryptanalysis?

What's Cryptanalysis?

Cryptanalysis is the process of breaking someone else's cryptographic writing. This sometimes involves some kind of statistical analysis of a passage of (encrypted) text. Your task is to write a program which performs a simple analysis of a given text.

Input 

The first line of input contains a single positive decimal integer  n . This is the number of lines which follow in the input. The next  n  lines will contain zero or more characters (possibly including whitespace). This is the text which must be analyzed.

Output 

Each line of output contains a single uppercase letter, followed by a single space, then followed by a positive decimal integer. The integer indicates how many times the corresponding letter appears in the input text. Upper and lower case letters in the input are to be considered the same. No other characters must be counted. The output must be sorted in descending count order; that is, the most frequent letter is on the first output line, and the last line of output indicates the least frequent letter. If two letters have the same frequency, then the letter which comes first in the alphabet must appear first in the output. If a letter does not appear in the text, then that letter must not appear in the output.

Sample Input 

3
This is a test.
Count me 1 2 3 4 5.
Wow!!!!  Is this question easy?

Sample Output 

S 7
T 6
I 5
E 4
O 3
A 2
H 2
N 2
U 2
W 2
C 1
M 1
Q 1
Y 1

水题

但是写

if(s[j] >= 'a' && s[j] <= 'z') {
                    s[j] = s[j] - 'a' + 'A';
                }
                if(s[j] >= 'A' && s[j] <= 'Z') {
                    a[s[j] - 'A'].num++;
                }

就能AC

写

a[toupper(s[j]) - 'A'].num++;

就RE！！！

康神一眼就看出我的字符串里不一定都是字母，如果是其他字符，toupper一下就必然RE了

#include<cstdio>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<set>
#include<algorithm>
#include<cmath>
#include <cstring>
#include <queue>
using namespace std;
#define eps 1e-20
#define MAXN 100000 + 10
#define outstars cout << "*********" << endl;
char s[MAXN];
struct AA
{
    int id;
    int num;
} a[30];
bool cmp(const AA a , const AA b)
{
    if(a.num == b.num)return a.id < b.id;
    return a.num > b.num;
}
int main()
{
    int n;
    while(scanf("%d",&n)!=EOF)
    {
        for(int i = 0 ; i < 26 ; i++)
        {
            a[i].num = 0;
            a[i].id = i;
        }
        getchar();
        for(int i = 0  ; i < n ; i++)
        {
            gets(s);
            for(int j = 0 ; j < strlen(s) ; j++)
            {
                if(s[j] >= 'a' && s[j] <= 'z') {
                    s[j] = s[j] - 'a' + 'A';
                }
                if(s[j] >= 'A' && s[j] <= 'Z') {
                    a[s[j] - 'A'].num++;
                }
            }
        }
        sort(a , a + 26 , cmp);
        for(int i = 0 ; i < 26 ; i++)
        {
            if(a[i].num)
            {
                printf("%c %d\n",a[i].id + 'A' , a[i].num);
            }
        }
    }

    return 0;
}
/*

*/