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: Accepted

Solution code:
'''
import math
import fractions

def make_divisors(n):
    divisors = []
    for i in range(1, int(n**0.5)+1):
        if n % i == 0:
            divisors.append(i)
            if i != n // i:
                divisors.append(n//i)

    # divisors.sort()
    return divisors

def bitlist(x,digit):
    res = [0 for i in range(digit)]
    now = x
    for i in range(digit):
        res[i]=now%2
        now = now >> 1
    return res
'''
#a = list(map(int, input().split()))
'''
n,m,t = list(map(int, input().split()))

nb = [[] for i in range(n+1)]
for i in range(n):
    a,b = list(map(int, input().split()))
    nb[a].append([b,i])
    nb[b].append([a,i])
print(nb)

order = [-1 for i in range(n+1)]
order[1] = 0
noworder = 1
nbnow = [len(nb[i])-1 for i in range(n+1)]

print(nbnow)
queue = [[1,999999]]
deque = 0

while(len(queue)>deque and len(queue)<20):
    nownum = queue[deque][0]
    nowpos = queue[deque][1]
    deque+=1
    print("a",nownum,nowpos)
    while(True):
        if(nb[nownum][nbnow[nownum]][1] > nowpos):
            nbnow[nownum] -= 1
        if(nbnow[nownum]<=-1):
            break
    if(nbnow[nownum]<=-1):
        continue
    
    nextnum = nb[nownum][nbnow[nownum]][0]
    nextpos = nb[nownum][nbnow[nownum]][1]
    print(nextnum,nextpos)
    if(order[nextnum]==-1):
        queue.append([nextnum,nextpos])
        order[nextnum]=noworder
        noworder+=1


print(order)
'''

#a = list(map(str, input().split()))

a = list(map(str,input().split()))

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print(T + S)

Submission status: Accepted

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

a_r = []

for i in range(1,3):
  a_r.append(a[-i])
 
print(''.join(a_r))

Submission status: Accepted

Solution code:
import sys
def fastio():
    from io import StringIO
    from atexit import register
    global input
    sys.stdin = StringIO(sys.stdin.read())
    input = lambda : sys.stdin.readline().rstrip('\r\n')
    sys.stdout = StringIO()
    register(lambda : sys.__stdout__.write(sys.stdout.getvalue()))
fastio()

def debug(*var, sep = ' ', end = '\n'):
    print(*var, file=sys.stderr, end = end, sep = sep)

INF = 10**20
MOD = 10**9 + 7
I = lambda:list(map(int,input().split()))
# from math import gcd
from math import ceil
from collections import defaultdict as dd, Counter
from bisect import bisect_left as bl, bisect_right as br

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 = map(str, input().split())
print(str(T) + str(S))

Submission status: Accepted

Solution code:
l = list(map(str, input().split(" ")))
print(l[-1] + l[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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:
S, T = raw_input().split()
print T+S

Submission status: Accepted

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

Submission status: Accepted

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

print T + S

Submission status: Accepted

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

Submission status: Accepted

Solution code:
text=input()

s,t=text.split()

print(t+s)

Submission status: Accepted

Solution code:
S, T = [str(_) for _ in input().split()]

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

if __name__=="__main__":
  main()

Submission status: Accepted

Solution code:
n, h = input().split(' ')
print(h + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = (input().split())
#print(S, T)
print(''.join([T, S]))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_uppercase, digits
from fractions import gcd
 
def input(): return sys.stdin.readline().strip()
def INT(): return int(input())
def MAP(): return map(int, input().split())
def S_MAP(): return map(str, input().split())
def LIST(): return list(map(int, input().split()))
def S_LIST(): return list(map(str, input().split()))
 
sys.setrecursionlimit(10 ** 9)
INF = float('inf')
mod = 10 ** 9 + 7

# 最小公倍数
def gcd(a, b):
  if a < b:
      a, b = b, a
  while a % b != 0:
      a, b = b, a % b
  return b
 
# 最大公約数 
def lcm(a, b):
  y = a*b / gcd(a, b)
  return int(y)

s, t = S_MAP()

print(t+s)

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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(X+N)



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()
ans = t+s
print(ans)

Submission status: Accepted

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

print(b + a)

Submission status: Accepted

Solution code:
string = []

string = input().split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding:utf-8 -*-

if __name__=='__main__':
  s, t = input().strip().split(' ')
  print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
num = input()



num2 = num.split()

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

A, B = stdin.readline().rstrip().split()

print(B + A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = input().split()
print(T, S, sep='', end="\n")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = [x for x in 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 = map(str,input().split())
print(t + "" + s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!

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=[i for i in input().split()]
print(t+s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def getdata_input():
    while True:
        yield input()
def callFunc2(it):
    #A1,A2,A3=map(int, next(it).split())
    S=[""]*2
    S[1],S[0]=next(it).split()
    return("".join(S))
it=getdata_input()
print(callFunc2(it))

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(1000000000)
from fractions import gcd
from itertools import count
from functools import lru_cache
from collections import defaultdict
from pprint import pprint
ii = lambda: int(input())
mis = lambda: map(int, input().split())
lmis = lambda: list(mis())
INF = float('inf')
N1097 = 10**9 + 7

def meg(f, ok, ng):
    while abs(ok-ng)>1:
        mid = (ok+ng)//2
        if f(mid):
            ok=mid
        else:
            ng=mid
    return ok
#

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

main()

Submission status: Accepted

Solution code:
import sys
s, t = [i for i in sys.stdin.readline().split()]
print(t+s)

Submission status: Accepted

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

print(b + a)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1

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

Submission status: Accepted

Solution code:
# coding: utf-8

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

Submission status: Accepted

Solution code:
s1 = input().split()
s1 = s1[::-1]
print("".join(s1))

Submission status: Accepted

Solution code:
import sys
import math
from collections import defaultdict

sys.setrecursionlimit(10**7)
def input():
    return sys.stdin.readline()[:-1]

mod = 10**9 + 7

def I(): return int(input())
def II(): return map(int, input().split())
def III(): return list(map(int, input().split()))
def Line(N,num):
    if N<=0:
        return [[]]*num
    elif num==1:
        return [I() for _ in range(N)]
    else:
        read_all = [tuple(II()) for _ in range(N)]
        return map(list, zip(*read_all))

#################

S,T = map(str, 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())
res = t + s
print(res)

Submission status: Accepted

Solution code:
左,右=map(str,input().split())
print(右+左)

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(10000000)
# input = sys.stdin.readline
# from bisect import *
# from collections import *
# from heapq import *
# import functools
# import itertools
# import math
INF = 500000
MOD = 10**9+7

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def A():
    temp = input().split()
    print(''.join(temp[::-1]))

A()

Submission status: Accepted

Solution code:
#  Copyright: this code was written at Dec 30th, 2019. for AtCoder, by Silviase
s,t = input().split()
print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
li = input().split(' ')

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
A=list(map(str, input().split()))
print(A[1]+A[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(ans)

Submission status: Accepted

Solution code:
import sys

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:
string = input().split()
print(string[1]+string[0])

Submission status: Accepted

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

from collections import deque, defaultdict
import itertools as ite
import sys
import math
import decimal

sys.setrecursionlimit(1000000)

INF = 10 ** 18
MOD = 10 ** 9 + 7

A, B = raw_input().split()
print B + A

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s,t = map(str,input().split()) 

print(t + s)

Submission status: Accepted

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

print(word2 + word1)

Submission status: Accepted

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

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

print(T + S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#A-string
s=input().split()
ans=s[1]+s[0]
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
arr=list(input().split())
res=arr[1]+arr[0]
print(res)

Submission status: Accepted

Solution code:
import os
import sys

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
sys.setrecursionlimit(500000)

s, t = read().decode("utf-8").split()

print(t + s)

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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


main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

def main():
    l=sys.stdin.readline().split()
    print(l[1]+l[0])

main()

Submission status: Accepted

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

Submission status: Accepted

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

string.append(T)
string.append(S)

print("".join(string))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7 # 998244353
input=lambda:sys.stdin.readline().rstrip()
def resolve():
    s,t=input().split()
    print(t+s)
resolve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


print(T+S)

Submission status: Accepted

Solution code:
def f(i):
    return i
s,t=map(f,input().split())
print(t+s)

Submission status: Accepted

Solution code:
import sys
bbn=1000000007
	
#+++++
		
def main():
	s ,t = input().split()
	print(t+s)
	
	
#+++++
isTest=False

def pa(v):
	if isTest:
		print(v)

if __name__ == "__main__":
	if sys.platform =='ios':
		sys.stdin=open('inputFile.txt')
		isTest=True
	else:
		pass
		#input = sys.stdin.readline
			
	ret = main()
	if ret is not None:
		print(ret)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = input().split()
S = a[0]
T = a[1]

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s = input()
arr = [i for i in s.split(' ')]
print(arr[1]+arr[0])

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

print("{}{}".format(t, s))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n, k = map(str, input().split())
nn = list(n)
kk = list(k)
kk.extend(nn)
print(''.join(kk))

Submission status: Accepted

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(t+s))
    return


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

Submission status: Accepted

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

Submission status: Accepted

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

U = T+S
print(U)

Submission status: Accepted

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

Submission status: Accepted

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

    print(T+S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
the_string = raw_input()
S, T = the_string.split()
print(T.strip()+S.strip())

Submission status: Accepted

Solution code:
tlv = input()
tw = tlv.split()
print(tw[1],tw[0],sep='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

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:
import sys
sys.setrecursionlimit(10**9)
INF=10**18
def input():
    return sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a = [str(i) for i in input().split()]
c=(a[1],a[0])
b=''.join(c)
print(b)

Submission status: Accepted

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

ans = t + s

print(ans.strip())

Submission status: Accepted

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

Submission status: Accepted

Solution code:
text = [i for i in input().split()]
text = text[1] + text[0]
print(text)

Submission status: Accepted

Solution code:
def main(s, t):
    print(t, s, sep="")


if __name__ == "__main__":
    s, t = input().split()

    main(s, t)

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
def print_ans(S):
    """Test Case
    >>> print_ans(["oder",  "atc"])
    atcoder
    """
    print("".join(S[::-1]))

if __name__ == '__main__':
    S = list(input().rstrip().split())
    print_ans(S)

Submission status: Accepted

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

Submission status: Accepted

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

s = T + S
print(s)

Submission status: Accepted

Solution code:
[s,t] = [x for x in input().split()]
t=str(t+s)
print(t)

Submission status: Accepted

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

print(T, end="")
print(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("{}{}".format(t, s))

Submission status: Accepted

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

print(T + S)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding:utf-8 -*-
 
if __name__=='__main__':
  s, t = input().strip().split()
print(t+s)

Submission status: Accepted

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

S, T = map(str, 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 = input().strip().split(" ")

print("{}{}".format(T, S))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s = input()
    items = s.split()
    S = items[0]
    T = items[1]
    print(T + S)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

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

print(T+S)

Submission status: Accepted

Solution code:
A = input().split(' ')

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

Submission status: Accepted

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 t + s


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: Accepted

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

Submission status: Accepted

Solution code:
import sys

sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]

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

Submission status: Accepted

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

R = T + S
print(R)

Submission status: Accepted

Solution code:
w, x= input().split(" ")
n = str(w)
a = str(x)

print(a + n)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
data = input().split(' ')

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
from sys import stdin
S = stdin.readline().rstrip().split()
print(S[1] + S[0])

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
s, t = input().split()
print("{}{}".format(t, s))

Submission status: Accepted

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

Submission status: Accepted

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

print(B+A)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
#import numpy as np
stdin = sys.stdin

ri = lambda: int(rs())
rl = lambda: list(map(int, stdin.readline().split())) # applies to numbers only
rs = lambda: stdin.readline().rstrip()  # ignore trailing spaces

S, T = input().split()
print(T+S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
c=list(map(str, input().split()))

print(c[1], end="")
print(c[0], end="")

Submission status: Accepted

Solution code:
from sys import stdin, stdout

lis = stdin.readline()[:-1].split(' ')
lis.reverse()
print(''.join(lis))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t + s)

Submission status: Accepted

Solution code:
def main():
    S,T = map(str,input().split())
    print(T+S)
 
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
str = input().split()
 
print(str[1]+str[0], sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
strings = list(map(str, input().split()))
string = strings[1] + strings[0]
print(string)

Submission status: Accepted

Solution code:
import sys

A, B = raw_input().split()
print "%s%s" % (B, A)

Submission status: Accepted

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

print T+S

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

line = sys.stdin.readline().split()

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
    s = input()
    list = s.split(" ", )
    ans =""
    for i in list:
        ans =  i+ans 
    print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
def main():
    StringS,StringT = input().split();

    print(StringT+StringS);

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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

Submission status: Accepted

Solution code:
M, N = input().split()
print(N + M)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s_list = list(input().split())
S = s_list[0]
T = s_list[1]
ans_list = []
ans_list.append(T)
ans_list.append(S)
output = ''.join(ans_list)
print(output)

Submission status: Accepted

Solution code:
# 2つの入力を空白で分割し、数値化
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:
T, S = map(str, input().split())
print(S + T)