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 <iomanip>
#include <algorithm>
#include <map>
#include <string>
#include <cstdio>
#include <cstring>
#include <vector>
#include <cstdio>
#include <climits>
using namespace std;
#define rep(i,n) for(LL i=0;i<n;i++)
#define all(v)	(v).begin(),(v).end()
#define MOD  1000000007
const int INF = INT_MAX;
typedef long long LL;


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 line;
	getline(cin, line);
	for (int i = 0; i < line.size(); i++) {
		if ('a' <= line[i] && line[i] <= 'z') {
			line[i] -= 32;
			cout << line[i];

		}
		else {
			cout << line[i];
		}
	}
	cout << endl;
}

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 <string>

using namespace std;

int main(){
	string ch;
	int i;

	getline(cin, ch);

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

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

	cout << ch << endl;
}

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

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

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]){
			ch[i] = toupper(ch[i]);
		}
	}

	cout << ch << endl;
}

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

int main(){
	string in;
	int c;
	cin>> in;
	while(in[c]!='\0'){
		in[c]=toupper(in[c]);
		c++;
	}
	cout<<in;
	while(cin>>in){
		c=0;cout<<" ";
		while(in[c]!='\0'){
			in[c]=toupper(in[c]);
			c++;
		}
		
		cout<<in;
	}
	cout<<endl;

}

C++: #import<cstdio>
int main(){for(int c;~(c=getchar());putchar(c>96?c-32:c));}

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

using namespace std;

int main(){

	char buf[201];
	fgets(buf,201,stdin);
	for(int i=0;buf[i]!='\0';i++){
		if(buf[i] >= 97 && buf[i] <=122){
			buf[i] -= 32;
		}
	}

	printf("%s",buf);
    return 0;
}

C++: // includes
#include <cstdio>
#include <cstdint>
#include <iostream>
#include <iomanip>
#include <string>
#include <queue>
#include <stack>
#include <vector>
#include <set>
#include <map>
#include <unordered_map>
#include <algorithm>
#include <utility>
#include <functional>
#include <cmath>
#include <climits>
#include <bitset>

// macros
#define ll long long int
#define pb push_back
#define mk make_pair
#define pq priority_queue
#define FOR(i, a, b) for(int i=(a); i<(b);++i)
#define rep(i, n) FOR(i, 0, n)

using namespace std;

//  types
typedef pair<int, int> P;
typedef pair<ll, int> Pl;
typedef pair<ll, ll> Pll;
 
// constants
const int inf = 1e9;
const ll linf = 1LL << 50;
const double EPS = 1e-10;

// solve

int main(int argc, char const* argv[])
{
  int offset = int('A' - 'a');
  string s;
  getline(cin, s);
  rep(i, s.size()){
    if('a' <= s[i] && s[i] <= 'z'){
      s[i] = char(s[i] + offset);
    }
  }
  cout << s << endl;
	return 0;
}

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

using namespace std;

int main() {

	char ch;

	while(1) {

		scanf("%c", &ch);

		if(ch == '\n') {
			cout << endl; 
			break;
		}

		ch = toupper(ch);

		cout << ch;
	}

	return 0;
}

C++: print raw_input().upper()

C++: #include<cstdio>
int main(){
    char c;
    while(scanf("%c",&c)!=-1){
        if('a'<=c && c<='z'){
            printf("%c",c+('A'-'a'));
        }else printf("%c",c);
    }
}

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

int main() {
  string str;
  getline(cin, str);
  for(int i = 0; i < str.length(); i++) {
    if(isalpha(str[i])) {
      str[i] = toupper(str[i]);
    }
  }
  cout << str << endl;
  return 0;
}

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

char Capital(char c)
{
	int i = c;

	if(97<=i && i <= 122)
	{
		return i-32;
	}

	return c;
}

int main()
{
	std::string sentence;

	getline(std::cin,sentence);

	for(size_t i=0; i<sentence.length(); ++i)
	{
		std::cout << Capital(sentence[i]);
	}
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include <cctype>
#include <climits>
#include <fstream>

using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a) 
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;

string shift_str(string str)
{
    int ascii;
    string ret;
     
    for (int i=0; i<str.length(); i++)
    {
        ascii = str[i];   
        if (!('a' <= ascii && ascii <= 'z'))
        {
            ret += ascii;
        } else {
        	ret += ((ascii - 'a') + 'A');
        }
         
    }   
    return ret;
}
//?°????????????§?????????
 
int main()
{
    string str;
    getline(cin,str);	//???????????\????????§????????????.
    cout<<shift_str(str)<<endl;
    return 0;
}

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

int main()
{
	char c;
	
	while(scanf("%c", &c), c != EOF){
		if (c >= 'a' && c <= 'z'){
			c -= 32;
		}
		printf("%c", c);
	}
	printf("\n");
	return (0);
}

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

int main(void){
	int len,cut_i;
	char str[1000];

	scanf("%[a-z .]",str);

	len = strlen(str);

	for(cut_i=0; cut_i<len; cut_i++){
		str[cut_i] = toupper(str[cut_i]);
	}
	
	puts(str);

	return 0;
}

C++: #include <iostream>

using namespace std;

int main(){
	string ch;

	while(1){
		//getline(cin, ch) //1??????????????????

		cin >> ch;
		if(ch == '\n'){
			cout << endl;
			break;
		}
		else{
			ch = toupper(ch);
			cout << ch;
		}
	}
}

C++: #include <bits/stdc++.h>
#define rep(i, a, n) for(int i = a; i < n; i++)
#define repb(i, a, b) for(int i = a; i >= b; i--)
#define all(a) a.begin(), a.end()
#define int long long
using namespace std;
typedef pair<int, int> P;

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

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

using namespace std;

int main()
{
	char ch;
	while (std::cin.get(ch)) {
		ch = std::toupper(ch);
		std::cout << ch;
	}

	return 0;
}

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

int main() {
    ios_base::sync_with_stdio(false);

    string input ="", output = "";

    while(getline(cin, input)) {
        for (int i = 0; i < input.size(); i++) {
            if (input[i] >= 'a' && input[i] <= 'z')
                cout << char(input[i] + ('A' - 'a'));
            else
                cout << char(input[i]);
        }
        cout << endl;
    }
    //cout << output;
}