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>
#include<string.h>
int main(){
	char a[20];
	scanf("%s",&a);
	for(int i=strlen(a)-1;i>=0;i--){
		printf("%c",a[i]);
	}
	return 0;
}

C++: #pragma GCC optimize "O3"
#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cctype>
#include <string>
#include <cstring>
#include <ctime>
#define whole(f,x,...) ([&](decltype((x)) whole) { return (f)(begin(whole), end(whole), ## __VA_ARGS__); })(x)
#define ALL(a)  (a).begin(),(a).end()
#define RALL(a) (a).rbegin(), (a).rend()
#define PB push_back
#define MP make_pair
#define SZ(a) int((a).size())
#define EACH(i,c) for(typeof((c).begin()) i=(c).begin(); i!=(c).end(); ++i)
#define EXIST(s,e) ((s).find(e)!=(s).end())
#define SORT(c) sort((c).begin(),(c).end())
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define REP_FROM(i,m,n) for (int i = (m); (i) < int(n); ++(i))
#define REP_REV(i,n) for (int i = (n)-1; (i) >= 0; --(i))
#define REP_FROMREV(i,m,n) for (int i = (n)-1; (i) >= int(m); --(i))
#define CLR(a) memset((a), 0 ,sizeof(a))
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define debug(x) cerr << #x << " = " << (x) << " (L" << __LINE__ << ")" << " " << __FILE__ << endl;
#ifndef LOCAL
#define cerr if (false) cerr
#endif
using namespace std;
inline int toInt(string s) {int v; istringstream sin(s);sin>>v;return v;}
template<class T> inline string toString(T x) {ostringstream sout;sout<<x;return sout.str();}
template<class T> inline T sqr(T x) {return x*x;}
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<string> VS;
typedef pair<int, int> PII;
typedef long long LL;

template <class T> inline void setmax(T & a, T const & b) { a = max(a, b); }
template <class T> inline void setmin(T & a, T const & b) { a = min(a, b); }
template <class T> T sq(T x) { return x * x; }
template <class T> T clamp(T a, T l, T r) { return min(max(a, l), r); } // [l, r]
const double EPS = 1e-10;
const double PI  = acos(-1.0);

int main(int argc, char *argv[]) {
	// Something to do
	string s;
	cin >> s;
	reverse(ALL(s));
	cout << s << endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#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(){
	string s,ans="";
	cin>>s;
	rep(i,s.size()){
		ans+=s[s.size()-i-1];
	}
	cout<<ans<<endl;
	return 0;
}

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

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

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

}

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

using namespace std;

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

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

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

using namespace std;

int main(){
	int a=0;
	int i=0;
	char moji[20];
	while(cin.get(moji[i])){
		a=moji[i];
		if(a==10){break;}
		i++;}
	for(int j=0;j<i;j++){cout.put(moji[i-1-j]);}}

C++: #include<iostream>
#include<stdio.h>
int main(){
	int i;
	char s[20];
	scanf("%s",s);
	for(i=0;s[i]!='\0';i++);
	if(i>0) i--;
	for(;i>=0;i--) std::cout << s[i];
	std::cout<<std::endl;

	
    return 0;
}

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

 main(){
  string s;
  scanf("%s",s);
  int i=0;
  int k;
  while(s[i]!='\n'){
    i++;
    }
  for(k=i;k>=0;k--){
    printf("%c",s[k]);
  }
  return 0;
}

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

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

	return 0;
}

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

int main()
{
	char str[20] = {};
	for (int i = 0; cin >> str[i]; i++)
	{}

	for (int j = 0; j >= 0; j--)
	{
		cout << str[j];
	}
	return 0;
}

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

int main(void)
{
  char str[20];

  cin >> str;

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

  return 0;
}

C++: while line = gets
  print line.reverse+"\n"
end

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>

std::string reversed(std::string str)
{
    std::string ret;
    int len;
    
    len = str.length();
    for (int i = 0; i < len; i++){
        ret.append(str, len - 1 - i, 1);
    }
    
    return ret;
}

int main()
{
    std::string str;
    
    std::cin >> str;
    
    std::cout << reversed(str) << std::endl;
    
    return 0;
}

C++: #include <iostream>			//std::cout, std::cin
#include <string>			//std::string,std::to_string(C++11)
#include <vector>			//std::vector
#include <valarray>			//std::valarray
#include <algorithm>		//std::sort
#include <ctime>			//localtime_s
#include <cstdlib>			//abs
#include <cmath>			//abs,std::pow,sqrt,sin,cos,round,floor,ceil
#include <fstream>			//std::ifstream,std::ofstream
#include <iomanip>			//std::setprecision,std::setw,std::setfill
#include <random>			//std::random(C++11)
#include <numeric>			//std::accumulate
#include <functional>		//std::greater
#include <chrono>			//std::chrono(C++11)
#include <bitset>			//std::bitset
#include <queue>			//std::queue

const static double	de_PI	= 3.14159265358979323846;
const static int	de_MOD	= 1000000007;
const static int	de_MAX	= 999999999;

int main(void) {

	//std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());
	//std::ofstream ofs("456.csv");
	//std::chrono::system_clock::time_point t_st = std::chrono::system_clock::now();

	std::string str;
	std::cin >> str;

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

	//std::chrono::system_clock::time_point t_ed = std::chrono::system_clock::now();
	//std::cout << std::chrono::duration_cast<std::chrono::milliseconds>(t_ed - t_st).count() << "ms" << std::endl;

}

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

using namespace std;

int main()
{
	char str[20];
	cin >> str;
	int len = strlen(str);
	for (int i = len; i >0; i--)
	{
		cout << str[i-1];
	}
	return 0;
}

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

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

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

//????????????????????§??????
int main()
{
	string str;
	cin >> str;

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

	return 0;
}

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

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

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

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