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 <cstdio>
#include <iostream>
#include <string>
using namespace std;
#define rep(i,a) for(int i = 0 ; i < a ; i ++)
bool isChar(char i){
  if('a'<=i && i <='z')return true;
  return false;
}
int main(void){
  string s;
  while(cin>>s){
    rep(i,s.size()){
      if(isChar(s[i])){
	s[i]-=32;
      }
    }
    cout<<s<<" ";
  }
  cout<<endl;
}

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

C++: #include<iostream>
#include<algorithm>
#include<vector>
#include<stack>
#include<queue>
#include<cstdio>
#include<climits>
#include<cmath>
#include<cstring>
#include<string>
#include<complex>
#include<iomanip>
 
#define EPS (1e-10)
using namespace std;
#define PI (3.1415926535)
 
int main(){
    string str;

	getline(cin, str);

	for(int i = 0; i < str.size(); i++){
		if(str[i] >= 'a' && str[i] <= 'z'){
			str[i] += 'A'-'a';
		}
	}

	cout << str << endl;

	return 0;
}

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

using namespace std;

#define OUT cout <<
#define IN cin >>
#define E << endl;
#define FOR(i,a,b) for(int i = a;i < b;i++)


string str;


int main(){
	while(IN str){
		FOR(i,0,str.size()){
			str[i] = (char)toupper((int)(str[i]));
		}
		OUT str << " ";
}
	OUT "\n";

}

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

using namespace std;


#define all(c) ((c).begin()), ((c).end())
#define debug(c) cerr << "> " << #c << " = " << (c) << endl;
#define iter(c) __typeof((c).begin())
#define present(c, e) ((c).find((e)) != (c).end())
#define cpresent(c, e) (find(all(c), (e)) != (c).end())
#define tr(i, c) for (iter(c) i = (c).begin(); i != (c).end(); i++)
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define REP(i, a, b) for (int i = (int)(a); i <= (int)(b); i++)

#define mp make_pair
#define fst first
#define snd second
#define pb push_back


const double EPS = 1e-10;


typedef long long ll;
typedef vector<int> vi;
typedef pair<int, int> pii;
typedef complex<double> P;


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

C++: #include<iostream>
#include<string>
#include<cstdio>
#include<algorithm>
#include<stack>
#include<queue>
#include<vector>
#include<cmath>
#include<cctype>

#define ll long long int

using namespace std;
typedef pair<int, int> P;

string str;

int main()
{
  int i=0,j;
  while(1){
    cin>>str;
    for(j=0;j<str.size();j++)
      str[j]=toupper(str[j]);
    cout<<str;
    if(str[str.size()-1]=='.')
      break;
    else
      cout<<" ";
  }
  cout<<endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    map<char,char> mp;
    for(char c='a',C='A';c<='z';c++,C++){
        mp[c] = C;
    }

    string s;
    getline(cin,s);
    for(char c : s){
        if(c==' ' or c=='.') cout << c;
        else cout << mp[c];
    }
    cout << endl;
}

C++: #include <bits/stdc++.h>
using namespace std;
/*{{{*/  //template
#define rep(i,n) for(int i=0;i<n;i++)
constexpr int INF = numeric_limits<int>::max()/2;
constexpr long long LINF = numeric_limits<long long>::max()/3;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define fi first
#define se second
#define all(v) (v).begin(),(v).end()
#define sz(x) (int)(x).size()
#define debug(x) cerr<<#x<<":"<<x<<endl
#define debug2(x,y) cerr<<#x<<","<<#y":"<<x<<","<<y<<endl
//struct fin{ fin(){ cin.tie(0); ios::sync_with_stdio(false); } } fin_;
struct Double{ double d; explicit Double(double x) : d(x){} };
ostream& operator<<(ostream& os,const Double x){ os << fixed << setprecision(20) << x.d; return os; }
template<typename T> ostream& operator<<(ostream& os,const vector<T>& vec){ os << "["; for(const auto& v : vec){ os << v << ","; } os << "]"; return os; }
template<typename T,typename U> ostream& operator<<(ostream& os,const pair<T,U>& p){ os << "(" << p.first << ","<< p.second <<")"; return os; }
template<typename T> ostream& operator<<(ostream& os,const set<T>& st){ os<<"{"; for(T v:st) os<<v<<","; os <<"}"; return os; }
template<typename T,typename U> inline void chmax(T &x,U y){ if(y>x) x = y; }
template<typename T,typename U> inline void chmin(T &x,U y){ if(y<x) x = y; }
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<vi> vvi;
ll gcd(ll a,ll b){ if(b==0) return a; else return gcd(b,a%b); }
//constexpr double eps = 1e-14; 
constexpr double eps = 1e-10; 
constexpr ll mod = 1e9+7;
const int dx[]={1,0,-1,0} ,dy[] = {0,1,0,-1};
/*}}}*/

int main(){
    map<char,char> mp;
    for(char c='a',C='A';c<='z';c++,C++){
        mp[c] = C;
    }

    string s;cin>>s;
    for(char c : s){
        if(c==' ' or c=='.') cout << c;
        else cout << mp[c];
    }
    cout << endl;
}

C++: #include <stdio.h>

int main(void)
{
    char c;

    while(~(c = getchar()))
        putchar('a' <= c && c <= 'z' ? c-'a' + 'A' :c);

    return (0);
}

C++: #include <iostream>
#include <cstdio>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <cctype>



using namespace std;

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

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