Go: package main

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

var scanner = bufio.NewScanner(os.Stdin)

func nextString() string {
	scanner.Scan()
	return scanner.Text()
}

func main() {
	scanner.Split(bufio.ScanLines)

	line := nextString()

	fmt.Println(strings.ToUpper(line))
}

C++: 
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <stack>
#include <cctype>
#include <complex>
#include <vector>
#include <algorithm>

using namespace std;


bool solve(){

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

int main(){
	cout.setf(ios::fixed);
	cout.precision(10);
	solve();

	return 0;
}

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

int main() {
	string words;
	getline(cin, words);
	int change = 'A' - 'a';

	for (int i = 0;i < words.length();i++) {
		if (words.at(i) >= 'a' && words.at(i) <= 'z') {
			words.at(i) += change;
		}
	}

	cout << words << endl;

	return 0;
}

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

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

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


int main() {
  int n;
  string str;

  while(cin >> str) {
    n = str.size();
    for(int i=0;i<n;i++) {
      if((str[i] <= 122) && (str[i] >= 97)) {
        str[i] -= 32;
      }
    }
    if(str[n] == 46)
      cout << str;
    else
      cout << str << " ";
  }
  cout << endl;
}

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

int main(){
	while(true){
	char letters[100];
	cin >> letters;
	if(cin.eof()) break;
	for(int i = 0; i <= (strlen(letters)-1);i++){
		if(letters[i]>=97&&letters[i]<=122) cout << (char)(letters[i]-32) ;
		else cout << (char)letters[i];
	}
	cout << " ";
	}
	cout << 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))
   {
     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++: #include <iostream>
#include <string>
#include <cstdlib>
#include <cctype>
#include <algorithm>
#include<string.h>
#include <numeric>

using namespace std;
int main() {
	string str;
	getline(cin, str);
	transform(str.begin(), str.end(), str.begin(), toupper);
	cout << str << endl;
}

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

int main(){
	string input;
	while(true)
	{
		string temp;
		cin >> temp;
		if(cin.eof()) break;
		input += temp;
		input += ' ';
	}
	int length = input.size();
	for(int i = 0;i<=length;i++)
		if(input[i]>=97&&input[i]<=122)input[i]=(char)input[i]-32;
	
	cout << input.substr(0,length-1) << endl;
	return 0;
}

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

using namespace std;

int main(void){
	string s;
	while(getline(cin, s)){
		for(int i=0;i<s.size();i++){
			if(0x60<s[i]&&s[i]<0x7b) s[i]-=0x20;
		}
		cout << s << "\n";
	}
	return 0;
}

C++: #include<stdio.h>
#include<string.h>
int main(void) {
	int a;
	char str[100];
	scanf("%[^\n]", str);
	for (int i = 0; i <= strlen(str); i++)
	{
		if (str[i] >= 97 && str[i] <= 122)
		{
			str[i] = str[i] - 32;
		}
		printf("%c", str[i]);
	}
	return 0;
}

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

using namespace std;

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

C++: #include<cstdio>
#include<cstring>
#include<algorithm>
#include<functional>
using namespace std;
int main(void)
{
	int len,i,j;
	char s;
	while(scanf("%c",&s)!=EOF) {
		if(s==' ' || s=='.') printf("%c",s);
		if('A'<=s && 'Z'>=s) printf("%c",s);
		else{
			s=s-('a'-'A');
			printf("%c",s);
		}
	}
	printf("\n");
	return 0;
}

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

using namespace std;
using ll = long long;
using pii = pair<int, int>;

int main() {
  cin.tie(0);
  ios_base::sync_with_stdio(false);
  cout << fixed << setprecision(10);
  
  string s;
  getline(cin, s);
  for (int i = 0; i < (int)s.size(); i++) {
    cout << (char)(islower(s[i]) ? toupper(s[i]) : s[i]);
  }
  cout << endl;

  return 0;
}

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

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

C++: #include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
using namespace std;
static const double EPS = 1e-5;
typedef long long ll;
#define FOR(i,n) for(i=0;i<n;i++)
#define rep(i,n) for(int i=0;i<n;i++)

int main(){
	char c;
	for(;scanf("%c",&c)!=EOF;){
		printf("%c",('a'<=c&&c<='z')?c^32:c);
	}
	puts("");
	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()
{
  string str;
  getline(cin,str);
  for(int i = 0;i <str.size();i++){
    str[i]=toupper(str[i]);
    cout <<str[i];
  }
  return 0;
}

C++: #include <iostream>
#include <queue>
#include <stack>
#include <vector>
#include <stdio.h>
#include <algorithm>
#include <string.h>
#include <string>
using namespace std;
#define rep(i,n) for(int i=0;i<int(n);++i)


int main(){
	char st[500];
	int i = 0;
	//cout<<"hoge";
	for(int i = 0;;i++){
		scanf("%c",&st[i]);
		if(st[i] == -1){
			break;
		}
	}
	//cin >> st;
	
	rep(i,20){
		//printf("%c %d\n",st[i],st[i]);
	}
	//printf("a = %d z = %d A = %d Z = %Z\n",'a','z','A','z');
	i = 0;
	while(st[i]!=-1){
		//printf("st[%d] = %d\n",i,st[i]);
		if(st[i]<='z'&&st[i]>='a'){
			//cout<<"before "<<st[i]<<endl;
			
			st[i]+=-'a'+'A';
			//cout<<"after "<<st[i]<<endl;
		}
		i++;
	}
	//cout<< st << endl;
		printf("%s",st);
	
	 return 0;
}

C++: #include <stdio.h>

int main(void){
    char buf[1024];

    gets(buf);
    for (char *pt=buf; *pt!='\0'; pt++){
        if ('a'<=*pt && *pt<='z'){
            *pt = *pt-'a'+'A';
        }
        printf("%c", *pt);
    }

    return 0;
}

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

using namespace std;

int main()
{
	char x;

	while (scanf("%c", &x) != EOF) {
		if (islower(x)) {
			x = toupper(x);
		}
		printf("%c", x);
	}
	
	return 0;
}