Go: package main

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

func main() {
        var s string
        sc := bufio.NewScanner(os.Stdin)
        sc.Scan()
        s = sc.Text()
        fmt.Println(strings.ToUpper(s))
}

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

int main(){
    string s;
    cin>>s;
    for(char c:s){
        cout << toupper(c);
    }
    cout<<endl;
}

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

int main()
{
	int i;
	char s[1024], temp;
	for (i = 0; (temp = getchar()) != '\n'; i++) {
		if (temp <= 'z' && temp >= 'a') {
			s[i] = temp + ('A' - 'a');
		}
		else {
			s[i] = temp;
		}
	}
	s[i] = EOF;
	for (i = 0; s[i] != EOF; i++)
		printf("%c", s[i]);
	printf("\n");
	return 0;
}

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

using namespace std;

int main() {
    string s;
    getline(cin, s);
    transform(s.begin(), s.end(), s.begin(), ::toupper);
    cout << s << endl;
    
    return 0;
}

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

int main() {
	string s;
    getline(cin,s);
    for(int i=0;i<s.size();i++){
        if(s[i]>='a'&&s[i]<='z'){
            s[i]+='A'-'a';
        }
    }
    cout<<s<<endl;
	return 0;
}

C++:  
 #include<iostream>
 #include<stdio.h>
 #include<string>
 #include<math.h>
 #include<iomanip>
 #include<algorithm>
 #include<string.h>
 #include<cctype>
 #include<map>
 #include<set>
 #include<vector>
 #include<sstream>
 #include<stack>
 
 using namespace std;
  
 int main()
 {
   string a,b;
   while(getline(cin,a))
   {
     b="";
     for(int i=0;i<a.length();i++)
     { 
       if(a[i]>='a'&&a[i]<='z') b[i]=(a[i]-'a')+'A';
       else b[i]=a[i];
     }
     cout<<b<<endl;
   }
   //while(1);      
   return 0;    
 }

C++: #define _USE_MATH_DEFINES
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<cstdio>
#include<deque>
#include<list>
#include<set>
#include<stack>
#include<string>
#include<sstream>
#include<map>
#include<queue>
#include<vector>
using namespace std;

int main() {
	string s;
	getline(cin, s);
	transform(s.begin(), s.end(), s.begin(), ::toupper);
	cout << s << endl;
	return 0;
}

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

int main(){
	string s;
	getline(cin, s);
	int i = 0;
	while(s[i] != '\0'){
		if('a' <= s[i] && s[i] <= 'z'){
			s[i] += 'A' - 'a';
		}
		i++;
	}
	cout << s << endl;
}

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

int main(){
	char c;
	while(1){
		scanf("%c",&c);
		if(c==0)break;
		c=toupper(c);
		printf("%c",c);
	}
	return 0;
}

C++: #include <bits/stdc++.h>
#define SORT(a) sort(a.begin(), a.end())
#define RSORT(a) sort(a.rbegin(), a.rend())
#define REP(i, n) for (int i = 0; i < n; i++)
#define FOR(i, start, end) for (int i = start; i < end; i++)
#define ALL(a) a.begin(), a.end()
#define MOD(a) a %= 1'000'000'007
using ll = long long;
using namespace std;
const int INF32       = 1'050'000'000;
const long long INF64 = 4'000'000'000'000'000'000;
const int MOD7        = 1'000'000'007;
const int MOD9        = 1'000'000'009;
template <class T> inline bool chmin(T &a, T b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T> inline bool chmax(T &a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    string s;
    getline(cin, s);
    transform(s.begin(), s.end(), s.begin(), ::toupper);
    std::cout << s;
    s[s.size() - 1] == '.' ? cout << '\n' : cout << ' ';

    return 0;
}

C++: void main(){
	char s[999];
	int i;
	for(;~scanf("%s",s);printf("%s ",s))
		for(i=0;s[i];i++)
			s[i]>='a'&&s[i]<='z'?s[i]-=32:0;
	for(i=0;s[i];i++)
		s[i]>='a'&&s[i]<='z'?s[i]-=32:0;
	puts(s);
}

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

int main()
{
  string str;
  getline(cin, str);
  for (int i = 0; i < str.size(); i++){
    if ('a' <= str[i] && str[i] <= 'z'){
      str[i] = str[i] + 32;
    }
  }
  cout << str << endl;
  return (0);
}

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

using namespace std;

int main(){
	string ch;
	int i;

	getline(cin, ch);

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

		if(isalpha(ch[i])!=0){
			ch[i] = toupper(ch[i]);
		}
	}

	cout << ch << endl;
}

C++: #include <iostream>
#include <string>
using namespace std;
int main() {
  string line;
  getline(cin, line);
  for (auto& c: line) {
    if (c == ' ' || c == '.') continue;
    c = c -'a' + 'A';
  }
  cout << line << endl;
}

C++: #include <iostream>
#include <stack>
#include <string>
using namespace std;
void f(int);
int main() {
    string str;
    getline(cin,str);
    for(int i=0;i<str.size();i++){
        if(islower(str[i])){
            str[i]+='A'-'a';
        }
    }
    cout<<str<<endl;
    return 0;
}

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


int main(){
	std::string word, ans;

	getline(cin, word);
	std::transform(word.begin(), word.end(), word.begin(), toupper);
	std::cout << word << std::endl;

	return 0;
}

C++: #include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 999999999
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};

bool debug=false;
/*---------------------------------------------------*/

int main(){
  string s;

  while(cin>>s){
    if(s==".")break;
    rep(i,s.size()){
      int tmp;
      tmp=s[i]-'a';
      cout<<char('A'+tmp);
    }
    cout<<" ";
  }
  cout<<endl;
  
  return 0;
}

C++: #include <set>
#include <map>
#include <list>
#include <queue>
#include <stack>
#include <cmath>
#include <ctype.h>
#include <ctime>
#include <cstdio>
#include <vector>
#include <string>
#include <bitset>
#include <cctype>
#include <cstdlib>
#include <cstring>
#include <utility>
#include <numeric>
#include <complex>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <cassert>
#include <iostream>
#include <iterator>
#include <algorithm>

using namespace std;

#define REP(i, x, n) for(int i = x; i < n; i++)
#define rep(i, n) REP(i, 0, n)
#define lengthof(x) (sizeof(x) / sizeof(*(x)))
#define FILL(ptr, value) FILL_((ptr), sizeof(ptr)/sizeof(value), (value))
template <typename T>
void FILL_(void * ptr, size_t size, T value){
  std::fill((T*)ptr, (T*)ptr+size, value);
}
//4方向ベクトル→↑←↓
int dx[] ={1,0,-1,0};
int dy[] ={0,-1,0,1};

int main()
{
  char s[]="012345678954321012345678";
 int len=24;
  int n;
  cin >>n;
  while(n--){
        int start,goal; cin>>start>>goal;
        int ans=100,ans_st;
        for(int i=0;i<len;i++){
            if(s[i]!=start+'0') continue;
            for(int j=i+1;j<len;j++){
                if(s[j]==goal+'0'){
		  if(ans>j-i)
		  ans=j;
		  ans_st=i;
                }
            }
        }
	cout <<s[ans_st];
	cout <<" ";
	for(int i =ans_st+1;i <ans;i++){
	  cout <<s[i]<<" ";
	}
	cout <<s[ans];
	cout <<endl;
  }
  return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
char ToUpper (char cX) { return toupper(cX); } 
using namespace std;

int main() {
	string in;
	getline(cin, in);
	transform(in.begin(), in.end(), in.begin(), ToUpper);
	cout<<in<<endl;
	return 0;
}