[Offer收割]编程练习赛51 register

Ended

Participants:280

Verdict:Time Limit Exceeded
Score:90 / 100
Submitted:2018-03-18 12:40:29

Lang:G++

Edit
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
#include <string>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <map>
#include <iostream>
using namespace std;
string s;
map<string , int> mmp;
int main() {
    int n;
    cin >> n;
    int cnt = 0;
    for(int i = 0 ; i < n ; i++) {
        cin >> s;
        int len = s.size();
        if(mmp[s]) {
            continue;
        }
        else {
            cnt++;
            mmp[s]++;
            for(int j = 1 ; j < 26 ; j++) {
                for(int k = 0 ; k < len ; k++) {
                    if(s[k] - 1 < 'A') {
                        s[k] = s[k] - 1 + 26;
                    }
                    else {
                        s[k] = s[k] - 1;
                    }
                }
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX