一本通1137
#include <bits/stdc++.h>
#define rep(i,j,n) for(register int i=j;i<=n;i++)
#define Rep(i,j,n) for(register int i=j;i>=n;i--)
#define low(x) x&(-x)
using namespace std ;
typedef long long LL ;
const int inf = INT_MAX >> 1 ;
inline LL In() {
LL res(0) , f(1) ;
register char c ;
#define gc c = getchar()
while(isspace(gc)) ;
c == '-' ? f = - 1 , gc : 0 ;
while(res = (res << 1) + (res << 3) + (c & 15) , isdigit(gc)) ;
return res * f ;
#undef gc
}
string s ;
inline void Ot() {
getline(cin , s) ;
int len = s.length() ;
rep(i,0,len-1) {
if(islower(s[i])) {
char temp = s[i] + 3;
if(temp > 122) temp -= 26;
temp -= 32;
s[i] = temp;
} else if(isupper(s[i])) {
char temp = s[i] + 3 ;
if(temp > 90) temp -= 26;
temp += 32;
s[i] = temp;
}
}
Rep(i,len,1) putchar(s[i-1]) ;
}
signed main() {
// freopen("test.in","r",stdin) ;
return Ot() , 0 ;
}
不存在十全十美的文章 如同不存在彻头彻尾的绝望