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 <string>
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] - 'a' + 'A';
    }
  }
  cout << str << endl;
}

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++: #include<cstdio>
#include<cstdlib>
#include<cstring>
#include<cmath>
#include<ctime>
#include<cctype>
#include<climits>
#include<iostream>
#include<string>
#include<vector>
#include<map>
#include<list>
#include<queue>
#include<deque>
#include<algorithm>
#include<numeric>
#include<utility>
#include<complex>
#include<memory>
#include<functional>

#define REP(i, n) for(int i = 0;i < n;i++)
#define REPR(i, n) for(int i = n;i >= 0;i--)
#define FOR(i, m, n) for(int i = m;i < n;i++)
#define FORR(i, m, n) for(int i = m;i >= n;i--)
#define SORT(v, n) sort(v, v+n);
#define VSORT(v) sort(v.begin(), v.end());
#define llong long long
#define pb(a) push_back(a)
#define INF 999999999
using namespace std;

typedef vector<int> vi;
typedef vector<long long> vl;
typedef vector<double> vd;
typedef pair<int, int> pii;
typedef pair<long, long> pll;
typedef long long ll;

int dy[] = { 0, 0, 1, -1, 0 };
int dx[] = { 1, -1, 0, 0, 0 };

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

	string s;
	cin>>s;

	transform(s.begin(), s.end(), s.begin(), ::toupper);

	cout<<s<<endl;
}

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

int main() {
	std::string in;
	while (std::getline(std::cin,in)) {
		for (std::string::iterator itr = in.begin(); itr != in.end(); itr++) {
			if ('a' <= *itr && *itr <= 'z') {
				*itr = *itr - 'a' + 'A';
			}
		}
		std::cout << in << std::endl;
	}
	return 0;
}

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

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

C++: a;main(){a=puts("THIS IS A PEN.");}

C++: #include <stdio.h>

char c ;

bool isalpha ( ) ;

int main ( )
{
	while ( 1 ) {
		c = getchar ( ) ;
		if ( c == EOF ) break ;
		if ( isalpha ( ) ) {
			c -= ( 'a' - 'A' ) ;
		}
		putchar ( c ) ;
	}
	return 0 ;
}

bool isalpha ( )
{
	return ( c >= 'a' && c <= 'z' ) ;
}

C++: #include <cstdio>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <string.h>
#include <queue>
#include <stack>
#include <utility>
#include <queue>
#define mp make_pair
#define pii pair<int,int> 
#define ff first
#define ss second

using namespace std;

char a;

int main()
{
	while(scanf("%c",&a)!=EOF)
	{
		a=toupper(a);
		printf("%c",a);
	}
	return 0;
}

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

int main() {
	string str; //文字列
	getline(cin,str);

	for(int i=0;i<=str.size();i++)
		str[i]=toupper(str[i]);
	
	cout << str << endl;
	return 0;
}

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

#define all(c) (c).begin(), (c).end()
#define rep(i,n) for(int i=0;i<(n);i++)
#define pb(e) push_back(e)
#define mp(a, b) make_pair(a, b)
#define fr first
#define sc second

typedef unsigned long long ull;
typedef long long ll;

const int INF=100000000;
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

using namespace std;

typedef pair<int ,int > P;


int main()
{
	string ss,ans;
	getline(cin,ss);
	rep(i,ss.size())
	{
		if('a'<=ss[i]&&ss[i]<='z')
		{
			ans+=ss[i]-32;
		}
		else
			ans+=ss[i];
	}

	cout<<ans<<endl;


	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;
typedef pair<int, int>P;

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

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

int main(){
  string str;
  int i;
  int gap;

  gap='a'-'A';
  std::getline(std::cin, str);
  for(i=0; i<str.size(); i++){
    if(str[i]!=' ' && str[i]!='.') str[i]-=gap;
  }
  cout<<str;

  return 0;
}

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

int main(){
	char n[100];
	gets(n);
	for(int i=0;i<100;i++){
		if((n[i]>='a')&&(n[i]<='z')){
			n[i]=n[i]+'A'-'a';
		}
	}
	printf("%s\n",n);
return 0;
}

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

int main(void){
  char str[100000];
  int flg = 0;

  while( cin >> str ){

    if( flg == 1 ) cout << " ";
    else if( flg == 2 ) break;
    else flg = 1;
   
    for( int i = 0 ; i < strlen(str) ; i++ ){    
      str[i] -= 'a'-'A';
    if( 'A' <= str[i] && str[i] <= 'Z' ) cout << str[i];
    else{ cout << "."; flg = 2; }
    }
  }
  cout << endl;
  return 0;
}

C++: #include <iostream>

std::string str;

int main() {
    getline(std::cin, str);

    for(char c : str) {
        if(c == '\n') break;
        if(c >= 'a' && c <= 'z') {
            char upper = (c - 'a') + 'A';
            std::cout << upper;
        } else {
            std::cout << c;
        }
    }
}

C++: #include <iostream>

using namespace std;

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

  return 0;
}

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

int main(){
	string input;
	while(cin && getline(cin, input)){
		string ans = "";
		for(int n=0; n<input.size(); n++){
			if('a'<=input[n]&&input[n]<='z'){
				ans += input[n]-'a'+'A';
			} else {
				ans += input[n];
			}
		}
		cout<<ans<<endl;
	}
	return 0;
}

C++: #include <iostream>
#include <iomanip>
#include <sstream>
#include <stdio.h>
#include <vector>
#include <stack>
#include <queue>
#include <algorithm>
#include <math.h>
#include <utility>
#include <string>
#include <ctype.h>
#include <cstring>
#include <cstdio>
#include <sstream>
#include <functional>

using namespace std;

#define FOR(i,k,n) for(int i = (k); i < (n); i++)
#define REP(i,n) FOR(i,0,n)
#define INF 114514810
#define ll long long
//#define scanf scanf_s

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

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

using namespace std;

int main(){
	string word, ans;

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

	return 0;    
}

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

C++: #include<iostream>
#include<cctype>
#include<cstring>
using namespace std;
int main(){
  char cc[1000000];
  cin.getline(cc,1000000);
  for(int i=0;i<strlen(cc);i++){
    cc[i] = toupper(cc[i]);
    cout << cc[i];
  }
  cout << endl;
  return 0;
}

C++: #include<iostream>
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;
}