Go: package main

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

func main() {
	scanner := bufio.NewScanner(os.Stdin)
	scanner.Scan()
	input := scanner.Text()
	input = strings.ToUpper(input)
	fmt.Println(input)
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <utility>
#include <stack>
#include <functional>
#include <queue>
#include <cmath>
#include <set>

#define rep(i,j,k) for(int i=j;i<k;i++)
#define drep(n,m) for(int i=0;i<n;i++)for(int j=0;j<m;j++)
#define Sort(x) sort((x).begin(),(x).end())
#define fi first
#define se second
#define vi vector<int>
#define INF 1000000000
#define MOD 1000000009
#define pb push_back
#define mp make_pair
typedef long long ll;
typedef unsigned long long ull;
int dx[4]={0,1,0,-1},dy[4]={1,0,-1,0};

using namespace std;

ll gcd(ll a,ll b){
    if(a<b){
        int t=a;a=b;b=t;
    }
    int c=a%b;
    while(c!=0){
        a=b;
        b=c;
        c=a%b;
    }
    return b;
}

ll lcm(ll a,ll b){
    return a*b/gcd(a,b);
}

bool isPrime(int x){
    if(x==1)return false;
    if(x==2)return true;
    if(x%2==0)return false;
    for(int i=3;i<=sqrt(x);i+=2){
        if(x%i==0)return false;
    }
    return true;
}

int kaizyo(int x){
    if(x==1)return x;
    else return x*kaizyo(x-1);
}

typedef struct Point{
    int x;
    int y;
} P;

int main() {
    string s;
    getline(cin,s);
    rep(i,0,s.length()){
        s[i]=toupper(s[i]);
    }
    cout<<s<<endl;
    
    return 0;
}

C++: #include<iostream>
#include<algorithm>
#include<string>
#include <cstdlib>
using namespace std;
int main(){
	string s;
	cin>>s;
	transform (s.begin (), s.end (), s.begin (), toupper);
	cout<<s;
}

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

int main(){
	char s[10001];
	cin.getline(s,10000);
	int c = strlen(s);
	for(int i=0;i<c;i++)
		if('a' <= s[c] && s[c] <= 'z')
			s[c] += 'A' - 'a';
	cout << s << "\n";
	return 0;
}

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

int main(){
	char s[1000];
	cin.getline(s,sizeof(s));
	for(int i=0;s[i]!='\0';i++){
		if((s[i]!=' ')&&(s[i]!='.')){
			putchar(s[i]-'a'+'A');
		}else{
			putchar(s[i]);
		}
	}
	return 0;
}

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

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

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

int main()
{
	char c;
	
	while (cin >> c, c != EOF){
		if(c == '.'){
			cout << c;
			continue;
		}
		else if(c == ' '){
			cout << ' ';
			continue;
		}
		c -= 32;
		cout << c;
	}
	
	cout << endl;
	
	return (0);
}

C++: #include<iostream>
#include<cstdio>
#include<cstring>
using namespace std;
int main(){
	char cent[100];
	for(int i=0;;i++){
		scanf("%c",&cent[i]);
		if(cent[i] == 10){break;}
		if(cent[i]>=97 && cent[i]<=122){cent[i]-=32;}
	}
	cout<<cent;
	return 0;
}

C++: #include<map>
#include<set>
#include<list>
#include<cmath>
#include<queue>
#include<stack>
#include<cstdio>
#include<string>
#include<vector>
#include<complex>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<numeric>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<algorithm>
#include<functional>
#include<math.h>

#define MP make_pair
#define PB push_back
#define ALL(x) (x).begin(),(x).end()
#define REP(i,n) for(int i=0;i<(n);i++)
#define REP1(i,n) for(int i=1;i<(n);i++)
#define REP2(i,d,n) for(int i=(d);i<(n);i++)
#define RREP(i,n) for(int i=(n);i>=0;i--)
#define CLR(a)      memset((a),0,sizeof(a))
#define MCLR(a)     memset((a),-1,sizeof(a))
#define RANGE(x,y,maxX,maxY) (0 <= (x) && 0 <= (y) && (x) < (maxX) && (y) < (maxY))

using namespace std;

typedef long long LL;
typedef unsigned long long ULL;
typedef vector<int> VI;
typedef vector<VI > VVI;
typedef vector<string> VS;
typedef vector<LL> VLL;
typedef pair<int,int> PII;

const int INF = 0x3f3f3f3f;
const LL INFL = 0x3f3f3f3f3f3f3f3fLL;
const double EPS = 1e-9;

const int DX[]={1,0,-1,0},DY[]={0,-1,0,1};

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

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

int main(void) {
  char a[200];
  int i, s = 0;
  while(scanf("%s", a) != EOF) {
    if(s) printf(" ");
    s = 1;
    for(i = 0; i < strlen(a); ++i) {
      if(a[i] >= 'a' && a[i] <= 'z') a[i] += 'A' - 'a';
      printf("%c", a[i]);
    }
  }
  printf("\n");
  return 0;
}

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

using namespace std;

int main(void){
	string s;

	cin >> s;
	transform(s.begin(),s.end(),s.begin(),::toupper);
	cout << s << endl;

	return 0;
}

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

using namespace std;

int main()
{
        char str[201];

        fgets(str, 200, stdin);
        int len = strlen(str);
        str[len - 1] = '\0';
        for (int i = 0; i < len; i++) {
                str[i] = toupper(str[i]);
        }
        printf("%s\n", str);

        return 0;
}

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

int main(){
	string s;
	getline(cin, s);
	for (int i = 0; i < s.length(); i++){
		printf("%c", toupper(s[i]));
	}
	cout << endl;
	return 0;
}

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

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

C++: #include<iostream>
#include<ctype.h>
#include<stdio.h>
int main(){
	char a[256];
	gets(a);
	//std::cin>>str;
	for(int i=0;i<256;i++){
		a[i]=toupper(a[i]);
		std::cout<<a[i];
	}
	std::cout<<std::endl;
	return 0;
}

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

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

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

int main(int argc, char const* argv[])
{
	std::string s;
	std::getline(std::cin, s);
	std::transform(s.begin(), s.end(), s.begin(), toupper);
	std::cout << s << std::endl;

	return 0;
}

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

using namespace std;

int main()
{
	string str;

	getline( cin, str );

	for ( unsigned int i = 0; i < str.length(); i++ )
	{
		if ( 'a' <= str[i] && str[i] <= 'z' )
		{
			str[i] = toupper( str[i] );
		}
	}

	cout << str << endl;

	return 0;
}

C++: #include<stdio.h>

int main(void){
	char a;

	while((a=getchar())!=EOF){
		if('a'<=a && a<='z')
			a-=32;
		putchar(a);
	}

	return 0;
}

C++: #include <bits/stdc++.h>

using namespace std;

int main(){
    string str;

    getline(cin, str);

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

    cout << str << endl;

    return(0);
}

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

using namespace std;

char data1[26]={'a','b','c','d','e','f','g','h','i','j','k','l','m','n','o','p','q','r','s','t','u','v','w','x','y','z'};
char data2[26]={'A','B','C','D','E','F','G','H','I','J','K','L','M','N','O','P','Q','R','S','T','U','V','W','X','Y','Z'};
char mozi;
int flag=0;

int main(){
	while(flag == 0){
		scanf("%c",&mozi);
		if(mozi == ' '){
			printf(" ");
		}else if(mozi == '.'){
			printf(".");
		}else if(mozi == '\n'){
			printf("\n");
			flag = 1;
		}else{
			for(int i=0;i<26;i++){
				if(data1[i] == mozi){
					printf("%c",data2[i]);
					break;
				}
			}
		}
	}

}