Go: package main

import (
	"bufio"
	"fmt"
	"os"
)

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	s := sc.Text()
	l := len(s)
	r := make([]rune, l)
	for i, c := range s {
		r[l-i-1] = c
	}
	fmt.Println(string(r))
}

C++: #include <iostream>
#include <vector>
#include <math.h>
#include <string>

int main(void);
std::string rev_string(std::string str);


int main(){
	std::string str = "";
	//char str[20];
	std::cin >> str;
	std::cout << rev_string(str);

	//while (1);
	return 0;
}

//*
std::string rev_string(std::string str){
	int i;
	int len = str.length();
	for (i = 0; i < len / 2; i++) {
		char temp = str[i];
		str[i] = str[len - i - 1];
		str[len - i - 1] = temp;
	}

	return str;
}
//*/

C++: #include <iostream>
#include <cstring>
using namespace std;
char ary[30];
int main(){
	cin>>ary;
	int N=strlen(ary);
	for(int i=N-1;i>=0;i--){
		cout<<ary[i];
	}
	cout<<endl;
	return 0;
}

C++: #include <iostream>
#include <cstring>
#include <cstdio>

using namespace std;

void sort(char *str){
	int len, len3 = 0;
	char str2[20], work; 
	len = strlen(str);

	for(int len2 = 0; len > len2; len2++){
		str2[len2] = str[len2];
	}

	for(len3 = 0, len = len - 1; len >= len3; len--,len3++){
		work = str[len];
		str[len] = str[len3];
		str[len3] = work;
	}
}

int main(){
	char str[20];
	while (cin >> str) {
		sort(str);
		cout << str << endl;
	}
}

C++: #include<bits/stdc++.h>
using namespace std;
int main(){
	string str;
	getline(cin >> ws, str);
	reverse(str.begin(), str.end());
	cout << str << endl;
}

C++: #include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<stdio.h>
#include<cmath>
#include<vector>
#include<utility>
#include<stack>
#include<queue>

#define FOR(i, a, b) for(int i=(a);i<=(b);i++)
#define RFOR(i, a, b) for(int i=(a);i>=(b);i--)
#define MOD 1000000007

using namespace std;

int main(void) {
	string s;
	cin >> s;

	RFOR(i, s.size() - 1, 0) {
		cout << s[i];
	}
	cout << endl;
	return 0;
}

C++: #include<iostream>
#include<string.h>
using namespace std;

int main(){
	int i,len;
	char str[20];

	cin >> str;

	len = strlen(str);

	for(i = len-1; i >= 0; i--)
		cout << str[i];

	cout << endl;

	return 0;
}

C++: #include<iostream>
#include<string>

using namespace std;

int main(){
	char str[25];
	int i, num;
	
	cin >> str;

	num = strlen(str);

	for(i = num - 1; i >= 0; i --){
		cout << str[i];
	}
	cout << endl;
}

C++: #include <cstdio>
#include <cstring>
#include <algorithm>
using std::__gcd;
using std::sort;
int main(){
	char s[100];
	scanf("%s",s);
	int l = strlen(s);
	for(int i=l-1;i>=0;--i)
		putchar(s[i]);
	putchar('\n');
	return 0;	
}

C++: #include <iostream>
#include <istream>

using namespace std;

int main(){
	char line[20];
	int a=0;
	
while(cin>>line){
	for(a; line[a] != 0x00 ;a++);
	a--;
	for(a;a>=0;a--){
	cout<<line[a];
	}
	cout<<endl;
}


return 0;
}

C++: #include <stdio.h>
int main(void){
    char s[22]={'\n'},*p;
    gets(s+1);
    for(p=s;*p++;);
    for(p--;s<=p;p--)putchar(*p);
    return 0;
}

C++: #include <iostream>
#include <string>
#include <queue>

int main(){
    std::string str;
    std::queue<char> que;
    std::cin >> str;
    const int size = str.size();
    for(int i = 0; i < size; ++i){
        que.push(str.back());
        str.erase(str.size() - 1, 1);
    }
    for(int i = 0; i < size; ++i){
        std::cout << que.front();
        que.pop();
    }
    return 0;
}

C++: #include <iostream>
#include <string>

using namespace std;

int main() {
	string str;
	cin>>str;

	for(int i=str.size()-1; i>=0; i++){
		cout<<str[i];
	}
	cout<<endl;
	return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

long long int gcd(long long int l, long long int r) {
	assert(l > 0 && r > 0);
	if (l > r)return gcd(r, l);
	else {
		const long long int num = r%l;
		if (num) {
			return gcd(l, num);
		}
		else {
			return l;
		}
	}
}
long long int lca(long long int l, long long int r) {
	return l / gcd(l, r)*r;
}
int main() {
	string st; cin >> st;
	reverse(st.begin(), st.end());%
	return 0;
}

C++: #include<iostream>
#include<string>

using namespace std;

#define loop(i,a,b) for(int i = a; i < b ; i ++)
#define rep(i,a) loop(i,0,a)

int main(void){
  string s;
  cin>>s;
  for(int i = s.size() - 1 ; i >= 0 ; i --){
    cout<<s[i];
  }
  cout<<endl;

}

C++: #include <iostream>
#include <string>
using namespace std;

int main() {
	int i;
	string s;
	cin >> s;
	for (i = 0; i <= 20; i++) {
		if (s[i] == 0)
			break;
	}
	for (i--; i >= 0; i--) {
		cout << s[i];
	}
	//cout << endl;
	return 0;
}

C++: #include <iostream>
#include <string>
using namespace std;

int main()
{
	string x;
	cin >> x;
		for(int i=x.length()-1;i>=0;i--)
			cout << x[i];
	cout<<"\n";
}

C++: #include <stdio.h>
int main(void){
    char s[21],*p;
    gets(s);
    for(p=s;*p++;);
    for(p--;s<=p;p--)putchar(*p);
    puts("");
    return 0;
}

C++: #include "bits/stdc++.h"
using namespace std;

int main()
{
    string a;
    char b;
    cin >> a;
    for (int i = 0; i < a.size() / 2; i++)
    {
        b = a[i];
        a[i] = a[a.size() - 1 - i];
        a[a.size() - 1 - i] = b;
    }
    cout << a << endl;
}

C++: #include<stdio.h>



int main(){
	char c[20];

	scanf("%s",c);
	int i;

	for(i=0;i<20;i++){
		if((int(c[19-i])!=-52)&&(int(c[19-i]!=0))){
			printf("%c",c[19-i]);
		}
	}


	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <string.h>

using namespace std;
static const int MAXV = 21;

int main() {
  char A[MAXV]={};
  cin >> A;
  int i=0;
  for(;i<MAXV;i++) {
    //printf("%c", A[i]);
    if (A[i] == 0) break;
  }
  i--;
  for(;i!=-1;i--) {
    printf("%c", A[i]);
  }
}

C++: #include <iostream>
#include<string>
using namespace std;

int main()
{
  string a;
  cin>>a;
  for(int b=a.length()-1;b!=-1;b--){
    cout<<a[b];
  }
  cout<<endl;
  return 0;
}

C++: #include<iostream>
#include<string>
using namespace std;

int main(){
	string str;
	cin >> str;
	
	string::reverse_iterator it = str.rbegin();
	while(it != str.rend()){
		cout << *it;
		it++;
	}
	cout << endl;
	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <cstring>
#include <climits>
#include <cmath>
#include <cfloat>

#define FOR(i,b,n) for(int i=b;i<n;i++)
#define CLR(mat) memset(mat, 0, sizeof(mat))
#define INF 1<<25

using namespace std;

string str, rstr;

int main()
{
	while( cin >> str, !cin.eof())
	{
		rstr = string( str.rbegin() , str.rend() );

		cout << rstr << endl;
	}

	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<math.h>

#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>0;i--)
#define CLR(a)      memset((a),0,sizeof(a))
#define MCLR(a)     memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

int main(){
	string str;
	int i;
	cin >> str;
	RREP(i,str.size()){
		cout << str[i-1];
	}
	cout << endl;
	return 0;
}