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++: #define _CRT_SECURE_NO_WARNINGS

#include <stdio.h>

using namespace std;

int main(int argc, char const* argv[])
{
    int c;
    while ((c = getchar()) != EOF) {
        if('a' <= c && c <= 'z'){
            putchar(c + ('A' - 'a'));
        }else{
            putchar(c);
        }
    }
    return 0;
}

C++: #define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

#define rep(i, n) REP(i, 0, n)
#define ALL(v) v.begin(), v.end()
#define MSG(a) cout << #a << " " << a << endl;
#define REP(i, x, n) for (int i = x; i < n; i++)
#define OP(m) cout << m << endl;
typedef long long ll;
typedef unsigned long long ull;

int main()
{
    string s;
    getline(cin, s);
    transform(ALL(s), s.begin(), ::toupper);
    OP(s)
    return 0;
}

C++: #include<iostream>
#include<cstdio>
#include<string>
using namespace std;
int main(){
  string bun;
  
  getline(cin,bun);
  
  for(int i=0;i<bun.size();i++){
    if(bun[i] <= 'z' && bun[i] >= 'a'){
      printf("%c",bun[i]-32);
    }
    else{
      printf("%c",bun[i]);
    }
  }
  cout << endl;
}

C++: #include <cstdio>
#include <vector>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <sstream>

using namespace std;

#define reep(i,f,n) for(int i=f; i<int(n); ++i)
#define rep(i,n) reep(i,0,n)

typedef vector<int> vi;

int main()
{
	char c;
	while((c = getchar()) != EOF)
		putchar(toupper(c));
	return 0;
}

C++: #define _USE_MATH_DEFINES
#include <iostream>
#include <sstream>
#include <cmath>
#include <algorithm>
#include <queue>
#include <stack>

typedef long long ll;
using namespace std;

int main()
{
	string str;
	getline(cin,str);
	for(int i=0;i<str.size();i++){
		if(str[i] == ' ' || str[i] == '.') continue;
		str[i] = toupper(str[i]);
	}

	cout << str;	
}

C++: #include<iostream>
#include<ctype.h>
using namespace std;
int main(){
    char c;
    while(cin>>c)
    {
        c=toupper(c);
        cout<<c;
    }
}

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

int main(){
	char c;
	while(1){
		scanf("%c",&c);
		if(c=='\0')break;
		if(c==0)break;
		c=toupper(c);
		printf("%c",c);
	}
	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==' ') printf("%c",s);
		if(s=='.') printf("%c\n",s);
		else{
			s=s-('a'-'A');
			printf("%c",s);
		}
	}
	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
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 <iostream>
#include <stdio.h>
using namespace std;

int main(){
	char c;
	while(cin >> c){
		if(c>='a' && c<='z') cout << (char)(c-32);//printf("%c",c-32)
		else cout << c;
		if(c=='\n') break;
	}
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <string>
#include <algorithm>
#include <cstring>
#include <map>
#include <queue>
#include <stack>
#include <set>
#include <functional>
#include <sstream>
using namespace std;

#define REP(i,a,n) for(int i=(a);i<(int)(n);i++)
#define rep(i,n) REP(i,0,n)
#define pb push_back
#define mp make_pair
#define all(x) x.begin(),x.end()

int main(){
	string in;
	while(getline(cin,in)){
		rep(i,in.size()){
			if( islower(in[i]) )in[i] = toupper(in[i]);
		}
		cout << in << endl;
	}
	return 0;
}

C++: /*
NOTE :
*min_element(.begin(),.end())
*max_element(.begin(),.end())
stack push pop top
queue push pop front
priority_queue<> pq
 push()  pop() size()  top()
map<>
 find() begin() end() insert(map<>::value_type())
pair<>
sort(.begin(), .end())
sort(arr, arr+N)
sort(a, a+N, greater<int>())
binary_search(vc.begin(), vc.end(), x)  //binary_search???true, false?????????
vector<int>::iterator lit = lower_bound(vc.begin(), vc.end(), x);
  lower_bound?????????????????????"??\???"????????????????????????????????????????????¬???????????????
vector<int>::iterator uit = upper_bound(vc.begin(), vc.end(), x);
  upper_bound????????????????????????"?¶???????"?????????????????????????????????????????¬???????????????
*/
#include <iostream>
#include <cstdio>
#include <climits>
#include <cmath>
#include <cassert>
#include <sstream>
#include <algorithm>
#include <valarray>
#include <utility>
#include <vector>
#include <string>
#include <stack>
#include <queue>
#include <map>
#include <set>

#define MAX 100
#define INF 1<<20
#define LLINF 10e12 // 1<<31 // 2^31
#define REP(i,n) for(int i=0;i<n;i++)
#define REP2(i,a,n) for(int i=(a);i<(n);i++)
#define SET(a,c) memset(a,c,sizeof a)
#define FOR(i,c) for(__typeof((c).begin())i=(c).begin();i!=(c).end();++i)
#define FOREACH(i,c) for(auto (i) : (c))
#define BIT(i,j) ((i)>>(j))&1
#define ALL(o) (o).begin(), (o).end()
#define ERASE(o) (o).erase(unique(ALL((o))), (o).end());

using namespace std;
typedef long long ll;
typedef valarray<int> array_t;
/////

int main()
{
  cin.tie(0);
  ios::sync_with_stdio(false);
  // FROM HERE
  string str; getline(cin,str);
  REP(i,str.length())
  {
    if(str[i] == '.' || str[i] == ' ') printf("%c",str[i]);
    else printf("%c",(str[i]-'a'+'A'));
  }
  printf("\n");
  return 0;
}

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

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

int main()
{
	string in;
	getline(cin,in);

	for(int i=0;i<in.size();i++)
	{
		if(islower(in[i])) in[i]=toupper(in[i]);
	}
	cout<<in<<endl;
	return 0;
}

C++: #include<stdio.h>
void main(){
	char c;
	for(;~(c=getchar());printf("%c",c))
		c>='a'&&c<='z'?c-=32:0;
}

C++: #include <iostream>
#include <stdio.h>
#include <vector>
#include <string>
#include <algorithm>
#include <sstream>
#include <stdlib.h>

using namespace std;

int main(void){
	
	string str, ans;
	getline(cin, str);
	ans = str;
	for(int i = 0; i < str.length(); i++ ) {
		if( str[i] < 'a' || str[i] > 'z' ) continue;
		ans[i] = str[i] - 'a' + 'A';
	}
	cout << ans << endl;
    return 0;
}

C++: #include <stdio.h>

int main(void)
{
	char str[1001];
	int i;
	
	fgets(str, 1000, stdin);
	
	i = 0;
	while (str[i] != '\0'){
		if (str[i] <= 'z' && str[i] >= 'a'){
			str[i] -= ('a' - 'A');
		}
		i++;
	}
	
	printf("%s", str);
	
	return (0);
}

C++: #include <iostream>

std::string str;

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

    int len = str.length();
    for(int i=0; i < len; ++i) {
        char c = str[i];
        if(c >= 'a' && c <= 'z') {
            char upper = (c - 'a') + 'A';
            std::cout << upper;
        } else {
            std::cout << c;
        }
    }
}

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

using namespace std;

int main() {
    string a;
    
    while(getline(cin,a)){
        
        for(int i=0; i<(int)a.length(); i++){
            if(a[i]==' '|| a[i]=='.'){
                
            }else{
                a[i]=toupper(a[i]);
            }
        }
        
        cout<<a<<endl;;
    }
    
    return 0;
}

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

using namespace std;

void upcase(string& s) {
  for (int i = 0; i < s.length(); i++)
    if (islower(s[i])) s[i] -= 32;
  return;
}

int main() {
  string str;
  getline(cin, str);
  upcase(str);
  cout << str <<endl;
  return 0;
}