Problem:


Score : 100 points

Problem Statement

You are given three words s_1, s_2 and s_3, each composed of lowercase English letters, with spaces in between.
Print the acronym formed from the uppercased initial letters of the words.

Constraints

s_1, s_2 and s_3 are composed of lowercase English letters.

1 ≤ |s_i| ≤ 10 (1≤i≤3)

Input

Input is given from Standard Input in the following format:

s_1 s_2 s_3

Output

Print the answer.

Sample Input 1

atcoder beginner contest

Sample Output 1

ABC

The initial letters of atcoder, beginner and contest are a, b and c. Uppercase and concatenate them to obtain ABC.

Sample Input 2

resident register number

Sample Output 2

RRN

Sample Input 3

k nearest neighbor

Sample Output 3

KNN

Sample Input 4

async layered coding

Sample Output 4

ALC



Sample input:
atcoder beginner contest


Sample output:
ABC

Submission status: Runtime Error

Solution code:
x,y=map(int,input().split())
if abs(x-y)<=1:
  print('Brown')
else:
  print('Alice')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(upper(a[0]+b[0]+c[0])

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
str.capitalize(a,b,c)
print(a[0]+b[0]+c[0])

Submission status: Runtime Error

Solution code:
s, t, u = map(str, input().split())

print(s.upper[0]+t.upper[0]+u.upper[0])

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map(str, input().split())
lst = [s[0], s[1], s[2]].capitallize()
print(''.join(lst))

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map( str, input().split() )
print( s1[0].upper + s2[0].upper + s3[0].upper )

Submission status: Runtime Error

Solution code:
N = int(input())
A = list(map(int, input().split()))
currentSum = 0
count1 = 0
count2 = 0

for i in range(N):
    restSum = currentSum
    currentSum += A[i]
    if currentSum <= 0 and restSum < 0:
        count1 += abs(currentSum) + 1
        currentSum = 1
    elif currentSum >= 0 and restSum > 0:
        count1 += abs(currentSum) + 1
        currentSum = -1
    elif currentSum == 0 and restSum == 0:
        count1 += 1
        currentSum = -1
        
currentSum = 0
for i in range(N):
    restSum = currentSum
    currentSum += A[i]
    if currentSum <= 0 and restSum < 0:
        count2 += abs(currentSum) + 1
        currentSum = 1
    elif currentSum >= 0 and restSum > 0:
        count2 += abs(currentSum) + 1
        currentSum = -1
    elif currentSum == 0 and restSum == 0:
        count2 += 1
        currentSum = -1
        
print(min(count1, count2))

Submission status: Runtime Error

Solution code:
# 
si = lambda: input()
ni = lambda: int(input())
nm = lambda: map(int, input().split())
nl = lambda: list(map(int, input().split()))
a,b,c = map(str, input().split())
ans = ''
ans = a[0:1]+b[0:1]+c[0:1]
ans = ans.upper()
pritn(ans)

Submission status: Runtime Error

Solution code:
strs = input.split()
print("".join([a[0].upper() for a in strs]))

Submission status: Runtime Error

Solution code:
a,b,c===input().split()
print((a[0]+b[0]+c[0]).upper())

Submission status: Runtime Error

Solution code:
x, y =map(int,input().split())
 
print("Alice") if abs(x - y) >= 2 else print("Brown")

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))

even_is_negative = 0
odd_is_nagative = 0

for i in range(n):
    if i % 2 == 0 and a[i] < 0:
        even_is_negative += 1
    elif i % 2 == 1 and a[i] < 0:
        odd_is_nagative += 1

# print(even_is_negative)
# print(odd_is_nagative)

sum = a[0]
change = 0

if even_is_negative >= odd_is_nagative:
    for i in range(1, n):
        if i % 2 == 1 and sum + a[i] <= 0:
            change += abs(sum + a[i]) + 1
            sum = 1
            # print("a " + str(sum))
        elif i % 2 == 0 and sum + a[i] >= 0:
            change += sum + abs(a[i]) + 1
            sum = -1
            # print("b " + str(sum))
        else:
            sum += a[i]
            # print("c " + str(sum))

if even_is_negative < odd_is_nagative:
    for i in range(1, n):
        if i % 2 == 1 and sum + a[i] >= 0:
            change += sum + abs(a[i]) + 1
            sum = -1
            # print("a " + str(sum) + str(change))
        elif i % 2 == 0 and sum + a[i] <= 0:
            change += abs(sum + a[i]) + 1
            sum = 1
            # print("b " + str(sum)+ str(change))
        else:
            sum += a[i]
            # print("c " + str(sum)+ str(change))

if sum == 0:
    print(change + 1)
else:
    print(change)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
print(str.upper(a[0]+b[0]+c[0]))

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
a=list(a)
b=list(b)
c=list(c)
print(a[0].upper+b[0].upper+c[0].upper)

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
s3 = input()

s1.upper()
s2.upper()
s3.upper()

print(s1[0] + s2[0] + s3[0])

Submission status: Runtime Error

Solution code:
s1 = input()
s2 = input()
s3 = input()

print(s1.upper()[0] + s2.upper()[0] + s3.upper()[0])

Submission status: Runtime Error

Solution code:
s1,s2,s3=input.split()
ans="".join([s1[0],s2[0],s3[0]])
print(ans.upper())

Submission status: Runtime Error

Solution code:
s1,s2,s3=map(input().split())
print(s1[0]+s2[0]+s3[0])

Submission status: Runtime Error

Solution code:
s1,s2,s3=map(int,input().split())
print(s1[0]+s2[0]+s3[0])

Submission status: Runtime Error

Solution code:
s1,s2,s3 = input().split()

s1 = s1[0:1].upper
s2 = s2[0:1].upper
s3 = s3[0:1].upper
print(s1 + s2 + s3)

Submission status: Runtime Error

Solution code:
a,b,c=import().split()
print(a[0].upper()+b[0].upper()+c[0].upper())

Submission status: Runtime Error

Solution code:
a,b,c = map(str, input().split())
print(str(a[0].uppercase)+str(b[0].uppercase)+str(c[0].uppercase))

Submission status: Runtime Error

Solution code:
a= input()
b= input()
c= input()
str = a[0] + b[0] + c[0]
print(str)

Submission status: Runtime Error

Solution code:
s = input().split()
str = s[0][0] + s[1][0] + s[2][0]
print(str.upper())

Submission status: Runtime Error

Solution code:
s1,s2,s3 = map(str,input())
bs1 = s1.upper()
bs2 = s2.upper()
bs3 = s3.upper()
print(bs1[0]+bs2[0]+bs3[0])

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split()
print(s1[0].upper() + S2[0].upper() + S3[0].upper())

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
print((a[0]+b[1]+c[2]).upper())

Submission status: Runtime Error

Solution code:
a,b,c=input()
komoji=a[0]+b[0]+c[0]
print(komoji.upper())

Submission status: Runtime Error

Solution code:
A = int(input())
B = int(input())
print('LESS' if A < B else 'GREATER' if A > B else 'EQUAL')

Submission status: Runtime Error

Solution code:
a, b, c = input().split().upper()
print((a[0], b[0], c[0]).sep())

Submission status: Runtime Error

Solution code:
a, b, c = input().split()
print((a[0], b[0], c[0]).sep())

Submission status: Runtime Error

Solution code:
a, b, c = map(str, input().split().upper())
print(a[0] + b[0] + c[0])

Submission status: Runtime Error

Solution code:
a, b, c = map(str, input().split().upper())
print(a[0] + b[0] + c[0])

Submission status: Runtime Error

Solution code:
a,b,c=map(upper(),input().split())
print(a[0],b[0],c[0])

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map(str, input().split())
s1.upper
s2.upper
s3.upper
print("{0}{1}{2}".format(s1[0], s2[0], s3[0])

Submission status: Runtime Error

Solution code:
A, B, C = map(str, input().split())
print(A.upper[0]+B.upper[0]+C.upper[0])

Submission status: Runtime Error

Solution code:
a = input()
b = input()

if a == b:
    print("EQUAL")
if len(a) > len(b):
    print("GREATER")
elif len(a) < len(b):
    print("LESS")
else:
    for i in range(len(a)):
        if int(a[i]) > int(b[i]):
            print("GREATER")
            break
        elif int(a[i]) < int(b[i]):
            print("LESS")
            break

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print((a[0],b[0],c[0],sep='').upper())

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print((a[0],b[0],c[0],sep='').upper)

Submission status: Runtime Error

Solution code:
lines = input().split()
print(str.upper(lines[0][0])+str.upper(lines[1][0]+str.upper(lines[2][0]))

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split()
s = s1[0]+s2[0]+s3[0]
print(upper(s))

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print((a[0]+b[0]+c[0]).upper())

Submission status: Runtime Error

Solution code:
print((input()[0]+input()[0]+input()[0]).upper())

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
print(upper(a[0]+b[0]+c[0]))

Submission status: Runtime Error

Solution code:
n=int(input())
lista=list(map(int,input().split()))

goukei=0
count=0

for i in range(n):
    number=lista[i]+goukei
    if i%2==0:
        if number>=0:
            count=count+number+1
            goukei=-1
        else:
            goukei=number
    else:
        if number<=0:
            count=count+abs(number)+1
            goukei=1
        else:
            goukei=number

count1=count

goukei=0
count=0

for i in range(n):
    number=lista[i]+goukei
    if i%2==1:
        if number>=0:
            count=count+number+1
            goukei=-1
        else:
            goukei=number
    else:
        if number<=0:
            count=count+abs(number)+1
            goukei=1
        else:
            goukei=number
print(min(count,count1))

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
print("GREATER" if a > b else "EQUAL" if a == b else "LESS")

Submission status: Runtime Error

Solution code:
A.upper(),B.upper(),C.upper() = input().split()
print(A[0]+B[0]+C[0])

Submission status: Runtime Error

Solution code:
s = list(map(int, input().split()))
print(s[0].upper()+s[1].upper()+s[2].upper())

Submission status: Runtime Error

Solution code:
print("".join(x[0].upper()for x input().split()))

Submission status: Runtime Error

Solution code:
#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vector<int>>;
using vvl = vector<vector<ll>>;

int main() {
  cin.tie(nullptr);
  ios::sync_with_stdio(false);
  string s, t, u;
  cin >> s >> t >> u;
  string ans;
  ans.push_back(s[0] - 'a' + 'A');
  ans.push_back(t[0] - 'a' + 'A');
  ans.push_back(u[0] - 'a' + 'A');
  cout << ans << endl;
  return 0;
}

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split()
ans = (s1[0]+s2[0]+s3[3]).upper()
print(ans)

Submission status: Runtime Error

Solution code:
a,b=[int(input()) for i in range(2)]
print('GREATER' if a>b else 'LESS' if a<b else 'EQUAL')

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
a,b,c=str.apper(a),str.apper(b),str.apper(c)
print(a[0]+b[0]+c[0])

Submission status: Runtime Error

Solution code:
n=int(input())
b=list(map(int,input().split()))
a=b[:]

cnt=0
wa=0
condition='plus'
for i in range(n):
  wa+=a[i]
  if condition == 'plus':
    condition='minus'
    if wa<=0:
      cnt+=abs(wa)+1
      a[i]+=abs(wa)+1
      wa+=abs(wa)+1
  elif condition == 'minus':
    condition='plus'
    if wa>=0:
      cnt+=abs(wa)+1
      a[i]-=abs(wa)+1
      wa-=abs(wa)+1

cnt1=cnt
a=b[:]
cnt=0
wa=0
condition='minus'
for i in range(n):
  wa+=a[i]
  if condition == 'plus':
    condition='minus'
    if wa<=0:
      cnt+=abs(wa)+1
      a[i]+=abs(wa)+1
      wa+=abs(wa)+1
  elif condition == 'minus':
    condition='plus'
    if wa>=0:
      cnt+=abs(wa)+1
      a[i]-=abs(wa)+1
      wa-=abs(wa)+1

cnt2=cnt
print(min(cnt1,cnt2))

Submission status: Runtime Error

Solution code:
n=int(input())
b=list(map(int,input().split()))
a=b
condition=''
cnt=0
wa=0
for i in range(n):
  wa+=a[i]
  if i == 0:
    if a[i]>0:
      condition='minus'
    else:
      condition='plus'
  elif condition == 'plus':
    condition='minus'
    if wa<=0:
      cnt+=abs(wa)+1
      a[i]+=abs(wa)+1
      wa+=abs(wa)+1
  elif condition == 'minus':
    condition='plus'
    if wa>=0:
      cnt+=abs(wa)+1
      a[i]-=abs(wa)+1
      wa-=abs(wa)+1

cnt1=cnt
a=b
condition=''
cnt=0
wa=0
for i in range(n):
  a[i]=a[i]/abs(a[i])*(-1)
  cnt+=abs(a[i])+1
  wa+=a[i]
  if i == 0:
    if a[i]>0:
      condition='minus'
    else:
      condition='plus'
  elif condition == 'plus':
    condition='minus'
    if wa<=0:
      cnt+=abs(wa)+1
      a[i]+=abs(wa)+1
      wa+=abs(wa)+1
  elif condition == 'minus':
    condition='plus'
    if wa>=0:
      cnt+=abs(wa)+1
      a[i]-=abs(wa)+1
      wa-=abs(wa)+1

cnt2=cnt
print(min(cnt1,cnt2))

Submission status: Runtime Error

Solution code:
 コードテスト
 解説
提出 #6259010

ソースコード 拡げる

Copy
Copy
n=int(input())
b=list(map(int,input().split()))
a=b
condition=''
cnt=0
wa=0
for i in range(n):
  wa+=a[i]
  if i == 0:
    if a[i]>0:
      condition='minus'
    else:
      condition='plus'
  elif condition == 'plus':
    condition='minus'
    if wa<=0:
      cnt+=abs(wa)+1
      a[i]+=abs(wa)+1
      wa+=abs(wa)+1
  elif condition == 'minus':
    condition='plus'
    if wa>=0:
      cnt+=abs(wa)+1
      a[i]-=abs(wa)-1
      wa-=abs(wa)-1

print(cnt)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a[0]+b[0]+c[0].upper)

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split()

print(s1[0].upper() + s2[0].uppter() + s3[0].upper())

Submission status: Runtime Error

Solution code:
x,y,z = map(string,input().split())
print(x[:1]+y[:1]+z[:1])

Submission status: Runtime Error

Solution code:
x,y,z = map(input().split())
print(x[:1]+y[:1]+z[:1])

Submission status: Runtime Error

Solution code:
A,B,C=input().split()
print(upper(A[0],B[0],C[0]),sep='')

Submission status: Runtime Error

Solution code:
x, y = map(int, input().split())
if abs(x-y) <= 1:
    print("Alice")
else:
    print("Brown")

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map(int, input().split())
ans = str(chr(ord(s1[0])-32)) + str(chr(ord(s2[0])-32)) + str(chr(ord(s3[0])-32))
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=map(str,input().split())
print(a[0].upper+b[0].upper+c[0].upper)

Submission status: Runtime Error

Solution code:
#include <iostream>
#include <algorithm>
#include <vector>
#include <string>
#include <map>
#include <climits>
#include <math.h>
#include <utility>
using namespace std;

typedef long long ll;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<long long> vll;
typedef vector<int> vi;
typedef vector<string> vs;
typedef vector<vector<bool>> vvb;
typedef vector<vector<int>> vvi;

#define rep(i,n) for(int (i)=0;(i)<(n);(i)++)
#define all(a) a.begin(),a.end()

int main() {
	vs s(3);
	rep(i, 3)cin >> s.at(i);
	rep(i, 3) {
		cout << char(s.at(i).at(0) - 32);
	}
	cout << endl;
	return 0;
}

Submission status: Runtime Error

Solution code:
A = input()
B = input()
flag = False
if len(A) > len(B):
  print("GREATER")
elif len(A) < len(B):
  print("LESS")
elif len(A) == len(B):
  for i in range(len(A)):
    if int(A[i]) > int(B[i]):
      print("GREATER")
      break
    elif int(A[i]) < int(B[i]):
      print("LESS")
      break
  flag = True
  
if flag:
  print("EQUAL")

Submission status: Runtime Error

Solution code:
a,b,c=map(input().split())
A=a.upper()
B=b.upper()
C=c.upper()
print(A[0]+B[0]+C[0])

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map(int, input().split())
print(s1[0].upper() + s2[0].upper() + s3[0].upper())

Submission status: Runtime Error

Solution code:
a, b, c = input().split()
print(a[0].upper + b[0].upper, c[0].upper)

Submission status: Runtime Error

Solution code:
B = input().split()
A = int(B[1])
B = int(B[0])
if A==B:
  print("EQUAL")
elif A>B:
  print("GREATER")
elif A<B:
    print("LESS")

Submission status: Runtime Error

Solution code:
n = int(input())
A = list(map(int, input().split()))

def adj(n, a ,flag):
    na = 0
    cnt = 0
    for i in range(n):
        na += a[i]
        if flag == 1:
            if na <= 0:
                cnt += 1 - na
                na = 1
            flag = -1
        
        elif flag == -1:
            if na >= 0:
                cnt += na + 1
                na = -1
            flag = 1
    return cnt            

print(min(adj(n, A, 1),adj(n, A, -1)))

Submission status: Runtime Error

Solution code:
#include"bits/stdc++.h"
using namespace std;

int main(){
  string a,b,c;
  char x,y,z;
  cin >> a >> b >> c;
  x=a.front()-32;
  y=b.front()-32;
  z=c.front()-32;
  cout << x << y << z << endl;
}

Submission status: Runtime Error

Solution code:
// スタックサイズ: 100MB

#define _USE_MATH_DEFINES
#include <iostream>
#include <fstream>
#include <vector>
#include <map>
#include <unordered_map>
#include <string>
#include <cmath>
#include <cstdio>
#include <algorithm>
#include <functional>
#include <numeric>
#include <iomanip>
#include <queue>
#include <list>
#include <set>
using namespace std;

typedef int64_t ll;
typedef vector<ll> vll;
typedef pair<ll, ll> pll;
const ll INF = 1e18;
const double EPS = 1e-10;
const ll mod = 1e9 + 7;
#define fastio  ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define fori(i, a, b) for (ll i = (a); i < (b); ++i)
#define ford(i, a, b) for (ll i = (b - 1); (a) <= i; --i)
#define rep(i, n) fori(i, 0, n)
#define all(v) (v).begin(), (v).end()
#define fst first
#define snd second
ll pw(ll x, ll y) { ll r = 1;  rep(i, y) { r *= x; }; return r; }




int main() {
	fastio;

	string a, b, c;
	cin >> a >> b >> c;
	cout << char(a[0] + 'A' - 'a') << char(b[0] + 'A' - 'a') << char(c[0] + 'A' - 'a') << endl;
}

Submission status: Runtime Error

Solution code:
a,b,c = map(str,input().split())
print((a[0],b[0],c[0]).upper())

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
d = str(int(a[0])-32)
d += str(int(b[0])-32)
d += str(int(c[0])-32)
print(d)

Submission status: Runtime Error

Solution code:
a=input()
b=input()

if len(a)>len(b):
    print("GREATER")
elif len(a)<len(b):
    print("LESS")
else:
    for i in range(len(a)):
        if a[i]>b[i]:
            print("GRATER")
            exit()
        elif a[i]<b[i]:
            print("LESS")
            exit()
print("EQUAL")

Submission status: Runtime Error

Solution code:
List=list(input().upper().split())
for s in List:
  print(n[0],end="")

Submission status: Runtime Error

Solution code:
List=list(input().split())
for n in List:
  print(n[0].Upper(),end="")

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split()

ans = s1[0].upper()+s1[1].upper()+s1[2].upper()
print(ans)

Submission status: Runtime Error

Solution code:
l = input().split()
a = l[0].upper()
b = l[1].upper()
c = l[2].upper()
print(a[0]+b[0]+c[2])

Submission status: Runtime Error

Solution code:
import math

A = int(input())
B = int(input())
#A = math.log10(A)
#B = math.log10(B)

if A > B:
    print('GREATER')
elif A < B:
    print('LESS')
else:
    print('EQUAL')

Submission status: Runtime Error

Solution code:


s1, s2, s3 = input().split())

print(str.upper(s1[0]+" "+s2[0]+" "+s3[0]))

Submission status: Runtime Error

Solution code:


s1, s2, s3 = map(int, input().split())

print(str.upper(s1[0]+" "+s2[0]+" "+s3[0]))

Submission status: Runtime Error

Solution code:
s1, s2, s3 = map(int, input().split())

str.upper(s1[0]+" "+s2[1]+" "+s3[2])

Submission status: Runtime Error

Solution code:
n = int(input())
a = list(map(int, input().split()))
#具体的な操作を考える必要はなくて，ただ部分和をひたすら考えていけばいい
answer1 = 0
answer2 = 0
sum1 = a[0]
sum2 = a[0]
# pmpm...
for i in range(1,n):
    sum1 += a[i]
    if i % 2 == 1:
        if sum1 >= 0:
            answer1 += sum1 - (-1)
            sum1 = -1
    if i % 2 == 0:
        if sum1 <= 0:
            answer1 += 1 - sum1
            sum1 = 1
# mpmp...
for i in range(1,n):
    sum2 += a[i]
    if i % 2 == 0:
        if sum2 >= 0:
            answer2 += sum2 - (-1)
            sum2 = -1
    if i % 2 == 1:
        if sum2 <= 0:
            answer2 += 1 - sum2
            sum2 = 1
print(min(answer1, answer2))

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
ans=a.upper[0]+b.upper[0]+c.upper[0]
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=input().split
ans=a.upper[0]+b.upper[0]+c.upper[0]
print(ans)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a[0].apper()+b[0].upper()+c[0].upper())

Submission status: Runtime Error

Solution code:
data = input()
capitalized = data.upper()
list = capitalized.split(" ")
for word in list:
  br = str(word)
  result = br[0:1]
  final += result
print(final)

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())

print(a[0].upper()+b[0].upper()+c[0].upper())

Submission status: Runtime Error

Solution code:
A,B,C=map(str,input().split())
print(A[0].upper+B[0].upper+C[0].upper)

Submission status: Runtime Error

Solution code:
A,B,C=input().split()
print(A[0].upper+B[0].upper+C[0].upper)

Submission status: Runtime Error

Solution code:
A = input()
B = input()
AA = "%-101s", A
BB = "%-101s", B
if AA == BB:
    print("EQUAL")
elif AA>BB:
    print("GREATER")
else:
    print("LESS")

Submission status: Runtime Error

Solution code:
A = input()
B = input()
AA = "%101s", A
BB = "%101s", B
if AA == BB:
    print("EQUAL")
elif AA>BB:
    print("GREATER")
else:
    print("LESS")

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
s,t,u = map(str,input().split())
S = s[0]
T = t[0]
U = u[0]
print("{}".format(S+T+U.upper())

Submission status: Runtime Error

Solution code:
# -*- coding: utf-8 -*-
s,t,u=map(str,input().split)
A = s[0]
B = t[0]
C = u[0]
print("{}".format(A+B+C.upper()))

Submission status: Runtime Error

Solution code:
for a in input().upper().split():
print(a[0] end="")

Submission status: Runtime Error

Solution code:
a=int(input())-int(input())
print(['LESS','EQUAL','GREATER'][a>=0 + a==0])

Submission status: Runtime Error

Solution code:
print([x[0].upper() for x in input().split()].join())

Submission status: Runtime Error

Solution code:
#include "bits/stdc++.h"
using namespace std;


/* macro */
#define rep(i,a,b) for(int i=a;i<b;i++)
#define revrep(i,a,b) for(int i = a; i > b; i--)
#define int long long
#define exist(s,e) ((s).find(e)!=(s).end())
#define all(v) (v).begin(), (v).end()
#define each(s,itr) for(auto (itr) = s.begin(); (itr) != s.end(); (itr)++)
#define sum(v) accumulate(all(v), (0LL))
#define sec second
#define fir first
#define pb push_back



/* alias */
template<class T> using vec = vector<T>;
typedef vector<int> vi;
typedef pair<int, int> pi;


/* constant */
//const int inf = pow(2, 62);
//const int mod = 1e9 + 7;
const int mod = 100000;
int dx[8]={1,0,-1,0,-1,1,-1,1};
int dy[8]={0,1,0,-1,-1,-1,1,1};



/* io_method */
int input(){int tmp;cin >> tmp;return tmp;}
string raw_input(){string tmp;cin >> tmp;return tmp;}
string readline(){string s;getline(cin, s);return s;}
template<class T> void printx(T n){cout << n;}
template<class T, class U> void printx(pair<T, U> p){cout << "(" << p.first << "," << p.second << ")";}
template<class T> void printx(vector<T> v){cout << "{";rep(i,0,v.size()){printx(v[i]);if(i != v.size()-1)printx(",");}cout << "}";}
template<class T> void print(T n){printx(n);cout << endl;}
template<class T> void print(set<T> s){cout << "{";each(s, e){if(e != s.begin()) printx(",");printx(*e);}cout << "}" << endl;}
template<class T, class U> void print(map<T, U> mp){cout << "{";each(mp, e){cout << "(" << e -> first << "," << e -> second << ")";}cout << "}" << endl;}


/* general_method */
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }




/* main */
int ceil(int a, int b){
    if(a % b == 0) return a /b;
    else return a /b + 1;
}


signed main(){

    cin.tie(0);
    ios::sync_with_stdio(false);

    
    string ans = "";

    rep(i,0,3) ans += toupper(raw_input()[0]);

    print(ans);




    
    



    
    

    







   




    

    

    




    



    



    

 
    
    


    

    
   
    













}

Submission status: Runtime Error

Solution code:
l = int(input())
n = [int(i) for i in input().split()] 
count = 0
nsum = n[0]
for i in range(1, l):
  while(True):
    if (n[i-1] * n[i] >= 0) or (nsum * (nsum + n[i]) >= 0):
      if n[i-1] < 0:
        count += 1
        n[i] += 1
      else:
        count += 1
        n[i] -= 1     
    else:
      nsum += n[i]
      break
      
print(count)

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
print(a[0].upper()+b[0].upeer() +c[0].upper())

Submission status: Runtime Error

Solution code:
s = list(map(int,input().split()))
print(s[0][0].upper()+s[1][0].upper()+s[2][0].upper())

Submission status: Runtime Error

Solution code:
s = list(map(int,input().split())
print(s[0][0].upper()+s[1][0].upper()+s[2][0].upper())

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
if a<b:
    print("LESS")
elif a==b:
    print("EQUAL")
else:
    print("GREATER")

Submission status: Runtime Error

Solution code:
a,b,c=map(int,input().split())
print(a[0].upper()+b[0].upper()+c[0].upper())

Submission status: Runtime Error

Solution code:
 print(''.join(i[0] for i in input().split()).upper())

Submission status: Runtime Error

Solution code:
a,b,c=input().upper().split();print(''.join(a[0],b[0],c[0]))

Submission status: Runtime Error

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

int main(){
	string a,b,c;
	cin>>a>>b>>c;
	cout<<(char)toupper(a[0])<<(char)toupper(b[0])<<(char)toupper(c[0])<<endl;
}

Submission status: Runtime Error

Solution code:
a = list(map(str,input().split()))
c = str()
for i in range(3):
  c += a[i]a[0].upper()
print(c)

Submission status: Runtime Error

Solution code:
a, b, c = input().split()
print(chr(ord(a) + 26) + chr(ord(b) + 26) + chr(ord(c) + 26))

Submission status: Runtime Error

Solution code:
print(a[0],end=""for a in input().upper().split())

Submission status: Runtime Error

Solution code:
a=input()
b=input()
a=int(a)
b=int(b)
if a>b:
    print("GREATER")
elif a=b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Runtime Error

Solution code:
a=input()
b=input()
if a>b:
    print("GREATER")
elif a=b:
    print("EQUAL")
else:
    print("LESS")

Submission status: Runtime Error

Solution code:
A, B, C = (str(i).upper for i in input().split())

ans = A[0]+B[0]+C[0]
# ANS = ans.upper()
print(ans)

Submission status: Runtime Error

Solution code:
A, B, C = (i.upper for i in input().split())

ans = A[0]+B[0]+C[0]
# ANS = ans.upper()
print(ans)

Submission status: Runtime Error

Solution code:
atcoder beginner contest

Submission status: Runtime Error

Solution code:
a,b,c = map(input().split())
print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Runtime Error

Solution code:
a = map(input().split())
print(a[0].upper() + b[0].upper() + c[0].upper())

Submission status: Runtime Error

Solution code:
s1,s2,s3 = list(map(str,input().split()))
res = ""

res.append(s1[0].upper())
res.append(s2[0].upper())
res.append(s3[0].upper())

print(res)

Submission status: Runtime Error

Solution code:
s1,s2,s3 = list(map(int,input().split()))
res = ""

res.append(s1[0].upper())
res.append(s2[0].upper())
res.append(s3[0].upper())

print(res)

Submission status: Runtime Error

Solution code:
import numpy as np

x,y = map(int, input().split())
z = np.array([x,y])
i = 1

if z[z.argmax()] == 0 or z[z.argmax()] == 1:
    i = 1
else:
    while True:
        amax, amin = z.argmax(), z.argmin()
        z[amin] += z[amax]//2
        z[amax] = 1 if z[amax]%2 else 0
        i+=1
        if (z[z.argmax()] == 0 or z[z.argmax()] == 1): 
            break

print("Brown" if i%2 else "Alice")

Submission status: Runtime Error

Solution code:
import math

n = int(input())
a = list(map(int, input().split()))

cnt = 0
x = []
x.append(a[0])

if a[0] == 0:
    cnt += 1
    if a[1] > 0:
        x[0] = -1
    else:
        x[0] = 1


for i in range(n-1):
    
    if x[i] > 0:
        if x[i]+a[i+1] > -1:
            tmp = int(math.fabs(x[i] + a[i+1]) + 1)
            a[i+1] = a[i+1] - tmp
            cnt += tmp
        x += [x[i] + a[i+1]]
        
    else:
        if x[i]+a[i+1] < +1:
            tmp = int(math.fabs(x[i] + a[i+1]) + 1)
            a[i+1] = a[i+1] + tmp
            cnt += tmp
        x += [x[i] + a[i+1]]

print(cnt)

Submission status: Runtime Error

Solution code:
import math

n = int(input())
a = list(map(int, input().split()))

cnt = 0
x = []
x.append(a[0])

for i in range(n-1):
    if x[i] > 0:
        if x[i]+a[i+1] > -1:
            cnt += math.fabs(x[i] + a[i+1]) + 1
            x += [-1]
        else:
            x += [x[i] + a[i+1]]
        
    else:
        if x[i]+a[i+1] < +1:
            cnt += math.fabs(x[i] + a[i+1]) + 1
            x += [1]
        else:
            x += [x[i] + a[i+1]]

print(int(cnt))

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
int main(){
  string a,b,c;
  cin>>a>>b>>c;
cout<<(char)(a[0]-'a'+'A');
cout<<(char)(b[0]-'a'+'A');
cout<<(char)(c[0]-'a'+'A');
}

Submission status: Runtime Error

Solution code:
#include<bits/stdc++.h>
using namespace std;
int main(){
  string a,b,c;
  cin>>a>>b>>c;
cout<<(char)(a[0]-'a'+'A');
cout<<(char)(b[0]-'a'+'A')';
cout<<(char)(c[0]-'a'+'A');
}

Submission status: Runtime Error

Solution code:
s = input().split()
s = s.upper()

s1 = s[0][0]
s2 = s[1][0]
s3 = c[2][0]

print(s1+s2+s3)

Submission status: Runtime Error

Solution code:
a = int(input())
b = int(input())
if a>b: print("GREATER")
elif a<b: print("LESS")
else: print("EQUAL")

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a[0].upper()+b[0].upper()+c[0].upper)

Submission status: Runtime Error

Solution code:
a,b,c=input().split()
print(a.upper[0]+b.upper[0]+c.upper[0])

Submission status: Runtime Error

Solution code:
nums = input().split()
print(nums[0][0].upper()+nums[1][0].upper()+nums[2][0].upper

Submission status: Runtime Error

Solution code:
a = input()
b = input()
if(a > b):
    print("GREATER")
elif(a < b):
    print("LESS")
elif(a == b):
    print("EQUAL")

Submission status: Runtime Error

Solution code:
from collections import defaultdict


def solve(pre_is_positive, a_list):
    total = 0
    ans = 0
    for a in a_list:
        total += a
        if pre_is_positive and total >= 0:
            ans += abs(total) + 1
            total = -1
        elif not pre_is_positive and total <= 0:
            ans += abs(total) + 1
            total = 1
        pre_is_positive = total > 0
    return ans


def main():
    n = int(input())
    a_list = list(map(int, input().split()))
    print(min(solve(True, a_list), solve(False, a_list)))


if __name__ == "__main__":
    main()

Submission status: Runtime Error

Solution code:
a, b, c = map(int, input().split())
ans = (a[0]+b[0]+c[0]).upper()
print(ans)

Submission status: Runtime Error

Solution code:
    s1, s2, s3 = input().split(" ")
     
    print(s1[0].upper()+s2[0].upper()+s3[0].upper())

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split(" ")

print(s1[0].upper()+s2[0].upper()s3[0].upper())

Submission status: Runtime Error

Solution code:
s1, s2, s3 = input().split(" ")

print(s1[0].upper+s1[1:]+s2[0].upper+s2[1:]+s3[0].upper+s3[1:])

Submission status: Runtime Error

Solution code:
a,b,c = input().split()
print(upper(a[0])+upper(b[0])+upper(c[0]))

Submission status: Runtime Error

Solution code:
l=raw_input().split()
print l[0][0].upper()+l[1][0].upper()+l[2][0].upper()