POJ1002

来源：互联网发布：javascript sha1函数编辑：程序博客网时间：2024/05/08 11:30
#include <iostream>#include <vector>#include <algorithm>using namespace std;const int map[] = {2,2,2,3,3,3,4,4,4,5,5,5,6,6,6,7,0,7,7,8,8,8,9,9,9};int main(){    bool flag = true;    int i,j,n,num,size,left,right,count;    char input[16];    char * pin;    vector<int> pho;    cin >> n;    while (n--) {        cin >> input;        pin = input;        num = 0;        while (*pin) {            if (*pin <= '9'&&*pin >= '0')                num = num * 10 + *pin - '0';            if (*pin <= 'Y'&&*pin >= 'A')                num = num * 10 + map[*pin - 'A'];            pin++;        }        pho.push_back(num);    }    sort(pho.begin(), pho.end());    size = pho.size();    i = 0;    while(i<size){        count = 1;        for (j = i+1; j < size; j++) {            if (pho[j] == pho[i])                count++;            else                 break;        }        if (count!=1) {            left = pho[i] / 10000;            if (left < 100)            {                cout << '0';                if (left < 10)                    cout << '0';            }            right = pho[i] % 10000;            cout << left << '-';            if (right < 1000)            {                cout << '0';                if (right < 100)                    cout << '0';                if (right < 10)                    cout << '0';            }            cout << right << " " << count<< endl;            flag = false;        }        i = j;    }    if (flag) {        cout << "No duplicates." << endl;    }    return 0;}
0 0