Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
code
#include <iostream> #include <string> using namespace std; int main() { string str,key="aaaaaaaaaaaaaaaaaaaa"; cin >> str; for(int i=0; i<str.length(); i++) { if(str[i]+key[i]-'a'+1>'z') str[i]='a'+str[i]+key[i]-'a'+1-'z'; else str[i]+=key[i]-'a'+1; } cout << str; }
run
|
edit
|
history
|
help
0
Shortest path in binary tree
Dar
My First Wall
Graph Theory 2
TraiectorieIdeala
Romberg Integration
Default_Template
TemplateDoubly
Counting top students
Void main