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<cstdio>
using namespace std;

int main(void){

	char inp;

	while(scanf("%c",&inp)!=EOF){
		putchar((inp>'a'&&inp<'z')?inp-32:inp);
	}
    return 0;
}

C++: #include<stdio.h>
int main(){
	int t='a'-'A';
	char s[201];
	fgets(s,201,stdin);
	for(int i=0;s[i]!='\0';i++)if(s[i] >= 97 && s[i] <=122)s[i]-=t;
	printf("%s",s);
return 0;
	}

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

using namespace std;

int main()
{
	char sta[210];
	cin.getline(sta, 210);
	string sa = sta;

	transform(sa.begin(), sa.end(), sa.begin(), toupper);
	cout << sa << endl;

	return 0;
}

C++: #include <iostream>
#include <string>
#include <algorithm>
char ToUpper (char cX) { return toupper(cX); } 
using namespace std;

int main() {
	string in;
	getline(cin, in);
	transform(in.begin(), in.end(), in.begin(), ToUpper);
	cout<<in<<;
	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<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;

int main()
{
  char str[1000];
  int i=0,j;
  while(1){
    scanf("%c",&str[i]);
    if(str[i]=='.')break;
    i++;
  }
  str[i+1]='\0';
  for(j=0;j<i;j++){
    str[j]=toupper(str[j]);
  }
  cout<<str<<endl;

}

C++: #include <cstdio>

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

C++: #include <bits/stdc++.h>
using namespace std;
 
int main(){
    char c;
    while(c=getchar(),c!=-1){
        if( c >= 'a' and c <= 'z' ) c = c - 'a' + 'A';
        cout << c;
    }
     
     
}

C++: #include <iostream>
#include <ctype.h>
using namespace std;
void str_toupper(char *str)
{
	do{
		*str = toupper(*str);
	}while(*str++);
}
int main(void)
{
	char str[100];
	gets(str);
	str_toupper(str);
	cout << str << endl;
	return 0;
}

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

int main(){
	string st;
	getline(cin,st);
	//st.upper(st.begin(), st.end());
	for( int i = 0; i < st.size(); i++ ){
		cout << (char)toupper(st[i]);
	}
	cout << endl;
}

C++: #include <stdio.h>
#include <math.h>
#include <cctype>
#include<queue>
#include<stack>
#include<cstdio>
#include <algorithm>
#include <cstdio>
using namespace std;
int main(){
	string s;
	cin>>s;
	while(cin>>s){
		for(int i=0;i<s.size();i++){
			s[i]=toupper(s[i]);
		}
		cout<<s<<" ";
	}
	cout<<endl;
}

C++: #include<iostream>
#include<string>
#include<algorithm>
#include<cstdlib>
using namespace std;
int main(){
  string x;
  getline(cin,x);
    transform (x.begin(), x.end(), x.begin(),(int (*)(int)) toupper);
    cout<<x<<endl;
}

C++: 
//Nayeem Shahriar Joy ,Applied Physics And Electronic Engineering , University of Rajshahi.


#include <bits/stdc++.h>
#include<algorithm>
#include<cstring>
#include<string>

using namespace std;

int main()

{

  ios_base::sync_with_stdio(false);

  cin.tie(NULL);

  string s;

  getline(cin,s);

  for(int i=0;i<s.size();i++)

  {
      s[i]=toupper(s[i]);
  }

  cout<<s<<endl;

  return 0;

}

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

int main() {
	std::string str;
	int i;
	std::getline(std::cin, str);
	for (std::string::iterator it = str.begin(); it != str.end(); ++it) {
		*it = toupper(*it);
	}
	std::cout << str << '\n';
	return 0;
}

C++: #include <iostream>

using namespace std;

int main() {
	string s;
	getline(cin, s);
	for (int i = 0; i < s.size(); i++) {
		char c = s[i];
		if (islower(c)) {
			c = toupper(c);
			s[i] = c;
		}
	}
	cout << s << endl;
	return 0;
}

C++: //#include<bits/stdc++.h>
//using namespace std;
#include<stdio.h>
#include<string.h>
char s[100000] = {0};
int cou = 0;

int main()
{
    int length;


        //cin >> s;
        for(int i = 0; i < 100000; i++)
        {
            scanf("%c",&s[i]);
            if(s[i] == '\n')break;
            if('a' <= s[i] && s[i] <= 'z')
            {
                s[i] = s[i] - 32;
            }
            cou++;
        }
        /*length = strlen(s);
        for(int i = 0; i < length; i++)
        {

        }
        //cout << s << endl;*/
        for(int i = 0; i < cou; i++)
        {
            printf("%c",s[i]);
        }
        printf("\n");


    return 0;
}

C++: #include <cstdio>
#include <cstring>
#include <string>
#include <cmath>
#include <cassert>
#include <iostream>
#include <algorithm>
#include <stack>
#include <queue>
#include <vector>
#include <set>
#include <map>
#include <bitset>
#include <functional>
#include <sstream>
#include <utility>
#include <cstdlib>
#include <cctype>
#include <climits>
#include <fstream>

using namespace std;
typedef long long ll;
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define rep(i,n) for(int i=0;i<(n);++i)
#define foreach(itr,c) for(__typeof(c.begin()) itr=c.begin(); itr!=c.end(); itr++)
#define dbg(x) cout << #x"="<< (x) << endl
#define mp(a,b) make_pair((a),(b))
#define pb(a) push_back(a) 
#define in(x) cin >> x;
#define all(x) (x).begin(), (x).end()
#define INF 2147483600
#define fi first
#define se second
using namespace std;

string shift_str(string str)
{
    int ascii;
    string ret;
     
    for (int i=0; i<str.length(); i++)
    {
        ascii = str[i];
        ret += ((ascii - 'a') + 'A' - 1);         
    }
     
    return ret;
}
 
int main()
{
    string str;
    string ret;
     
    getline(cin,str);
    ret += shift_str(str);
    return 0;
}

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

using namespace std;

int main() {
	string str;
	while (cin>>str) {
		for (int i=0; i<str.length(); i++) {
			if (str[i] != ' ' && str[i] != '.') {
				str[i] = toupper(str[i]);
			}
		}
		cout << str << " ";
	}
	return 0;
}

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

using namespace std;

int main()
{
    string s;
    getline(cin, s);
    for (char &c: s) {
        if (islower(c)) c = toupper(c);
    }
    cout << s << endl;
    return 0;
}

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

struct toup {
	char operator()(char c) { return toupper(c); }
};

int main() {
	string str;
	getline(cin, str);
	transform(str.begin(), str.end(), str.begin(), toup());
	cout << str << flush;
	return 0;
}

C++: #include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <cmath>
#include <queue>
#include <numeric>
#include <climits>
#include <iterator>
#include <iomanip>
#include <stack>
#include <set>
#include <cstdio>
#include <bitset>
#include <functional>
#include <tuple>
#include <list>
#include <deque>
using namespace std;
typedef pair<int, int> P;

#define FOR(i, a, n) for (ll i = (ll)a; i<(ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)

typedef long long ll;
typedef vector<int> VI;

int main() {
    string s; getline(cin, s);
    
    for(int i=0; i<s.size(); ++i){
        if(s[i]>='a'&&s[i]<='z'){
            cout << (char)(s[i]-32);
        }else{
            cout << s[i];
        }
    }
    cout << endl;
    
	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;
}