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 <string>
#include <algorithm>

class capitalize {
public:
    capitalize();
    bool Run();

private:
    
    bool Input();
    bool Convert();
    void Show() const;

private:
    std::string m_lower;    // Lower case
    std::string m_upper;    // Upper case
};

capitalize::capitalize() : m_lower(""), m_upper("")
{

}

bool capitalize::Run()
{
    bool status = false;

    status = Input();
    if (!status) {
        return false;
    }
    status = Convert();
    if (!status) {
        return false;
    }
    Show();

    return true;
}

bool capitalize::Input()
{
    std::getline(std::cin, m_lower);
    if (0 == m_lower.size()) {
        return false;
    }
    return true;
}

bool capitalize::Convert()
{
    m_upper.resize(m_lower.size());
    std::transform(m_lower.begin(), m_lower.end(), m_upper.begin(), toupper);

    return true;
}

void capitalize::Show() const
{
    std::cout << m_upper << std::endl;
}

int main()
{
    capitalize test;
    test.Run();
}

C++: #include <iostream>
#include <string>
#include <algorithm>
#include <cstring>
using namespace std;
int main(){
	char a[1000000];
	char b[1000000];
	cin.getline(a,1000000);
	for (int i = 0; a[i] != '.'; i++){
			b[i]=toupper(a[i]);
	}

	cout << b << "." << endl;
	return 0;
}

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


int main()
{
	string inputString;
	getline(cin, inputString);
	for (auto& c : inputString)
	{
		if (c != '.' && c != ' ') c += 'A' - 'a';
	}

	cout << inputString << endl;

	return 0;
}

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

using namespace std;

int main(){
	string word, ans;

	getline(cin, word);
	transform(word.begin(), word.end(), word.begin(), toupper);
	cout << word << endl;

	return 0;    
}

C++: #include <iostream>
#include <algorithm>
#include <functional>
#include <vector>
#include <cstdio>
#include <string>
#include <cmath>
#include <cfloat>
#include <map>
using namespace std;
int main(){
	
	string x;
	
	getline(cin,x);
	transform(x.begin(),x.end(),x.begin(),::toupper);
	cout<<x<<endl;
	

}

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

#define pb(n) push_back(n)
#define fi first
#define se second
#define np string::npos
#define X real()
#define Y imag()
#define value(x,y,w,h) (x >= 0 && x < w && y >= 0 && y < h)
#define all(r) (r).begin(),(r).end()
#define gsort(st,en) sort((st),(en),greater<int>())
#define vmax(ary) *max_element(all(ary))
#define vmin(ary) *min_element(all(ary))
#define debug(x) cout<<#x<<": "<<x<<endl
#define fcout(n) cout<<fixed<<setprecision((n))
#define scout(n) cout<<setw(n)

#define rep(i,n) for(int i = 0; i < (int)(n);++i)
#define repc(i,a,b) for(int i = (a);i < (int)(b);++i)
#define repi(it,array) for(auto it = array.begin(),end = array.end(); it != end;++it)
#define repa(n,array) for(auto &n :(array))

typedef long long ll ;
typedef deque<int> di ;
typedef deque<ll> dl ;
typedef map<string,int> dict;
typedef complex<double> comd;
typedef pair<int,int> pii;

constexpr int imax = ((1<<30)-1)*2+1 ;
constexpr int inf = 100000000;
constexpr double PI = acos(-1.0) ;
double eps = 1e-10 ;
const int dy[] = {-1,0,1,0};
const int dx[] = {0,-1,0,1};

double CalcDist(comd p1, comd p2){
  return sqrt(pow(p1.X - p2.X,2.0) + pow(p1.Y -p2.Y,2.0));
}

template <typename T>
void out(deque < T > d)
{
  for(size_t i = 0; i < d.size(); i++)
  {
    debug(d[i]);
  }
}

template<typename T>
T ston(string& str, T n){
  istringstream sin(str) ;
  T num ;
  sin >> num ;
  return num ;
}

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

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

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

C++: #include <iostream>
#include <string>
//using namespace System;
using namespace std;
int main()
{
	string s;
    getline(cin,s);
	for(int i=0;i<s.size();i++){
		char c=s[i];
		(97<=c&&c<=122)?printf("%c",c-32):printf("%c",c);
	}
	cout<<endl;
    return 0;
}

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

int main(void){
	char in[256];
	fgets(in, 255, stdin);
	int len = strlen(in) - 1;
	in[len] = '\0';
	for(int i=0; i<len; ++i){
		in[i] = toupper(in[i]);
	}
	puts(in);
	return 0;
}

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

int main(void){
	char buff[8192];
	char *p;

	gets(buff);
	p=buff;
	while(*p!='\0'){
		*p=toupper(*p);
		p++;
	}
	printf("%s\n",buff);
}

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

using namespace std;

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

C++: #include <stdio.h>
int main() {char T;while (1) {T=getchar();if (T==EOF) return 0;if (T>='a' && T<='z') T-=32;putchar(T);}}

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

int main(){
  int i = 0;
  char str[10000];
  
  fgets(str, 128, stdin);

  while(str[i] != '\n'){
    if('a' <= str[i] && str[i] <= 'z'){
      str[i] = str[i] - 'a' + 65;
    }
    i++;
  }
  
  cout << str << flush;

  return 0;
}

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

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

C++: #include <iostream>
#include <algorithm>
#include <functional>
#include <cstdlib>
#include <sstream>
#include <string>
#include <set>
#include <map>
#include <stack>
#include <queue>
#include <deque>
#include <complex>
#include <vector>
#include <cstdio>
#include <cmath>
#include <time.h>
#define all(c) ((c).begin(),(c).end())
#define rall(c) (c).rbegin(),(c).rend()
//#define sort(v,n) sort(v,v+n)
//#define vsort(v) sort(v.begin(),v.end())
//#define vvsort(v) sort(v.begin(),v.end(),greater<int>())
#define ll long long
#define pb(a) push_back(a)
#define fi first
#define se second
#define inf 999999999
using namespace std;
const ll MOD = 1e9 + 7;
const double PI = acos(-1.0);
//---------------------------------------------------------------------------------------------//
string s;

int main() {
	getline(cin, s);
	for (int i = 0; i < s.length(); i++) {
		if (s[i] == ' ') {
			cout << " ";
			continue;
		}
		if (s[i] == '.') {
			cout << ".";
			continue;
		}
		char b = s[i] -32;
		cout << b;
	}
	cout << endl;
}

C++: #include<iostream>
#include<cstdio>
#include<cctype>
using namespace std;
#define ARRAY_MAX 200

int main(void){

    char array[ARRAY_MAX];

    int i = 0;

    fgets(array,ARRAY_MAX,stdin);

    while(array[i] != '\0'){
        array[i] = toupper(array[i]);
        i++;
    }
    i = 0;
    while(array[i] != '\0'){
        cout << array[i];
        i++;
    }
    cout << 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;
    string a;
    getline(cin,a);
    for(i=0; i<a.size(); i++){
             if(a[i]!='.')
             a[i]=a[i]-32;
             cout << a[i];         
    }cout <<" ";
    
    return 0;
}