Go: package main

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

var sc = bufio.NewScanner(os.Stdin)

func main() {
	sc.Scan()
	fmt.Println(strings.ToUpper(sc.Text()))
}

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

int main(void) {
	int k=0;
	string str;
	while (cin >> str) {
		k++;
		for (int i = 0; i < str.length(); i++) {
			if ('a' <= str[i] && str[i] <= 'z') str[i]+='A'-'a';
		}
		cout << str << " ";
	}
	cout << endl;
	return 0;
}

C++: #include<iostream>
#include<string>
#include<cstring>
using namespace std;
int main()
{
  string s;
  cin >> s;
  int len = s.size();
  for(int i = 0;i < len;i++){
    if(s[i] > 'a' && s[i] < 'z'){
      s[i] -= 'a'-'A';
    }
  }
  cout << s << endl;
}

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

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

C++: #include<iostream>
#include<cstdio>
using namespace std;
int main(){
  char str[256];
  cin.getline(str,256);
  for(char c : str){
    if(c=='\0'){putchar('\n');break;}
    if(c<'a'||c>'z'){putchar(c);}
    else{putchar(c+'A'-'a');}
  }
}

C++: 
#include <iostream>
#include<vector>
#include<algorithm>
#include<string>
using namespace std;
int main() {
    string s;
    getline(cin,s);
    for(int j=0;j<s.size();j++){
        if(s[j]>='a'&&s[j]<='z'){
            s[j]-=32;
        }
}cout<<s<<endl;
    return 0;
}

C++: main(c){for(;(c=getchar())!=-1;)putchar(c>96?c-32:c);}

C++: #include<stdio.h>
#include<string.h>
char buf;
int len;
int flg=0;
int main(void){
	while(1){
		scanf("%c",&buf);
		if(buf>='a' && buf<='z'){
			flg=0;
			buf-=32;
		}
		else {
			if(flg==1){
				break;
			}
			flg=1;
		}
		printf("%c",buf);
	}
	printf("\n");
	return 0;
}

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

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

C++: 
#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cmath>
#include <string>
#include <cstring>
#include <vector>
#include <map>
#include <utility>
#include <complex>
#include <stack>

using namespace std;


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

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

using namespace std;

int main()
{
	string str;
	
	cin >> str;
	
	for (string::iterator it = str.begin(); it != str.end(); it++) {
		if (*it == ' ' || *it == '.') continue;
		else *it += 32;
	}
	
	for (string::iterator it = str.begin(); it != str.end(); it++) {
		cout << *it;
	}
	cout << endl;
	
	return 0;
}

C++: #include <cstdio>
#include <ctype.h>

using namespace std;

int main(void){
	char c;
	while((c = getchar()) != '\n'){
		if(islower(c)){
			printf("%c",'A' + c - 'a');
		}else{
			printf("%c",c);
		}
	}
	printf("\n");
	return 0;
}

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

using namespace std;

char c[1000000];
string s;

signed main()
{
    getline( cin, s );
    int  i = 0;
    while( i != s.size() )
    {
        printf( "%c", toupper( s[i] ) );
        i++;
    }
    printf("\n");
    return 0;
}

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

int main(int argc, const char * argv[])
{
    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<stdio.h>
#include <ctype.h>


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

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

string s;

int main() {
	getline(cin, s);
	rep(i,s.length()) if ('a'<=s[i] && s[i]<='z') s[i] = s[i] - 'a' + 'A';
	cout << s << '\n';
}

C++: #include <iostream>
#include <cstdio>
#include <algorithm>
#include <cassert>
#include <vector>
#include <string>
#include <cmath>
#include <map> 
#include <sstream>
#include <cstdio>
#include <complex>
#include <cstring>
using namespace std;
 
const int MAX= 10000100;

#define loop(i,a,b) for(int i = a ; i < b ; i ++)
#define rep(i,a) loop(i,0,a)
#define all(a) (a).begin(),(a).end()
#define ll long long int
#define gcd(a,b) __gcd(a,b)
#define pb(a) push_back(a)
int GCD(int a, int b) {if(!b) return a; return gcd(b, a%b);}
int lcm(int a, int b) {return a*b / gcd(a, b);}

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

C++: #include "bits/stdc++.h"
#include<unordered_map>
#pragma warning(disable:4996)
using namespace std;



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

C++: #include <iostream>
#include <string>
using namespace std;
int main(){
	string str;
	getline(cin,str);
	for(int i = 0;i<str.length();i++)
		if(islower(str[i]))str[i]=toupper(str[i]);
	cout << str << endl;
	return 0;
}

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

int main()
{
    char ch[201];
    fgets(ch, 201, stdin);
    string str, str2="";
    str = ch;
    for (auto & c: str) str2+= toupper(c);
    cout << str2;
    return 0;
}

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

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

int main(void) {

	//std::ifstream in("123.txt");	std::cin.rdbuf(in.rdbuf());

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

}

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

int main(){
  char c;
  while(scanf("%c",&c) != EOF)printf("%c",toupper(c));
  puts("");
}

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

using namespace std;

const int N = 1000005;

char text[N];

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

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

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

C++: #include<string>
#include<iostream>
using namespace std;
int main(){

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

C++: #include <iostream>
#include <vector>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <math.h>
#include <functional>
#include <algorithm>

typedef long long Int;
#define REP(i,n) for(int i = 0 ; i < n ; ++i)
using namespace std;

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

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

using namespace std;

char ToUpper(char cX) { return toupper(cX); }

int main()
{
    string str;

    while (getline(cin, str, '\n')) {
        transform(str.begin(), str.end(), str.begin(), ToUpper);
        cout << str << endl;
    }

    return 0;
}