QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#83802#4430. Hidden Passwordmagicduck#AC ✓8ms3828kbC++14879b2023-03-03 15:44:582023-03-03 15:44:59

Judging History

你现在查看的是最新测评结果

  • [2023-08-10 23:21:45]
  • System Update: QOJ starts to keep a history of the judgings of all the submissions.
  • [2023-03-03 15:44:59]
  • 评测
  • 测评结果:AC
  • 用时:8ms
  • 内存:3828kb
  • [2023-03-03 15:44:58]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
template <typename T> inline void read(T &F) {
    int R = 1; F = 0; char CH = getchar();
    for(; !isdigit(CH); CH = getchar()) if(CH == '-') R = -1;
    for(; isdigit(CH); CH = getchar()) F = F * 10 + CH - 48;
    F *= R;
}
inline void file(string str) {
    freopen((str + ".in").c_str(), "r", stdin);
    freopen((str + ".out").c_str(), "w", stdout);
}
const int N = 2e5 + 10;
char s[N];
int main() {
    //file("");
    int T; read(T);
    while(T--) {
        scanf("%s", s + 1);
        const int n = strlen(s + 1);
        for(int i = 1; i <= n; i++)
            s[i] = (s[i] - 'a' + 13) % 26 + 'a';
        cout << (s + 1) << '\n';
    }   
    
    #ifdef _MagicDuck
        fprintf(stderr, "# Time: %.3lf s", (double)clock() / CLOCKS_PER_SEC);
    #endif
    return 0;
}

详细

Test #1:

score: 100
Accepted
time: 8ms
memory: 3828kb

input:

20
aeljltfjjqdplqkoevfocfopmigcwtdkehcbrrjrukkjnaozzbpxaiusphivkjbyqqwxyngvkczgilniutalgskhpbcpmwdbjdekkihyuoteiurjvhgixsehjxtqugjzwelxmjqbunoyofvgsomzwrsjrddrmjebpovwebpzmmdbgghyisvqlwalutpffxvypxfphdmnudyjdjsnyhgctmhpzmayzjodaezeoxgkuioqiquffjzndmdqsdjuxlyrviisvczkxeyhpxejksmtohxcfkghsiiiyiliehmks...

output:

nrywygswwdqcydxbrisbpsbczvtpjgqxrupoeewehxxwanbmmocknvhfcuvixwolddjklatixpmtvyavhgnytfxucopczjqowqrxxvulhbgrvhewiutvkfruwkgdhtwmjrykzwdohablbsitfbzmjefweqqezwrocbijrocmzzqottulvfidyjnyhgcsskilckscuqzahqlwqwfalutpgzucmznlmwbqnrmrbktxhvbdvdhsswmaqzqdfqwhkyleivvfipmxkrluckrwxfzgbukpsxtufvvvlvyvruzxfbsw...

result:

ok 20 lines

Extra Test:

score: 0
Extra Test Passed