UVA 755－487--3279

UVA 755－487–3279

题目大意：相应字母转为数字，找出重复的号码以及重复了几次

解题思路：要注意不足7位的要用0补齐

#include <stdio.h>
#include <string.h>
#include <iostream>
using namespace std;
int cmd(const void *a, const void *b) {
    return (*(int *)a-*(int *)b);
}
int main() {
    int turn[] = {2, 2, 2, 3, 3, 3, 4, 4, 4, 5, 5, 5, 6, 6, 6, 7, 7, 7, 7, 8, 8, 8, 9, 9, 9, 9};
    int n;
    scanf("%d", &n);
    while(n--) {
        char a[100000];
        int m;
        scanf("%d", &m);
        getchar();
        int s[100000] = {0};
        for(int i = 0; i < m; i++) {
            gets(a);
            for(int j = 0; a[j] != '\0'; j++) {
                if(a[j] >= '0' && a[j] <= '9')
                    s[i] = s[i] * 10 + a[j] - '0';
                else if(a[j] >= 'A' && a[j] <= 'Y' && a[j] != 'Q') {
                    int t = a[j] - 'A';
                    s[i] = s[i] * 10 + turn[t];
                }
            }
        }
        qsort(s, m, sizeof(int), cmd);
        int all = 0;
        for(int i = 0; i < m; i++) { 
            int v = 1;
            for(int j = i + 1; j < m; j++) {
                if(s[i] == s[j]) {
                    v++;
                    all = 1;
                    i = j;
                }
                else
                    break;
            }
            if(v != 1)
                printf("%03d-%04d %d\n",s[i] / 10000, s[i] % 10000, v);

        }
        if(all == 0)
            printf("No duplicates.\n");
        if(n)
            printf("\n");
    }
    return 0;
}