Result: Accepted
Time: 3ms
Memory: 1756kB
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<iostream>
#include<stdlib.h>
#include<math.h>
#include<map>
#include<set>
#include<queue>
#include<vector>
using namespace std;
int T,t,y,m;
char s[1100];
double p,q;
int main()
{
long long n,x,ans;
while(~scanf("%s",s)){
int len=strlen(s);
for(int i=0;i<len;i++){
if(s[i]=='a'||s[i]=='b'||s[i]=='c') s[i]='2';
else if(s[i]=='d'||s[i]=='e'||s[i]=='f') s[i]='3';
else if(s[i]=='g'||s[i]=='h'||s[i]=='i') s[i]='4';
else if(s[i]=='j'||s[i]=='k'||s[i]=='l') s[i]='5';
else if(s[i]=='m'||s[i]=='n'||s[i]=='o') s[i]='6';
else if(s[i]=='p'||s[i]=='q'||s[i]=='r'||s[i]=='s') s[i]='7';
else if(s[i]=='t'||s[i]=='u'||s[i]=='v') s[i]='8';
else if(s[i]=='w'||s[i]=='x'||s[i]=='y'||s[i]=='z') s[i]='9';
if(s[i]>=65&&s[i]<=90){
s[i]+=32;
if(s[i]=='z') s[i]='a';
else s[i]+=1;
}
}
printf("%s\n",s);
}
}