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 <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <map>
#include <numeric>
using namespace std;

#define FOR(i,a,b) for(long long int i=(a);i<(b);i++)
#define REP(i,n) for(long long int i=0;i<(n);i++)
#define ALL(s) (s).begin(),(s).end()

#define PI 3.14159265358479

typedef long long ll;
typedef vector<long long int> vi;
typedef vector<long long int>::iterator vit;

int main(){
	int c = 0;
	string s;
	vector<string> vs;
	while (cin >> s){
		c++;
		REP(i, s.size()){
			if (s[i] != '.'){
				s[i] += 'A' - 'a';
			}
		}
		vs.push_back(s);
	}
	REP(i, c){
		if (i == c - 1){
			cout << vs[i] << "\n";
		}
		else {
			cout << vs[i] << " ";
		}
	}
}

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

class trans {
public:
    void operator ()(char &c)
    {
        if (isalpha(c)) c = toupper(c);
    }
};

int main()
{
    std::string s;
    getline(std::cin, s);
    std::for_each(s.begin(), s.end(), trans());
    std::cout << s << std::endl;
}

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

int
main(void)
{
	char line[256];

	if (fgets(line, sizeof line, stdin)) {
		int len = strlen(line);
		for (int i = 0; i < len; i++) {
			if (islower(line[i])) {
				line[i] = toupper(line[i]);
			}
		}
		
		printf("%s\n", line);
	}

	return 0;
}

C++: #include<bits/stdc++.h>
#define rep(i,n) for(int i=0; i<n; i++)
#define INF 1000000
using namespace std;
int main(){
    string s;
    getline(cin,s);
    //scanf("%s",s);
    transform(s.begin(),s.end(),s.begin(),::toupper);
    cout << s << endl;
    return 0;
}

C++: #include <iostream>
#include <stdlib.h>
#include <stdio.h>
#include <algorithm>
#include <string.h>
using namespace std;
int main(){
    int i,n;
    char a[10000];
    while(cin>>a){
    for(i=0; i<strlen(a); i++){
             if(a[i]!='.')
             a[i]=a[i]-32;
             cout << a[i];         
    }cout <<" ";
    }
    return 0;
}

C++: #include<cstdio>

using namespace std;

int n;
double x[4],y[4];

int main()
 {
	
scanf("%d",&n);
	
for (int c = 0; c < n; c++)
{
		
for (int i = 0; i < 4; i++){			
scanf("%lf%lf",&x[i],&y[i]);
}
		
puts((y[1]-y[0])/(x[1]-x[0]) == (y[3]-y[2])/(x[3]-x[2])?"YES":"NO");
	
}
 }

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

#define rep(i,n) for(int i=0;i<n;i++)
#define REP(i,s,n) for(int i=(s);i<=(n);i++)
#define repr(i,n) for(int i=n-1;i>=0;i--)
#define REPR(i,s,n) for(int i=(s);i>=(n);i--)
#define all(a) (a).begin(),(a).end()
#define rall(a) (a).rbegin(),(a).rend()
#define Eunique(v) v.erase(unique(all(v)),v.end())
#define Eback(s) s.erase(s.end()-1,s.end())
#define rev(v) reverse(all(v))
#define minvec(v) *min_element(all(v))
#define maxvec(v) *max_element(all(v))
#define sumvec(v) accumulate(all(v),0LL)
#define mapmin(v) v.rbegin()->first
#define mapmax(v) v.begin()->first
#define pb push_back
#define pf push_front
#define m_p make_pair
#define DOUBLE fixed << setprecision(15)
#define OK cerr<<"OK\n"
#define OK1 cerr<<"OK1\n"
#define OK2 cerr<<"OK2\n"
#define SIZE(s) (int)s.size()
#define INF ((1LL<<62)-(1LL<<31))
#define zero(x,n) setw(x) << setfill('0') << n
#define endl '\n'

typedef long long ll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<long long> vll;
typedef vector<vll> vvll;
typedef vector<double> vd;
typedef vector<vd> vvd;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<string> vs;

typedef pair<ll,ll> pll;
typedef pair<int,int> pii;
typedef vector<pair<int,int>> vpii;
typedef vector<pair<ll,ll>> vpll;

const double pi = acos(-1.0);
const ll mod=1000000007;
const ll mod2=998244353;

template<class A, class B>
ostream& operator<<(ostream& ost, const pair<A, B>&p) {
	ost << "{" << p.first << ", " << p.second << "} ";
	return ost;
}

template<class T>
ostream& operator<<(ostream& ost, const vector<T>&v) {
	ost << "{";
	for (int i = 0; i<(int)v.size(); i++) {
		if (i)ost << " ";
		ost << v[i];
	}
	ost << "} \n";
	return ost;
}

template<class A, class B>
ostream& operator<<(ostream& ost, const map<A, B>&v) {
	ost << "{";
	for (auto p:v) {
		ost << "{" << p.first << ", " << p.second << "} ";
	}
	ost << "} ";
	return ost;
}

template<class T>
inline bool chmax(T& a, T b){if(a<b){a=b;return true;} return false;}

template<class T>
inline bool chmin(T& a, T b){if(a>b){a=b;return true;} return false;}

void YES(bool b) {cout << ((b)?"YES\n":"NO\n");}
void Yes(bool b) {cout << ((b)?"Yes\n":"No\n");}
void yes(bool b) {cout << ((b)?"yes\n":"no\n");}
void Yay(bool b) {cout << ((b)?"Yay!\n":":(\n");}

ll powmod(ll a,ll b){ll c=1; while(b>0){ if(b&1){ c=a*c%mod; } a=a*a%mod; b>>=1; } return c;}
ll nCrmod(ll n,ll r){ll x=1,y=1; rep(i,r){x=x*(n-i)%mod; y=y*(i+1)%mod;} return x*powmod(y,mod-2)%mod;}
ll gcd(ll x, ll y) {return __gcd(x,y);}
ll lcm(ll x, ll y) {return x/__gcd(x,y)*y;}

int main()
{
	string s;
	getline(cin,s);
	rep(i,SIZE(s)){
		if(s[i]!=' ' && s[i]!='.') s[i]-=32;
	}
	cout << s << 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('A'<=s && 'Z'>=s) printf("%c",s);
		if('a'<=s && 'z'>=s){
			s=s-('a'-'A');
			printf("%c",s);
		}
		else printf("%c",s);
	}
	printf("\n");
	return 0;
}

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