Go: package main

import (
	"fmt"
)

func main() {
	var str string
	fmt.Scanf("%s", &str)
	fmt.Printf("%s\n", strReverse(str))
}

func strReverse(str string) string {
	data := []rune(str)
	result := []rune{}

	for i := len(data) - 1; i >= 0; i-- {
		result = append(result, data[i])
	}

	return string(result)
}

C++: #include<stdio.h>

int main(){
char str[21],i;
scanf("%s",str);
for(i=0;;i++){
if(str[i]==/0)
break;
}
for(;i>0;i--){
printf("%s",str[i]);
}
printf("\n");
}

C++: #include<stdio.h>
#include<stdlib.h>
int main(void){
  char a,b,i,j;
  char rarara[1000];
  char papapa[1000]; 
  fgets(rarara,sizeof(rarara),stdin);
 for(i=0;rarara[i]!=NULL;i++){};
 a=i;
  for(i=0;i<a;i++)
    papapa[i]=rarara[a-i-1];
  papapa[a]=NULL;
  printf("%s\n",papapa);
  return;
}

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

//????????????????????§??????
int main()
{
	string str,str2="";
	cin >> str;

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

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

using namespace std;

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

int main()
{
	solve();
	return(0);
}

C++: #include <algorithm>
#include <map>
#include <vector>
#include <iostream>
#include <sstream>
#include <cstdio>
#include <cstring>
#include <cctype>
#include <cstdlib>
#include <cmath>
#include <string>
#include <queue>
using namespace std;

#define REP(i,n) for(int i=0; i<n; ++i)
#define IREP(it,array) for(vector<int>::iterator it=array.begin(); it!=array.end(); ++it)
#define SREP(it,array) for(vector<string>::iterator it=array.begin(); it!=array.end(); ++it)
#define MP make_pair
typedef long long LL;


int main()
{
  cout.setf(ios::fixed, ios::floatfield);
  cout.precision(6);

  int INF = 1000000;

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


  return 0;
}

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

int main()
{
    char str[19];

   gets(str);

   strrev(str);

   printf("%s\n",str);

   return 0;
}

C++: main(c){c=getchar();c^10&&main(c)*putchar(c);}

C++: #include <iostream>

using namespace std;

int main() {

	int l;
	char t, str[21];

	cin >> str;
	l=strlen(str);

	for(int i=0; i<l/2; i++) {
		t=str[i];
		str[i]=str[l-i-1];
		str[l-i-1]=t;
	}

	cout << str;

}

C++: #include <iostream>
#include <vector>
using namespace std;
int main() {
    vector<char> v;
    char c;
    while (cin >> c) {
        v.push_back(c);
    }
    for (auto it = v.rbegin(); it < v.rend(); it++) {
        cout << *it;
    }
    cout << endl;
    return 0;
}

C++: #include <cstdio>
#include <cmath>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <ctime>
#include <queue>
#include <stack>
#include <algorithm>
#include <list>
#include <vector>
#include <set>
#include <map>
#include <iostream>
#include <deque>
#include <complex>
#include <string>
#include <iomanip>
#include <sstream>
#include <bitset>
#include <valarray>
#include <iterator>
using namespace std;
typedef long long int ll;
typedef unsigned int uint;
typedef unsigned char uchar;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef vector<int> vi;

#define REP(i,x) for(int i=0;i<(int)(x);i++)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();i++)
#define RREP(i,x) for(int i=((int)(x)-1);i>=0;i--)
#define RFOR(i,c) for(__typeof((c).rbegin())i=(c).rbegin();i!=(c).rend();i++)
#define ALL(container) container.begin(), container.end()
#define RALL(container) container.rbegin(), container.rend()
#define SZ(container) ((int)container.size())
#define mp(a,b) make_pair(a, b)
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );

template<class T> bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T> bool chmin(T &a, const T &b) { if (a>b) { a=b; return 1; } return 0; }
template<class T> ostream& operator<<(ostream &os, const vector<T> &t) {
os<<"["; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"]"; return os;
}
template<class T> ostream& operator<<(ostream &os, const set<T> &t) {
os<<"{"; FOR(it,t) {if(it!=t.begin()) os<<","; os<<*it;} os<<"}"; return os;
}
template<class S, class T> ostream& operator<<(ostream &os, const pair<S,T> &t) { return os<<"("<<t.first<<","<<t.second<<")";}

const int INF = 1<<28;
const double EPS = 1e-8;
const int MOD = 1000000007;


int n, m;
string str;
main(){
	cin >> str;
	reverse(ALL(str));
	cout << str < endl;
	return 0;
}

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

int main() {

  string input;
  cin >> input;

  for ( int i = 0; i < input.size(); i++ ) {

    cout << input[input.size()-i-1];

  }

  cout << endl;
  return 0;

}

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

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <functional>
#include <iomanip>
#include <utility>
#include <string>
typedef unsigned long ul;

using namespace std;

int main(){
	int len;
	string str;
	cin >> str;
	len = str.length();
	for(int i = len-1; i >= 0; i--){
		cout << str.at(i);
	}
}

C++: #include <bits/stdcc++.h>
using namespace std;

int main() {
char a[21];
scanf("%s",a);
int b=strlen(a);
for(int c=b-1;c!=-1;c--)printf("%c",a[c]);
printf("\n");
}

C++: int main(){
  char buff[100];
  int n;
  scanf("%s",buff);
  for(n = strlen(buff); n;) putchar(buff[--n]);
  puts("");
  return 0;
}

C++: #include <bits/stdc++.h>
using namespace std;
#define repr(i, a, b) for (int i = a; i < b; i++)
#define rep(i, n) for (int i = 0; i < n; i++)
typedef long long ll;

int main(){
    ll j=0;
    string a,b;
    cin >> a;
    for(int i=a.size();i>0;i--){
        b[j++]=a[i-1];
    }
    rep(i,a.size()){
        if(i==a.size()-1) cout << b[i] << endl;
        else cout << b[i];
    }
    return 0;
}

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

using namespace std;

int main(){
	string A;
	char c;
	cin >> A;

	for (int i = 0; i < A.length()/2; i++){
		c = A[i];
		A[i] = A[A.length() - i - 1];
		A[A.length() - i - 1] = c;
	}
	cout << A << '\n';

	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 <iostream>
using namespace std;

int main(){
	cout << "Hello, world!" << endl;
}

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

int main(){
	string str;
	cin>>str;
	for(int i=str.size();i>=0;i--){
		cout<<str[i];
	}
	return 0;
}

C++: #include <iostream>
#include <string.h>
using namespace std;
char a[20];
int CharNumber;
int z = 0;
char temp;

int main()
{
        cin >> a;
        CharNumber = strlen(a);

    for(int x = 0; x < CharNumber; x++)
    {
                for(z = 0; z < CharNumber-x-1; z++)
        {
            temp = a[z+1];
            a[z+1] = a[z];
            a[z] = temp;
        }
    }



        cout << a << endl;


}

C++: #include <iostream>
#include <algorithm>
using namespace std;
 
int main() {
 
    string str;
    while (cin >> str) {
        reverse(str.begin(), str.end());
        cout << str << endl;
    }
 
    return 0;
}

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

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

	string str2;
	int size = (int)str.size();
	str2.resize(size);
	for(int i =0; i<size;++i)
	{
		str2[size-1-i] = str[i];
	}

	cout << str2 << endl;
	return(0);
}

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