Go: package main

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

func reverse(s string) string {
	runes := []rune(s)
	for i, j := 0, len(runes)-1; i < j; i, j = i+1, j-1 {
		runes[i], runes[j] = runes[j], runes[i]
	}
	return string(runes)
}

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	input := scanner.Text()
	fmt.Println(reverse(input))
}

C++: #include <bits/stdc++.h>

int main () {
assdasd
asd
a
sd
a
sda
sd
a
s
d
as
d
as
dassssssssssssssssssss
}

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

int main(){
	char in[30];
	char out[30];
	cin >> in;
	int length = strlen(in);
	for(int i = 0; i<=length;i++){
		out[i] = in[length -i-1];	
	}
	out[length] = in[length];
	cout << out << endl;
	return 0;
}

C++: #include<iostream>
using namespace std;
int main(){string s;cin>>s;int i,l=s.length();for(i=1;i<=l;i++)cout<<s.at(l-i);cout<<endl;}

C++: #include <iostream>
using namaspace std;
int main(){
	char str[20],i=-1;
	for (;;){	
		i++;
		while(cin>>str[i]==EOF) break;
	}
	for (int A=i;A>=0;A--)cout<<str[i];
	cout<<endl;
	return 0;
}

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

int main(int argc, const char * argv[])
{
    int i, k;
    char input[21];
    for (i = 0; i < 20; i++) {
        input[i] = getchar();
        if (input[i] == '\n') {
            break;
        }
    }
    for (k = i - 1; k >= 0; k--) {
        cout << input[k];
    }
    cout << endl;
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<cstring>
#define loop(i,a,b) for(int i=a ;i < b ; i++)
#define rep(i,a) loop(i,0,a)
using namespace std;

int main(void){
	string a;

	getline(cin,a);
	
	for(int i=a.size();0<=i;i--)cout<<a[i];
	cout<<endl;
	return 0;
}

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

int main(){
  string str;
  int num;
  
  std::cin >> str;
  num = str.length();
  
  for(int i=num-1; i>=0; i--){
    std::cout << str[i];
  }
  std::cout << std::endl;

  return 0;
}

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

using namespace std;

int main(){
    string str;

    while (cin >> str)
    {
        for (int i = str.length() - 1; i >= 0;i--) {
            cout << str[i];
        }

            cout<< endl;
    }
    
    return 0;
}

C++: #include<iostream>
#include<iomanip>
#include<cstdio>
#include<vector>
#include<algorithm>
#include<cmath>
#include<queue>
#include<stack>
#include<functional>
#include<string>
#include<cstring>
#include <sstream>
using namespace std;
int main(void){
    string str;
    while(cin >> str){
        reverse(str.begin(),str.end());
        cout << str << endl;
    }
    return 0;
}

C++: #include <cstdio>
#include <cstring>
using namespace std;

char str[10000];

int main() {
  scanf("%s", str);
  int n = strlen(str);

  for (int i=n-1; i>=0; i--) {
    printf("%c", str[i]);
  }
  puts("");
}

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

int main(){
	string str;
	cin >> str;
	reverse(str.begin(), str.end());
	cout << str.c_str();
	return 0;
}

C++: #include <bits/stdc++.h>
#define rep(i,a) for(i=a-1;i>=0;i--)
using namespace std;

int main(void){
    int i;
    string str;
    cin >> str;
    rep(i,str.length()) {
        cout << str[i];
    }
    cout << endl;
    return 0;
}

C++: #include <stdio.h>
#include <string.h>

int main(){
    char str[21];

    scanf( "%s",str );

    int strL = strlen( str );

    for( int i = strL;i >= 0;i-- ){
        printf( "%c",str[i] );
    }
    return 0;
}

C++: #include<stdio.h>
#include<cstring>
using namespace std;
int main()
{
   char str[21];
   scanf("%s",str);
  int l=strlen(str);
   for(char* p=str+l-1;p>=str;p--)
      printf("%c",*p);
   printf("\n");
   return 0;

}

C++: #include <stdio.h>

    int main(void){
    char str[100];
    int i;
    int count=0;
    
    scanf("%s",str);
    
    for(i=0;str[i]!='\0';i++){
        count++;
    }
    for(i=count-1;i>=0;i--){
        printf("%c",str[i]);
    }
    printf("\n");

    return 0;
}

C++: #include<bits/stdc++.h>
#define pb push_back
using namespace std;
typedef long long ll;
struct edge{int to;ll cost;};
typedef pair<ll,int> P;
const ll INF=1000000000000LL;
const ll MOD=1000000007LL;
const ll MAX=100010;
int main(){
	string  s;
	cin>>s;
	reverse(s.begin(),s.end());
	cout<<s<<endl;
	return 0;
}

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


int main()
{
        int i; 
       string str;

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

C++: #include<cstdio>
#include<ctype.h>
#include<iostream>
#include <algorithm>
using namespace std;

int main(){
    int cut=1;
    char c[21]={0};
    for(int i=0;i<20;i++){
        scanf("%c",&c[i]);
        if(c[i]=='\n')break;
            cut++;
        if (48<=c[i]&&c[i]<=57)c[i]+=0;
        else if (65<=c[i]&&c[i]<=90)c[i]+=0;
        else if (97<=c[i]&&c[i]<=122)c[i]+=0;
        else{
            c[i]='\0';
            }
    }
    for(int j=cut;j>-1;--j){
        printf("%c",c[j]);
    }
        cout <<""<<endl;
    return 0;
}

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

int main(){
	char str[30], *end_p;
	int end;;
	cin >>str;
	
	end_p = strrchr(str, '\0');
	end = end_p - str;
	
	for(int i = (end - 1); i >= 0; i--){
		cout <<str[i];
	}
	
	cout <<endl;
	return 0;
}

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

using namespace std;

int main(void){

  string hoge;

  cin >> hoge;

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

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

using namespace std;

int main() {
	string str;
	cin >> str;
	reverse(str.begin(), str.end());
	cout << str << endl;
	return 0;
}

C++: #include <iostream>
#include <string>
#include <vector>
#include <deque>
#include <queue>
#include <stack>
#include <map>
#include <algorithm>
#include <set>
#include <sstream>
#include <numeric>
#include <bitset>
#include <complex>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <climits>
#include <cctype>
#include <cassert>
using namespace std;
 
typedef long long ll;
static const double EPS = 1e-8;
static const double PI = 4.0 * atan(1.0);
bool ISINT(double x){return fabs(x-(int)round(x))<EPS;}
bool ISEQ(double x,double y){return fabs(x-y)<EPS;}
string itos(ll x){stringstream ss;ss<<x;return ss.str();}
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin();itr!=c.end();itr++)
 
int main(void){
  string s;
  cin >> s;
  reverse(s.begin(), s.end());
  cout << s << endl;
}

C++: #include<stdio.h>
#include<string.h>

int main(){
	char str[21],reverse[21];
	int num,i;
	num=scanf("%21s",str);
	
	for(i=0;i<21;i++){
		if (str[i]==EOF) break;
	}
	
	num=strlen(str)-1;//i-1;
	
	for(i=0;i<=num;i++){
		reverse[i]=str[num-i];
	}
	
	printf("%s\n",reverse);
	
	return 0;
}

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

int main(){
	char str[20];
	scanf("%s",str);
	reverse(str,str + strlen(str));
	printf("%s\n",str);
	return 0;
}

C++: main(a){~scanf("%c",&a)&&(main(),printf("%c",a));}

C++: #include<iostream>
#include<string>
using namespace std;
int main(){
	string s;
	cin >> s;
	if(s.size()<=20){
		for(int i=s.size();;i--){
			cout << s[i];
		}
		cout << endl;
	}
	return 0;
}

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

int main()
{
	std::string str;
	std::cin >> str;
	for (auto e = str.rbegin(); e < str.rend(); ++e)
		std::cout << *e;
	std::cout << std::endl;

	return 0;
}