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:
s,t=map(str,input().split())

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys, bisect, math, itertools, string, queue, copy
import numpy as np
import scipy
from collections import Counter,defaultdict,deque
from itertools import permutations, combinations
from heapq import heappop, heappush
# input = sys.stdin.readline
sys.setrecursionlimit(10**8)
mod = 10**9+7
def inp(): return int(input())
def inpm(): return map(int,input().split())
def inpl(): return list(map(int, input().split()))
def inpls(): return list(input().split())
def inplm(n): return list(int(input()) for _ in range(n))
def inplL(n): return [list(input()) for _ in range(n)]
def inplT(n): return [tuple(input()) for _ in range(n)]
def inpll(n): return [list(map(int, input().split())) for _ in range(n)]
def inplls(n): return sorted([list(map(int, input().split())) for _ in range(n)])

s,t = input().split()

print(t+s)

Submission status: Accepted

Solution code:
import bisect,collections,copy,heapq,itertools,math,numpy,string
import sys
sys.setrecursionlimit(10**7)

def S(): return sys.stdin.readline().rstrip()
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())

def main():
    S,T = LS()
    print(T+S)

main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:

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:
s,t=map(str,input().split())
print("{}{}".format(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:
import sys
input = sys.stdin.readline

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:
X, A = [i for i in input().split()]
print(A + X)

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=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())
ans = T+S
print(ans)

Submission status: Accepted

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def main():

    S, T = input().split()

    ans = T + S

    print(ans)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

if '__main__' == __name__:
    resolve()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#k = int(input())
#s = input()
#a, b = map(int, input().split())
#s, t = map(str, input().split())
#l = list(map(int, input().split()))

s, t = map(str, input().split())

print(t+s)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(b+a)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import re
import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
import functools
def v(): return input()
def k(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(input().split())
def l(): return list(map(int,input().split()))
def lcm(a,b): return a*b//math.gcd(a,b)
sys.setrecursionlimit(10 ** 9)
mod = 10**9+7
cnt = 0
ans = 0
inf = float("inf")

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:
# abc149_a.py
# https://atcoder.jp/contests/abc149/tasks/abc149_a

# A - Strings /
# 実行時間制限: 2 sec / メモリ制限: 1024 MB
# 配点 : 100点

# 問題文
# 英小文字のみからなる 2つの文字列 S, T が与えられます。
# これらの文字列を T, Sの順に空白を空けずに連結し、できる文字列を出力してください。

# 制約
#     S, Tは英小文字のみからなる文字列
#     S, T の長さは 1 以上 100以下

# 入力
# 入力は以下の形式で標準入力から与えられる。
# S T

# 出力
# できる文字列を出力せよ。

# 入力例 1
# oder atc

# 出力例 1
# atcoder

# S=oder, T= atc のとき、T, Sの順に連結してできる文字列は atcoder です。

# 入力例 2
# humu humu

# 出力例 2
# humuhumu


global FLAG_LOG
FLAG_LOG = False


def log(value):
    # FLAG_LOG = True
    # FLAG_LOG = False
    if FLAG_LOG:
        print(str(value))


def calculation(lines):
    # S = lines[0]
    # N = int(lines[0])
    S, T = list(lines[0].split())
    # values = list(map(int, lines[1].split()))
    # values = list(map(int, lines[2].split()))
    # values = list()
    # for i in range(N):
    #     values.append(int(lines[i]))
    # valueses = list()
    # for i in range(N):
    #     valueses.append(list(map(int, lines[i+1].split())))

    result = T + S

    return [result]


# 引数を取得
def get_input_lines(lines_count):
    lines = list()
    for _ in range(lines_count):
        lines.append(input())
    return lines


# テストデータ
def get_testdata(pattern):
    if pattern == 1:
        lines_input = ['oder atc']
        lines_export = ['atcoder']
    if pattern == 2:
        lines_input = ['humu humu']
        lines_export = ['humuhumu']
    return lines_input, lines_export


# 動作モード判別
def get_mode():
    import sys
    args = sys.argv
    global FLAG_LOG
    if len(args) == 1:
        mode = 0
        FLAG_LOG = False
    else:
        mode = int(args[1])
        FLAG_LOG = True
    return mode


# 主処理
def main():
    import time
    started = time.time()
    mode = get_mode()
    if mode == 0:
        lines_input = get_input_lines(1)
    else:
        lines_input, lines_export = get_testdata(mode)

    lines_result = calculation(lines_input)

    for line_result in lines_result:
        print(line_result)

    # if mode > 0:
    #     print(f'lines_input=[{lines_input}]')
    #     print(f'lines_export=[{lines_export}]')
    #     print(f'lines_result=[{lines_result}]')
    #     if lines_result == lines_export:
    #         print('OK')
    #     else:
    #         print('NG')
    # finished = time.time()
    # duration = finished - started
    # print(f'duration=[{duration}]')


# 起動処理
if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
def main():
    s, t =  input().split()
    print(t, s, sep='')
    
if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(*input().split()[::-1],sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t + s)

Submission status: Accepted

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

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()

print(T,S,sep='')

Submission status: Accepted

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

if not ( S.islower() and T.islower() ): sys.exit()
if not ( 1 <= len(S) <= 100 and 1 <= len(S) <= 100 ): sys.exit()

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# -*- coding: utf-8 -*-
a=input().split()
print(a[1]+a[0])

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
l = input().split()
s,t = l[0], l[1]
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:
s = list(input().split(' '))
print(s[1] + s[0])

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S,T=input().split()
print('{}{}'.format(T,S))

Submission status: Accepted

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

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())
res =T+S
print(res)

Submission status: Accepted

Solution code:
S = list(input().split())[::-1]

res = "".join(S)

print(res)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = input().split()
st.reverse()
print(''.join(st))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def strings(s, t):

    return t+s

def main():
    s, t = map(str, input().split())
    print(strings(s, t))

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()
print(f"{t}{s}")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
print(*input().split()[::-1],sep="")

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 = input().split()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(t,end="")
print(s)

Submission status: Accepted

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

Submission status: Accepted

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

print(str(t) + str(s))

Submission status: Accepted

Solution code:
print(''.join(reversed(input().split())))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# n, r = map(int, input().split())
# from collections import OrderedDict
# d = OrderedDict()
a = list(input().split())
# b = list(map(int, input().split()))
# print(r + max(0, 100*(10-n)))
print("".join(a[::-1]))

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
back, front = input().split()
print(front, back, sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


# input = sys.stdin.readline

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


if __name__ == "__main__":
    main()

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
inf = 10**17
mod = 10**9+7


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007


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

    return


if __name__ == '__main__':
    main()

Submission status: Accepted

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

import io
import sys
import math

def solve():
    # implement process
    pass

def main():
    # input
    s,t= input().split()
    
    # process
    ans = t+s
    
    # output
    print(ans)
    return ans
        
### DEBUG I/O ###
_DEB = 0   # 1:ON / 0:OFF

_INPUT = """\
humu humu
"""
_EXPECTED = """\
humuhumu

"""

def logd(str):
    """usage:
    if _DEB: logd(f"{str}")
    """
    if _DEB: print(f"[deb] {str}")

### MAIN ###
if __name__ == "__main__":
    if _DEB:
        sys.stdin = io.StringIO(_INPUT)
        print("!! Debug Mode !!")

    ans = main()

    if _DEB:
        print()
        if _EXPECTED.strip() == ans.strip(): print("!! Success !!")
        else: print(f"!! Failed... !!\nANSWER:   {ans}\nExpected: {_EXPECTED}")

Submission status: Accepted

Solution code:
s, t = map(str, 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:
X = input().split(' ')
print(X[1] + X[0])

Submission status: Accepted

Solution code:
import sys
#import string
#from collections import defaultdict, deque, Counter
#import bisect
#import heapq
#import math
#from itertools import accumulate
#from itertools import permutations as perm
#from itertools import combinations as comb
#from itertools import combinations_with_replacement as combr
#from fractions import gcd
#import numpy as np

stdin = sys.stdin
sys.setrecursionlimit(10 ** 7)
MIN = -10 ** 9
MOD = 10 ** 9 + 7
INF = float("inf")
IINF = 10 ** 18

def solve():
    #n = int(stdin.readline().rstrip())
    s,t = map(str, stdin.readline().rstrip().split())
    #l = list(map(int, stdin.readline().rstrip().split()))
    #numbers = [[int(c) for c in l.strip().split()] for l in sys.stdin]
    #word = [stdin.readline().rstrip() for _ in range(n)]
    #number = [[int(c) for c in stdin.readline().rstrip()] for _ in range(n)]
    #zeros = [[0] * w for i in range(h)]
    print(t+s)

if __name__ == '__main__':
    solve()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
st = input()

list = (st.split())

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#include <CodeforcesSolutions.h>
#include <ONLINE_JUDGE <solution.cf(contestID = "1369",problemID = "A",method = "GET")>.h>
"""
    Author : thekushalghosh
    Team   : CodeDiggers
 
    I prefer Python language over the C++ language :p :D
        
    Visit my website : thekushalghosh.github.io
"""
import sys,math,cmath,time
start_time = time.time()
##########################################################################
################# ---- THE ACTUAL CODE STARTS BELOW ---- #################

def solve():
    s,t = invr()
    print(t + s)
        
################## ---- THE ACTUAL CODE ENDS ABOVE ---- ##################
##########################################################################
 
def main():
    global tt
    if not ONLINE_JUDGE:
        sys.stdin = open("b3.in","r")
        sys.stdout = open("output.txt","w")
    t = 1
    for tt in range(t):
        solve()
    if not ONLINE_JUDGE:
        #print("Time Elapsed :",time.time() - start_time,"seconds")
        sys.stdout.close()
    
#---------------------- USER DEFINED INPUT FUNCTIONS ----------------------#
def inp():
    return(int(input()))
def inlt():
    return(list(map(int,input().split())))
def insr():
    return(input().strip())
def invr():
    return(map(str,input().split()))
 
#------------------ USER DEFINED PROGRAMMING FUNCTIONS ------------------#
def counter(a):
    q = [0] * max(a)
    for i in range(len(a)):
        q[a[i] - 1] = q[a[i] - 1],1
    return(q)
 
def string_counter(a):
    q = [0] * 26
    for i in range(len(a)):
        q[ord(a[i]) - 97] = q[ord(a[i]) - 97],1
    return(q)

def factors(n):
    q = []
    for i in range(1,int(n ** 0.5) + 1):
        if n % i == 0: q.append(i); q.append(n // i)
    return(list(sorted(list(set(q)))))

def prime_factors(n):
    q = []
    while n % 2 == 0: q.append(2); n = n // 2
    for i in range(3,int(n ** 0.5) + 1,2):
        while n % i == 0: q.append(i); n = n // i
    if n > 2: q.append(n)
    return(list(sorted(q)))

#-----------------------------------------------------------------------#
        
ONLINE_JUDGE = __debug__
if ONLINE_JUDGE:
    input = sys.stdin.readline
main()

Submission status: Accepted

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

Submission status: Accepted

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

s, t = map(str, input().split())

print(t, s, sep='')

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
S, T = (str(x) for x in 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 = input().split()

ans = s + t
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(b+a)

Submission status: Accepted

Solution code:
a = input().split()
b = str(a[0])
c = str(a[1])

print(c+b)

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():
    s,t = map(str, input().split(' '))
    print(t + s)
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("%s%s"%(t,s))

Submission status: Accepted

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


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    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
    solve(S, T)

if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
Ss, Ts = input().split()

print(Ts+Ss)

Submission status: Accepted

Solution code:
# 149 A

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

Submission status: Accepted

Solution code:
a1=input()
a2=[i for i in a1.split()]
S,T=[a2[i] for i in (0,1)]
print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
A - Strings
https://atcoder.jp/contests/abc149/tasks/abc149_a

"""
import sys


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


if __name__ == '__main__':
    main(sys.argv[1:])

Submission status: Accepted

Solution code:
#<ABC149>
#<A>
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:
# 149a

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

Submission status: Accepted

Solution code:
A, W = list(map(str, input().split()))
output = W + A
print(output)

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s,t=list(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())
 
x = t + s
print(x)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
sys.setrecursionlimit(4100000)
import math
INF = 10**9

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('{}{}'.format(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:
s = input().split()
print(s[1]+s[0])

Submission status: Accepted

Solution code:
S, T = map(str, 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(''.join(T+S))

Submission status: Accepted

Solution code:
import sys
input = lambda: sys.stdin.readline().rstrip()

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
a,b= input().split()
c = b + a
print(c)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin

s, t = stdin.readline().rstrip().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:
s,t = map(str,input().split())
print("".join(t+s))

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

Solution code:
import sys

input = lambda: sys.stdin.readline().rstrip()


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


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

# print(f'{t}{s}')
print('{}{}'.format(t, s))

Submission status: Accepted

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

    re = T + S
    print(re)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

print(B+A)

Submission status: Accepted

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

print('{}{}'.format(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(t+s)

Submission status: Accepted

Solution code:
import sys
import decimal # 10進法に変換，正確な計算

def input():
    return sys.stdin.readline().strip()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

main()

Submission status: Accepted

Solution code:
def func(S, T):
    ans = T + S
    return ans


if __name__ == "__main__":
    S, T = input().split()
    print(func(S, T))

Submission status: Accepted

Solution code:
import sys
from collections import defaultdict
readline = sys.stdin.buffer.readline
# sys.setrecursionlimit(10**5)


def geta(fn=lambda s: s.decode()):
    return map(fn, readline().split())


def gete(fn=lambda s: s.decode()):
    return fn(readline().rstrip())


def main():
    s, t = geta()

    print(t + s)


if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
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().split()

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

print(t+s)

Submission status: Accepted

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


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


# Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools  (tips: You use the default template now. You can remove this line by using your custom template)
def main():
    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
    solve(S, T)

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(" ")

print(T+S)

Submission status: Accepted

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

read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines


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


if __name__ == '__main__':
    main()

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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