Problem:


Score : 100 points

Problem Statement

Given are two strings S and T consisting of lowercase English letters. Concatenate T and S in this order, without space in between, and print the resulting string.

Constraints

S and T are strings consisting of lowercase English letters.

The lengths of S and T are between 1 and 100 (inclusive).

Input

Input is given from Standard Input in the following format:

S T

Output

Print the resulting string.

Sample Input 1

oder atc

Sample Output 1

atcoder

When S =  oder and T =  atc, concatenating T and S in this order results in atcoder.

Sample Input 2

humu humu

Sample Output 2

humuhumu



Sample input:
oder atc


Sample output:
atcoder

Submission status: Wrong Answer

Solution code:
# coding: utf-8
import numpy as np
from functools import lru_cache
import time

def main(): 
    if True:
        N,X = list(map(str, input().split()))
    else:
        pass
    print(N+X)



if __name__ =='__main__':
    main()

Submission status: Wrong Answer

Solution code:
s = input().split()
print(s[1], s[0])

Submission status: Wrong Answer

Solution code:
num = input()

print(num[2] + num[0])

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print(t, s)

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print("{}{}".format(s, t))

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print(t+" "+s)

Submission status: Wrong Answer

Solution code:
S,T=map(str,input().split())
print(T,S)

Submission status: Wrong Answer

Solution code:
S_T = str(input())
S = S_T.split(" ")[0]
T = S_T.split(" ")[1]
print(T, S)

Submission status: Wrong Answer

Solution code:
b,c=[x for x in input().split()]
print(b+c)

Submission status: Wrong Answer

Solution code:
s = str(input())

s = s.replace(" ", "")

print(s)

Submission status: Wrong Answer

Solution code:
a,b=input().split()
print(a+b)

Submission status: Wrong Answer

Solution code:
def solve(s, t):
    return s + t

s, t = input().split()
print(solve(s, t))

Submission status: Wrong Answer

Solution code:
# 文字列の入力
a,b=map(str,input().split())

# 結果の出力
print(a+b)

Submission status: Wrong Answer

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

print(s+t)

Submission status: Wrong Answer

Solution code:
S,T = map(str,input().split())
print(S + T)

Submission status: Wrong Answer

Solution code:
word1, word2 = input().split()

print(word1 + word2)

Submission status: Wrong Answer

Solution code:
s,t = [i for i in input().split()]

print(s+t)

Submission status: Wrong Answer

Solution code:
str = input("Enter you string :")
S, T = str.split(' ', 1)
print(T + S)

Submission status: Wrong Answer

Solution code:
get_input = input().split(" ")
get_input.sort()
print(get_input[0] + get_input[1])

Submission status: Wrong Answer

Solution code:
s=input().split()
ans= ""
for i in range(len(s)):
    ans += s[i]
print(ans)

Submission status: Wrong Answer

Solution code:
s, t = map(str, input().split())
print("{}{}".format(s, t))

Submission status: Wrong Answer

Solution code:
s, t = map(str, input().split())
print("{} {}".format(s, t))

Submission status: Wrong Answer

Solution code:
S, T = input().split()
for (x,y) in zip(S,T):
    if (x.islower() or x.isupper()) and (y.islower() or y.isupper()):
        if x.lower()>=y.lower():
            print(S+T)
        else:
            print(T+S)
        break

Submission status: Wrong Answer

Solution code:
a,b=str(input().lower()).split()
s=a+b
print(s[0:100])

Submission status: Wrong Answer

Solution code:
a,b=str(input().lower()).split()
s=a+b
print(s[:101])

Submission status: Wrong Answer

Solution code:
a,b=str(input()).split()
print((a+b).lower())

Submission status: Wrong Answer

Solution code:
#!/usr/bin/env python3
from collections import defaultdict,deque
from heapq import heappush, heappop
from bisect import bisect_left, bisect_right
import sys, random, itertools, math
sys.setrecursionlimit(10**5)
input = sys.stdin.readline
sqrt = math.sqrt
def LI(): return list(map(int, input().split()))
def LF(): return list(map(float, input().split()))
def LI_(): return list(map(lambda x: int(x)-1, input().split()))
def II(): return int(input())
def IF(): return float(input())
def LS(): return list(map(list, input().split()))
def S(): return list(input().rstrip())
def IR(n): return [II() for _ in range(n)]
def LIR(n): return [LI() for _ in range(n)]
def FR(n): return [IF() for _ in range(n)]
def LFR(n): return [LI() for _ in range(n)]
def LIR_(n): return [LI_() for _ in range(n)]
def SR(n): return [S() for _ in range(n)]
def LSR(n): return [LS() for _ in range(n)]
mod = 1000000007
inf = float('INF')

#solve
def solve():
    s, t = LS()
    print("".join(s+t))
    return


#main
if __name__ == '__main__':
    solve()

Submission status: Wrong Answer

Solution code:
S,T = input().split()

U = S+T
print(U)

Submission status: Wrong Answer

Solution code:
S, T = input("Enter a two value: ").split()
S = S.lower()
T = T.lower()
ST = T + S
print(ST)

Submission status: Wrong Answer

Solution code:
a,b=str(input()).split()
print(a+b)

Submission status: Wrong Answer

Solution code:
s,t = input().split()
s = s.lower()
t = t.lower()
new_string = ''.join(sorted(s + t))
print(new_string)

Submission status: Wrong Answer

Solution code:
get_input = input().split(" ")
cha1 = get_input[0]
cha2 = get_input[1]
order = [cha1[0], cha2[0]]
order.sort()

if order[0] == cha1[0]:
    print(cha1+cha2)
else:
    print(cha2+cha1)

Submission status: Wrong Answer

Solution code:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

def main():
    S,T=input().split()
    print(S+T)

if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
str=input().strip()
print('str')

Submission status: Wrong Answer

Solution code:
word = input()
print(word.replace(' ',''))

Submission status: Wrong Answer

Solution code:
s = input()
print(s.replace(" ", ""))

Submission status: Wrong Answer

Solution code:
S, T = input("Enter a two value: ").split()
print(T+S)

Submission status: Wrong Answer

Solution code:
a, b = input().split(" ")
a += b
print(a)

Submission status: Wrong Answer

Solution code:
str = input().strip()
S='oder'
T='atc'
print('T'+'S')

Submission status: Wrong Answer

Solution code:
str1 = 'T'
str2 = 'S'
str1+= str2 
print(str1)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

S, T=map(str, input().split())

print(S+T)

Submission status: Wrong Answer

Solution code:
def main():
    s = input()
    s = s.replace(" ", "")
    print(s)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

import sys
import math


debug = False

def log(text):
    if debug:
        print(text)

def parse_input(lines_as_string = None):

    global debug
    lines = []
    if lines_as_string is None:
        debug = False
        # for line in sys.stdin:
        #     lines.append(line)
        lines.append(input())
    else:
        debug = True
        lines = [e for e in lines_as_string.split("\n")][1:-1]

    (s, t) = [e for e in lines[0].split(" ")]

    return (s, t)


def solve(s, t):


    return s + t


def main():
    # 出力
    result = solve(*parse_input())
    if isinstance(result, list):
        for r in result:
            print("%s" % r, sep='')
    else:
        print("%s" % result, sep='')

if __name__ == '__main__':

    main()

Submission status: Wrong Answer

Solution code:
S,T=input().split()
res=S+T
print(res)

Submission status: Wrong Answer

Solution code:
def main():
    s, t = input().split()
    ans = ''.join([s, t])
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
str1 = 'T'
str2 = 'S'
str3 = str1+str2
print(str3)

Submission status: Wrong Answer

Solution code:
s = 'T' + 'S'

print(s)

Submission status: Wrong Answer

Solution code:
s = input()
a = str(s[1]) + (s[0])
print(a)

Submission status: Wrong Answer

Solution code:
S = 'aaa'
T = 'bbb'
 
A = T + S
 
print(A)

Submission status: Wrong Answer

Solution code:
def main():
    s, t = input().split()
    ans = s + t
    print(ans)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

Solution code:
S = 'aaa'
T = 'bbb'

A = S + T

print(A)

Submission status: Wrong Answer

Solution code:
s = input().split()
print("".join(s))

Submission status: Wrong Answer

Solution code:
s = 'S' + 'T'

print(s)

Submission status: Wrong Answer

Solution code:
n = str(input())
n_list = n.split(" ")
n_list0 = n_list[0]
n_list1 = n_list[1]
mojiretsu = n_list0 + n_list1
print(mojiretsu)

Submission status: Wrong Answer

Solution code:
def addString(str1,str2):
    return str2 + str1

Submission status: Wrong Answer

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

print(s + t)

Submission status: Wrong Answer

Solution code:
the_string = input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100 and len(S)>=1 and len(T)>=1):
    S = S.lower()
    T = T.lower()
    if (ord(S[0]) < ord(T[0])):
        print(S+T)
    elif (ord(S[0]) > ord(T[0])):
        print(T+S)
    elif (ord(S[0]) == ord(T[0])):
        print(T+S)
else: 
    system.exit()

Submission status: Wrong Answer

Solution code:
S='oder'
T='atc'
print('S+T')

Submission status: Wrong Answer

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

print(b,a)

Submission status: Wrong Answer

Solution code:
ST = input("").split()
S, T = ST[0], ST[1]
print("{}".format(S + T))

Submission status: Wrong Answer

Solution code:
the_string = input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100 and len(S)>=1 and len(T)>=1):
    S = S.lower()
    T = T.lower()
    if (ord(S[0]) < ord(T[0])):
        print(S+T)
    elif (ord(S[0]) > ord(T[0])):
        print(T+S)
    elif (ord(S[0]) == ord(T[0])):
        print(T+S)

Submission status: Wrong Answer

Solution code:
S, T = input().split()
if S[0].lower() <= T[0].lower():
    print(S + T)
else:
    print(T + S)

Submission status: Wrong Answer

Solution code:
s, t = input().rstrip().split()
print(s + t)

Submission status: Wrong Answer

Solution code:
the_string = input()
S, T = the_string.split()
if (len(S)<=100 and len(T)<=100):
    S = S.lower()
    T = T.lower()
    if (ord(S[0]) < ord(T[0])):
        print(S+T)
    elif (ord(S[0]) > ord(T[0])):
        print(T+S)
    elif (ord(S[0]) == ord(T[0])):
        print(T+S)

Submission status: Wrong Answer

Solution code:
st=input()
print(st.replace(' ',''))

Submission status: Wrong Answer

Solution code:
S = 'oder'
T = 'atc'
print (T+S)

Submission status: Wrong Answer

Solution code:
print(input().replace(" ", ""))

Submission status: Wrong Answer

Solution code:
S, T = input().split()

print(S, T, sep="")

Submission status: Wrong Answer

Solution code:
S, T = input().split()
if S[0] <= T[0]: 
  print(S+T)
else: print(T+S)

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
S = 'oder'
T = 'atc'
print(T+S)

Submission status: Wrong Answer

Solution code:
s,t = input().split(" ")
print(t,s)

Submission status: Wrong Answer

Solution code:
S = 'oder'
T = 'atc'

print(T+S)

Submission status: Wrong Answer

Solution code:
st=input().split()
print(st[0]+st[1])

Submission status: Wrong Answer

Solution code:
s=input()
print(s.replace(" ",""))

Submission status: Wrong Answer

Solution code:

if __name__ == "__main__":
    A, B = input().split()
    print(A + B)

Submission status: Wrong Answer

Solution code:
s , t = input().split()
ans = s+t
print (ans)

Submission status: Wrong Answer

Solution code:
def main(S: str, T:str):
    if S[0] <= T[0]: print(S+T)
    else: print(T+S)

Submission status: Wrong Answer

Solution code:
S = input().split()
 
print(S)

Submission status: Wrong Answer

Solution code:
str = input().split()

print(str[0]+str[1], sep="")

Submission status: Wrong Answer

Solution code:
a, b = input().split()
if len(a)>len(b):
    print(b+a)
else:
     print(a+b)

Submission status: Wrong Answer

Solution code:
S=input().split()
print("".join(S))

Submission status: Wrong Answer

Solution code:
S,T = input().split()
 
print(S+T)

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print(''.join([s, t]))

Submission status: Wrong Answer

Solution code:
st = input()
st = st.replace(' ', '')
print(st)

Submission status: Wrong Answer

Solution code:
S,T = (str(x) for x in input().split())
print(S+T)

Submission status: Wrong Answer

Solution code:
S, T = map(str, input().split())
print(S+T,end="")

Submission status: Wrong Answer

Solution code:
def main(S: str, T:str):
    if S[0] <= T[0]: print(S+T)
    else: print(T+S)

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print(t,s)

Submission status: Wrong Answer

Solution code:
a = input()
t = ''
for c in a:
    if c != ' ':
        t+=c
print(t)

Submission status: Wrong Answer

Solution code:
S, T = map(str, input().split())

print(S,end="")
print(T)

Submission status: Wrong Answer

Solution code:
inpt = input()
print(inpt.replace(" ", ""))

Submission status: Wrong Answer

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

Submission status: Wrong Answer

Solution code:
s,t = input().split(" ")
print(t+" "+s)

Submission status: Wrong Answer

Solution code:
x,y = map(str,input().split())
x += y
print(x)

Submission status: Wrong Answer

Solution code:
S, T=input().split()
print(S+T)

Submission status: Wrong Answer

Solution code:
a , b =map(str,input().split())
ans = a + b
print(ans)

Submission status: Wrong Answer

Solution code:
S,T = input().split()
print(S+T)

Submission status: Wrong Answer

Solution code:
S, T = map(str, input().split())


def solve():
    return S + T


print(solve())

Submission status: Wrong Answer

Solution code:
print("".join(input().split(" ")))

Submission status: Wrong Answer

Solution code:
a,b = input().split()
print (a + b)

Submission status: Wrong Answer

Solution code:
n,k=map(str,input().split())
print(n,end="")
print(k)

Submission status: Wrong Answer

Solution code:
s,t = input().split( )
print(s+t)

Submission status: Wrong Answer

Solution code:
C  = input()
A , B = C.split()
print(A+B)

Submission status: Wrong Answer

Solution code:
import os
nyu = input().split()
S=nyu[0].strip()
T=nyu[1].strip()
print(S+T)

Submission status: Wrong Answer

Solution code:
a, b = input("Enter a two value: ").split()
print(b+a)

Submission status: Wrong Answer

Solution code:
#A
s, t = list(map(str,input().split()))
print(''.join(s+t))

Submission status: Wrong Answer

Solution code:
a,b=(input().split())
print(a+b)

Submission status: Wrong Answer

Solution code:
s, t = input().split(" ")
print(s+t)

Submission status: Wrong Answer

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

print(s+t)

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-
 
n, k = map(str, input().split())
print(n+k)

Submission status: Wrong Answer

Solution code:
#!/usr/bin/python3
# -*- coding: utf-8 -*-
a, b = input().split()
print(a+b)

Submission status: Wrong Answer

Solution code:
S,T=list(map(str,input().split()))
print(T,S)

Submission status: Wrong Answer

Solution code:
a,b=map(str,input().split())
print(a,end="")
print(b)

Submission status: Wrong Answer

Solution code:
if __name__ == "__main__":
	S, T = input().split()
	print(S + T)

Submission status: Wrong Answer

Solution code:
st=input().split(' ')
print(st[0]+st[1])

Submission status: Wrong Answer

Solution code:
S,T = input().split()
str=S+T

print(str)

Submission status: Wrong Answer

Solution code:
S, T = input().split(" ")
print(S+T)

Submission status: Wrong Answer

Solution code:
k=input().split()
p=k[0]+k[1]
print(p)

Submission status: Wrong Answer

Solution code:
S, T= input().split()
print(S+T)

Submission status: Wrong Answer

Solution code:
a,b = input().split()
ans = a+b
print(ans)

Submission status: Wrong Answer

Solution code:
S,T=input().split()
print(S + T)

Submission status: Wrong Answer

Solution code:
s, t = input().split()
print('{}{}'.format(s,t))

Submission status: Wrong Answer

Solution code:
# -*- coding: utf-8 -*-

import sys

def input(): return sys.stdin.readline().strip()
def list2d(a, b, c): return [[c] * b for i in range(a)]
def list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]
def list4d(a, b, c, d, e): return [[[[e] * d for j in range(c)] for j in range(b)] for i in range(a)]
def ceil(x, y=1): return int(-(-x // y))
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(N=None): return list(MAP()) if N is None else [INT() for i in range(N)]
def Yes(): print('Yes')
def No(): print('No')
def YES(): print('YES')
def NO(): print('NO')
sys.setrecursionlimit(10 ** 9)
INF = 10 ** 18
MOD = 10 ** 9 + 7

S, T = input().split()

print(S + T)

Submission status: Wrong Answer

Solution code:
# coding: utf-8

import sys
import math
import collections
import itertools
from inspect import currentframe
INF = 10 ** 10
MOD = 10 ** 9 + 7
def input() : return sys.stdin.readline().strip()
def gcd(x, y) : return y if x % y == 0 else gcd(y, x % y)
def lcm(x, y) : return (x * y) // gcd(x, y)
def I() : return int(input())
def MI() : return map(int, input().split())
def LI() : return [int(x) for x in input().split()]
def RI(N) : return [int(input()) for _ in range(N)]
def LRI(N) : return [[int(x) for x in input().split()] for _ in range(N)]
def chkprint(*args) : names = {id(v):k for k,v in currentframe().f_back.f_locals.items()}; print(', '.join(names.get(id(arg),'???')+' = '+repr(arg) for arg in args))

S, T = input().split()

print(S + T)

Submission status: Wrong Answer

Solution code:
A, B = input().split()

print(A+B)

Submission status: Wrong Answer

Solution code:
a, b = input().split()
print(b,a)

Submission status: Wrong Answer

Solution code:
print(*input().split()[::-1])

Submission status: Wrong Answer

Solution code:
import sys
import itertools
input = sys.stdin.readline


def read_values():
    return map(int, input().split())


def read_list():
    return list(read_values())


def read_lists(N):
    return [read_list() for n in range(N)]


def dfs(N, L, s):
    depth = [-1] * N

    stack = [(0, s)]
    while stack:
        d, p = stack.pop()
        depth[p] = d

        for q in L[p]:
            if depth[q] != -1:
                continue
            stack.append((d + 1, q))
    return depth

    
def main():
    S, T = input().split()

    print(S + T)


if __name__ == "__main__":
    main()

Submission status: Wrong Answer

Solution code:
def main():
    a, b = input().split()
    print(a + b)


if __name__ == '__main__':
    main()

Submission status: Wrong Answer

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

print(s+t)

Submission status: Wrong Answer

Solution code:
a, b =input().split()
print(b, a, sep=' ')

Submission status: Accepted

Solution code:
S, T = input().split()
print(T + S)

Submission status: Accepted

Solution code:
s,t = input().split()
print(t+s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3

def main():
    s, t = input().split()
    print(t + s)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
s, t = input().split()
u = t + s
print(u)

Submission status: Accepted

Solution code:
s,t=input().split()
print (t+s)

Submission status: Accepted

Solution code:
s,t = input().split()
print(t,s,sep='')

Submission status: Accepted

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

Submission status: Accepted

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

r=t+s

print(r)

Submission status: Accepted

Solution code:
#149-A

S,T = map(str,input().split())

print(T+S)

Submission status: Accepted

Solution code:
s, t = list(input().split())

print(t + s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=input().split()
print(t+s)

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
s, t = input().split()
print(t + s)

Submission status: Accepted

Solution code:
s, t = input().split()
print(t, s, sep='')

Submission status: Accepted

Solution code:
S, T = map(str, input().split())

print(T+S)

Submission status: Accepted

Solution code:
S, T = input().split()
print(T+S)

Submission status: Accepted

Solution code:
S,T=map(str,input().split())
print(T+S)

Submission status: Accepted

Solution code:
s,t = input().split()
print(t + s)

Submission status: Accepted

Solution code:
s, t = input().split()
print("".join([t, s]))

Submission status: Accepted

Solution code:
S,T=input().split()
print(T+S)

Submission status: Accepted

Solution code:
a, b = input().split()
print(b + a)

Submission status: Accepted

Solution code:
s,t = input().split()
print(t+s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
from itertools import chain


def solve(S: str, T: str):
    answer = T + S
    return answer


def main():
    tokens = chain(*(line.split() for line in sys.stdin))
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    answer = solve(S, T)
    print(answer)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
S,T = input().split()

print(T + S)

Submission status: Accepted

Solution code:
s, t = input().split()
print(t+s)

Submission status: Accepted

Solution code:
str_l = list(map(str, input().split()))
print(''.join(list(reversed(str_l))))

Submission status: Accepted

Solution code:
a, b = map(str, input().split())
print('{}{}'.format(b, a))

Submission status: Accepted

Solution code:
S,T = map(str,input().split())
print(T+S)

Submission status: Accepted

Solution code:
s, t = map(list, input().split())
t.extend(s)
print(''.join(t))

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
s,t=input().split()
print(t+s)

Submission status: Accepted

Solution code:
S,T = input().split()
print(T+S)

Submission status: Accepted

Solution code:
S, T = input().split()
ans = T + S
print(ans)

Submission status: Accepted

Solution code:
s, t = input().split()
print(t+s)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
from collections import defaultdict, Counter
from itertools import product, groupby, count, permutations, combinations
from math import pi, sqrt
from collections import deque
from bisect import bisect, bisect_left, bisect_right
from string import ascii_lowercase
from functools import lru_cache
import sys
sys.setrecursionlimit(10000)
INF = float("inf")
YES, Yes, yes, NO, No, no = "YES", "Yes", "yes", "NO", "No", "no"
dy4, dx4 = [0, 1, 0, -1], [1, 0, -1, 0]
dy8, dx8 = [0, -1, 0, 1, 1, -1, -1, 1], [1, 0, -1, 0, 1, 1, -1, -1]


def inside(y, x, H, W):
    return 0 <= y < H and 0 <= x < W


def ceil(a, b):
    return (a + b - 1) // b


def sum_of_arithmetic_progression(s, d, n):
    return n * (2 * s + (n - 1) * d) // 2


def gcd(a, b):
    if b == 0:
        return a
    return gcd(b, a % b)


def lcm(a, b):
    g = gcd(a, b)
    return a / g * b


def solve():
    S, T = input().split()
    print(T + S)


def main():
    solve()


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
import sys
 
S, T = next(sys.stdin).strip().split()
print(T + S)

Submission status: Accepted

Solution code:
S, T = input().split()
ans = T + S
print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,T=input().split()
print(T+S)

Submission status: Accepted

Solution code:
S, T = input().split()

print(T + S)

Submission status: Accepted

Solution code:

s,t=map(str,input().split())
print(t+s,sep='')

Submission status: Accepted

Solution code:
s,t = input().split()
print(t + s)

Submission status: Accepted

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

u = t + s

print(u)

Submission status: Accepted

Solution code:
import sys

readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)


def main():
    S, T = input().split()
    print(T + S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
S, T = input().split()
print(T+S)

Submission status: Accepted

Solution code:
S, T = map(str, input().split())
print(T + S)

Submission status: Accepted

Solution code:
s, t = input().split()
print(t + s)

Submission status: Accepted

Solution code:
b,a = input().split()
print(a + b)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from collections import deque, defaultdict
#deque(l), pop(), append(x), popleft(), appendleft(x)
#q.rotate(n)で → にn回ローテート
from collections import Counter#文字列を個数カウント辞書に、
#S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items()
from itertools import accumulate,combinations,permutations,product#累積和
#list(accumulate(l))
from heapq import heapify,heappop,heappush
#heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone
from functools import reduce,lru_cache#pypyでもうごく
#@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率
from decimal import Decimal
from argparse import ArgumentParser

args=ArgumentParser()
args.add_argument('-loc', '--local', type=bool,default=False)
LOCAL=args.parse_args().local

def input(): 
    x=sys.stdin.readline(); 
    if x[-1]=="\n": 
        return x.rstrip() 
    return x
    
def printe(*x):_=print("## ",*x,file=sys.stderr) if LOCAL else 0
def printl(li): _=print(*li, sep="\n") if li else None
def argsort(s, return_sorted=False): 
    inds=sorted(range(len(s)), key=lambda k: s[k])
    if return_sorted: return inds, [s[i] for i in inds]
    return inds
def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65
def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65)
def matmat(A,B):
    K,N,M=len(B),len(A),len(B[0])
    return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)]
def matvec(M,v):
    N,size=len(v),len(M)
    return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)]
def T(M):
    n,m=len(M),len(M[0])
    return [[M[j][i] for j in range(n)] for i in range(m)]
def binr(x): return bin(x)[2:]
def bitcount(x): #xは64bit整数
    x= x - ((x >> 1) & 0x5555555555555555)
    x= (x & 0x3333333333333333) + ((x >> 2) & 0x3333333333333333)
    x= (x + (x >> 4)) & 0x0f0f0f0f0f0f0f0f 
    x+= (x >> 8); x+= (x >> 16); x+= (x >> 32) 
    return x & 0x7f

def main():
    mod = 1000000007
    #w.sort(key=itemgetter(1),reverse=True)  #二個目の要素で降順並び替え

    #N = int(input())
    a,b = input().split()
    #A = tuple(map(int, input().split())) #1行ベクトル
    #L = tuple(int(input()) for i in range(N)) #改行ベクトル
    #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列
    l=[a,b]

    print(l[1]+l[0])



if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
a,b=input().split()
for i in b,a:
  print(i,end="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, t = map(str, input().split())
n = t + s
print(n)

Submission status: Accepted

Solution code:
def solve():
    S,T = input().split()
    print(T+S)

if __name__ == "__main__":
    solve()

Submission status: Accepted

Solution code:
s, t = map(str, input().split())
n = t + s
print(n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=map(str,input().split())
a=t+s
print(a)

Submission status: Accepted

Solution code:
A,B = map(str,input().split())
print(B+A)

Submission status: Accepted

Solution code:
S, T = input().split()

print(T+S)

Submission status: Accepted

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

print(b+a, sep = "", end="")

Submission status: Accepted

Solution code:
def main():
    S, T = input().split()

    ans = T + S

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip() 
sys.setrecursionlimit(10**7)
INF = 10**20
def I(): return int(input())
def F(): return float(input())
def S(): return input()
def LI(): return [int(x) for x in input().split()]
def LI_(): return [int(x)-1 for x in input().split()]
def LF(): return [float(x) for x in input().split()]
def LS(): return input().split()

def resolve():
    S, T = LS()

    print(T + S)

if __name__ == '__main__':
    resolve()

Submission status: Accepted

Solution code:
s, t = map(str,input().split())
print(t, s, sep = '')

Submission status: Accepted

Solution code:
S,T = input().split()
print(T+S)

Submission status: Accepted

Solution code:
a,b=input().split()
print(b+a)

Submission status: Accepted

Solution code:
S,T = input ().split ()
print (T+S)

Submission status: Accepted

Solution code:
a=input().split()
print(a[1]+a[0])

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
# 入力
S,T = input().split()

# 出力
print(T + S)

Submission status: Accepted

Solution code:
s=list(map(str, input().split()))
s.reverse()
print("".join(s))

Submission status: Accepted

Solution code:
word = list(map(str,input().split()))
print(word[1],end=(''))
print(word[0])

Submission status: Accepted

Solution code:
s, t = input().split()
print( t + s)

Submission status: Accepted

Solution code:
S,T=input().split()
print(T+S)

Submission status: Accepted

Solution code:
s,t = input().split()
print(t,end="")
print(s)

Submission status: Accepted

Solution code:
S, T = input().split()
print(T + S)

Submission status: Accepted

Solution code:
l = input().rstrip().split()
print(l[1] + l[0])

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# Generated by https://github.com/kyuridenamida/atcoder-tools
from typing import *
import collections
import functools
import itertools
import math
import sys

INF = float('inf')


def solve(S: str, T: str):
    return T+S


def main():

    sys.setrecursionlimit(10 ** 6)

    def iterate_tokens():
        for line in sys.stdin:
            for word in line.split():
                yield word
    tokens = iterate_tokens()
    S = next(tokens)  # type: str
    T = next(tokens)  # type: str
    print(f'{solve(S, T)}')


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
s1,s2=map(str,input().split(' '))
print(s2+s1)

Submission status: Accepted

Solution code:
a = input().split()
print(f"{a[1]}{a[0]}")

Submission status: Accepted

Solution code:
S,T = map(str, input().split())
print(T+S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,T = open(0).read().split()
print(T+S)

Submission status: Accepted

Solution code:
from sys import stdin
import sys
import math
from functools import reduce
import functools
import itertools
from collections import deque,Counter,defaultdict
from operator import mul
import copy
# ! /usr/bin/env python
# -*- coding: utf-8 -*-
import heapq
sys.setrecursionlimit(10**6)
# INF =  float("inf")
INF = 10**18
import bisect
import statistics
mod = 10**9+7
# mod = 998244353

S, T = map(str, input().split())

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s, t = input().split(" ")
print(t+s)

Submission status: Accepted

Solution code:
s, t = map(str, input().split())
print(''.join([t, s]))

Submission status: Accepted

Solution code:
a = input().split()

print("".join(reversed(a)))