Run Code
|
API
|
Code Wall
|
Misc
|
Feedback
|
Login
|
Theme
|
Privacy
|
Patreon
decode
#include <iostream> #include <string> using namespace std; int main() { string str,key="aaaaaaaaaaaaaaaaaaaa"; cin >> str; for(int i=0; i<str.length(); i++) { str[i]-=key[i]-'a'+1; if(str[i]<'a') str[i]=str[i]+'z'-'a'; } cout << str; }
run
|
edit
|
history
|
help
0
reverse function
Comp Conexe
Best way for getting more precision no.
Simulare 2022
virtual function
Algoritm(prelucrare cifre)
Graph Theory On Strings
Polimorfizm :)
Using initializer_list<T>
FindMissingLagrange