QOJ.ac
QOJ
| ID | Problem | Submitter | Result | Time | Memory | Language | File size | Submit time | Judge time |
|---|---|---|---|---|---|---|---|---|---|
| #100784 | #4430. Hidden Password | Yanagi_Origami# | AC ✓ | 4ms | 4008kb | C++14 | 558b | 2023-04-28 06:09:50 | 2023-04-28 06:09:52 |
Judging History
answer
#include <iostream>
#include <cstdio>
#include <cmath>
#include <cstring>
using namespace std;
#define rep(i,a,b) for(int i=a;i<=b;i++)
#define per(i,a,b) for(int i=a;i>=b;i--)
const int N=2e5+5;
char s[N],a[N];
void solve(){
scanf("%s",s+1);
int n=strlen(s+1);
rep(i,1,n) a[i] = (s[i]-'a'+13)%26 + 'a';
bool fl = 0;
rep(i,1,n) if(a[i]!=s[i]) fl=1;
if(fl) printf("%s\n",a+1);
else puts("NIE");
rep(i,1,n) a[i]=s[i]=0;
}
int main(){
int T;
scanf("%d",&T);
while(T--) solve();
return 0;
}
Details
Tip: Click on the bar to expand more detailed information
Test #1:
score: 100
Accepted
time: 4ms
memory: 4008kb
input:
20 aeljltfjjqdplqkoevfocfopmigcwtdkehcbrrjrukkjnaozzbpxaiusphivkjbyqqwxyngvkczgilniutalgskhpbcpmwdbjdekkihyuoteiurjvhgixsehjxtqugjzwelxmjqbunoyofvgsomzwrsjrddrmjebpovwebpzmmdbgghyisvqlwalutpffxvypxfphdmnudyjdjsnyhgctmhpzmayzjodaezeoxgkuioqiquffjzndmdqsdjuxlyrviisvczkxeyhpxejksmtohxcfkghsiiiyiliehmks...
output:
nrywygswwdqcydxbrisbpsbczvtpjgqxrupoeewehxxwanbmmocknvhfcuvixwolddjklatixpmtvyavhgnytfxucopczjqowqrxxvulhbgrvhewiutvkfruwkgdhtwmjrykzwdohablbsitfbzmjefweqqezwrocbijrocmzzqottulvfidyjnyhgcsskilckscuqzahqlwqwfalutpgzucmznlmwbqnrmrbktxhvbdvdhsswmaqzqdfqwhkyleivvfipmxkrluckrwxfzgbukpsxtufvvvlvyvruzxfbsw...
result:
ok 20 lines
Extra Test:
score: 0
Extra Test Passed