【算法代码】
#include <bits/stdc++.h>
using namespace std;
void nx(string s) { //reverse order
int index=s.size();
int a[index];
while(index) {
index--;
a[index]=s[index]-'0'; //char to num
}
for(int i=s.size()-1; i>=0; i--) {
cout<<a[i];
}
}
void sx(string s) { //sequence order
int index=s.size();
int a[index];
while(index) {
index--;
a[index]=s[index]-'0'; //char to num
}
for(int i=0; i<s.size(); i++) {
cout<<a[i];
}
}
int main() {
string s;
cin>>s;
nx(s);
cout<<endl;
sx(s);
return 0;
}
/*
in:
56789
out:
98765
56789
*/