Go: package main

import (
  "fmt"
)

func main() {
  var a string
  fmt.Scan(&a)
  for i:= len(a) -1; i>=0; i-- {
    fmt.Print(string(a[i]))
  }
  fmt.Println()
}

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;
}

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

using namespace std;

int main(){

	string A;
	char R;
	cin >> A;

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

	return 0;

}

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

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

int main(){

  string s;

  cin >> s;

  reverse(s.begin(), s.end());

  //abcd
  //int len = s.length();
  // len = 4

  //for(int i = len; i >= 0; i--){
  //cout << s[i];
    //}

  cout << s << endl;

}

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

C++: #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cctype>
#include <cstring>
#include <sstream>
#include <string>
#include <vector>
#include <map>
#include <set>
#include <list>
#include <stack>
#include <queue>
#include <algorithm>
#include <complex>
#include <iterator>
using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<string> vs;

#define all(c) (c).begin(), (c).end()
#define rall(c) (c).rbegin(), (c).rend()
#define tr(c, i) for(auto i = (c).begin(); i != (c).end(); i++)
#define rtr(c, i) for(auto i = (c).rbegin(); i != (c).rend(); i++)
#define repfn(i, a, cont, next) \
  for(auto i = (a); [=](){return(cont);}(); i = [=](){return(next);}())
#define repby(i, a, b, step) repfn(i, a, i < b, i + step)
#define repab(i, a, b) repby(i, (a), (b), 1)
#define rep(i, n) repab(i, 0, (n))
#define pb push_back
#define sz(c) int((c).size())

int main(int argc, char **argv)
{
  string s;
  while (cin >> s) {
    reverse(all(s));
    cout << s << endl;
  }
  return 0;
}

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

using namespace std;

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