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 <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.pop_back();
    }
    for(int i = 0; i < size; ++i){
        std::cout << que.front();
        que.pop();
    }
    return 0;
}

C++: #include <stdio.h>
#include <string.h>
int main(){
    char arry[20];
    scanf("%s",&arry);
    int ln=strlen(arry),i;
    for(i=ln-1;i>=0;i--)
    {
        printf("%c",arry[i]);
    }
    printf("\n");
    return 0;
}

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

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

C++: #include <iostream>
#include <sstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <climits>
#include <cfloat>
using namespace std;

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

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

using namespace std;

void main()
{
	char k[100];
	scanf("%s",k);
	reverse(k,k+strlen(k));
	printf("%s",k);
}

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

using namespace std;

string str_reverse(string s)
{
    string ret;
    int i = s.size() - 1;
    
    while (-1 < i) {
        ret += s[i--];
    }
    
    return ret;
}
 
int main() {
	string str;
	
	cin >> str;
	
	str = str_reverse(str);
	
	cout << str << endl;
	
	return 0;
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
#define REP0(i,n) for(int i=0;i<n;++i)
#define REP1(i,n) for(int i=1;i<=n;++i)
#define ALL(c) (c).begin(),(c).end()
int main(){
	string s;
	cin >> s;
	reverse(ALL(s));
	cout << s << 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];
}

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

int main(){
  char str[20];
  cin >> str;

  for(int i = strlen(str); i > 0 ; i--)
    cout << *(str + i - 1);
  cout << '\n';

  return 0;
}

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

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

  return 0;
}

C++: #include <iostream>
#include <vector>
#include <cmath>
#include <map>
#include <algorithm>

typedef long long ll;
using namespace std;

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

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

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

C++: #include <iostream>
#include <string>
#include <map>
#include <vector>
#include <set>
#include <iomanip>
#include <fstream>
#include <stdint.h>
#include <cmath>
#include <algorithm>
#include <utility>
#include <numeric>
using namespace std;

constexpr int INF       = 1000000000;/* 1e+9a */
constexpr int MODULO    = 1000000007;

#define REP(i,f,n) for(int i=(f); i < (n); ++i)
#define PER(i,f,n) for(int i=(n-1); i >= f; --i)

//----------------------------------
//----------------------------------

signed main()
{
    ios::sync_with_stdio(false);
	string s;
	cin >> s;
	PER(i, 0, s.size())
		cout << s[i] << endl;
}

C++: #include <iostream>
#include <sstream>
#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <algorithm>
#include <functional>

using namespace std;

int gcd( int, int );

int main()
{
	char str[21];

	scanf("%s", str );
	
	vector<char> v( str, str + strlen( str ) );
	reverse( v.begin(), v.end() );

	for ( unsigned int i = 0; i < v.size(); i++ )
	{
		printf("%c", v[i] );
	}

	return 0;
}

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

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

C++: #include<iostream>
#include <cstdio>
#include<cmath>
#include<vector>
#include<algorithm>

using namespace std;

////Nayeem Shahriar Joy,Applied Physics &Electronic Engineering,University of Rajshahi.

int main()

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

C++: #include<iostream>
#include<string.h>
using namespace std;
int main(){
	char bun[25] = {};
	int len;
	cin >> bun;
	len=strlen(bun);
	for(int i=len-1;i>0;i--){
		cout<<bun[i];
	}
	cout<<endl;
	return 0;
}

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

using _i64 = int64_t;
using _u64 = uint64_t;
using _f64 = double;

#define _for(i, start, end) for(_i64 i = (_i64)start; i < (_i64)end; ++i)
#define _rep(i, number) _for(i, 0, number)
#define _foreach(e, data) for(auto& e : data)
#define _all(data) data.begin(), data.end()

template<typename type>
_i64 _size(const type& data) { return static_cast<_i64>(data.size()); }
template<typename type, size_t size>
_i64 _size(const type (&)[size]) { return static_cast<_i64>(size); }

enum _flag : bool { able = true, disable = false };

struct _time {
    _time(_flag flag) { check = flag; if(!check) { return; } gettime(start); }
    ~_time() {
        if(!check) { return; }; gettime(end);
        _i64 elapse = chrono::duration_cast<chrono::milliseconds>(end - start).count();
        cout << endl << "Time: " << elapse << " ms" << endl;
    }
    private:
    using _timer = chrono::time_point<chrono::system_clock>;
    _timer start, end; bool check;
    void gettime(_timer& time) { time = chrono::system_clock::now(); }
};

struct _ini { _ini() { ios::sync_with_stdio(false); cin.tie(nullptr); } } _ini;

int main() {
    {
        _time time(disable);
        string str; cin >> str;
        reverse(_all(str));
        cout << str << endl;
    }
    return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
  string s;
  cin >> s;
  s = string(s.rbegin(),s.rend());
  cout << s << endl;
  return 0;
}

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

using namespace std;

int main ()
{
	string str;
	getline(cin, str);
	for (string::reverse_iterator rit=str.rbegin(); rit!=str.rend(); ++rit)
		cout << *rit;
	cout << endl;
	return 0;
}

C++: #include<iostream>

using namespace std;

int main()
{
        string input;
        int num = 0;
        int i = 0;
        int count = 0;
        char temp[1];

        cin >> input;
        num = input.size();
        char str[num]; //= input.toCharArray(); 

        sprintf(str,"%s",input.c_str());

        if(num % 2 == 0)
        {
                count = num / 2;
        }
        else
        {
                count = (num - 1) / 2;
        }

        for(i = 0;i < count;i++)
        {
                temp[0] = str[i];
                str[i] = str[num -  1 - i];
                str[num - 1 - i] = temp[0];
        }

        string output = string(str);
        cout << output << endl;

}

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

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

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