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 = 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=map(str, input().split())
s=b+a
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
[s,t] = [i for i 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:
s,t = map(str, input().split())
ans = t+s
print(ans)

Submission status: Accepted

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

s,t = input().rstrip("\r\n").split(" ")
print(t, s, sep="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

print(s + t)

Submission status: Accepted

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

#############
# Libraries #
#############

import sys
input = sys.stdin.readline

import math
from fractions import gcd
from functools import lru_cache

#############
# Constants #
#############

MOD = 10**9 +7
INF = float('inf')

#############
# Functions #
#############

######INPUT######
def inputI(): return int(input().strip())
def inputS(): return input().strip()
def inputIL(): return list(map(int,input().split()))
def inputSL(): return list(map(str,input().split()))
def inputILs(n): return list(int(input()) for _ in range(n))
def inputSLs(n): return list(input().strip() for _ in range(n))
def inputILL(n): return [list(map(int, input().split())) for _ in range(n)]
def inputSLL(n): return [list(map(str, input().split())) for _ in range(n)]

#####Inverse#####
def inv(n): return pow(n, MOD-2, MOD)

######Combination######
kaijo_memo = []
def kaijo(n):
  if(len(kaijo_memo) > n):
    return kaijo_memo[n]
  if(len(kaijo_memo) == 0):
    kaijo_memo.append(1)
  while(len(kaijo_memo) <= n):
    kaijo_memo.append(kaijo_memo[-1] * len(kaijo_memo) % MOD)
  return kaijo_memo[n]

gyaku_kaijo_memo = []
def gyaku_kaijo(n):
  if(len(gyaku_kaijo_memo) > n):
    return gyaku_kaijo_memo[n]
  if(len(gyaku_kaijo_memo) == 0):
    gyaku_kaijo_memo.append(1)
  while(len(gyaku_kaijo_memo) <= n):
    gyaku_kaijo_memo.append(gyaku_kaijo_memo[-1] * pow(len(gyaku_kaijo_memo),MOD-2,MOD) % MOD)
  return gyaku_kaijo_memo[n]

def nCr(n,r):
  if(n == r):
    return 1
  if(n < r or r < 0):
    return 0
  ret = 1
  ret = ret * kaijo(n) % MOD
  ret = ret * gyaku_kaijo(r) % MOD
  ret = ret * gyaku_kaijo(n-r) % MOD
  return ret

######Factorization######
def factorization(n):
    arr = []
    temp = n
    for i in range(2, int(-(-n**0.5//1))+1):
        if temp%i==0:
            cnt=0
            while temp%i==0:
                cnt+=1
                temp //= i
            arr.append([i, cnt])
    if temp!=1:
        arr.append([temp, 1])

    if arr==[]:
        arr.append([n, 1])
    return arr

#####LCM#####
def lcm(a, b):
    return a * b // gcd (a, b)

#############
# Main Code #
#############

T,S = inputSL()
print(S+T)

Submission status: Accepted

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

Submission status: Accepted

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

    print(t + s)


if __name__ == '__main__':
    main()

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

ans = t + s

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
from sys import stdin
import math

s,t = stdin.readline().rstrip().split()

print(t + s)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
# coding: utf-8

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:
def funk(S,T):
    return T+S
S,T = input().split()
print(funk(S,T))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/user/bin/env python3
# -*- conding: utf-8 -*-


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

    print(T+S)


if __name__ == '__main__':
    main()

Submission status: Accepted

Solution code:
# import math
# import bisect
# import heapq
# from copy import deepcopy
# from collections import deque
# from collections import Counter
# from itertools import accumulate
# from itertools import permutations
# import numpy as np


# k,x = map(int, input().split())
# n = int(input())
# p = list(map(int, input().split()))
s,t = input().split()

print(t+s)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/user/bin/env python3
# -*- conding: utf-8 -*-

S, T = input().split()

print(T+S)

Submission status: Accepted

Solution code:
s = input().split()
s = reversed(s)
print(''.join(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())

lis = [T]
lis.append(S)

ans = "".join(lis)

print(ans)

Submission status: Accepted

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

print(B+A)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
"""
Created on Wed Mar 11 14:47:11 2020

@author: Kanaru Sato
"""

s,t = input().split()

u = t+s

print(u)

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("".join(map(str,[t,s])))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def solve():
    N, M = input().split()
    return M+N

print(solve())

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

Submission status: Accepted

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

ans = T + S
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# A - Strings
s,t=input().split()
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:
def main():
    a, b = input().split()
    print(b+a)


main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
def main():

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


if __name__ == '__main__':
    print(main())

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

ans = T + S

print(ans)

Submission status: Accepted

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

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:
s=input().split()
print("".join(s[::-1]))

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
# スペース区切りの整数の入力
S, T = input().split()

U = T+S
print(U)

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

    result = T+S

    print(result)

if __name__ == "__main__":
    main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
h,n = map(str,input().split())
#li = [int(x) for x in input().split()]
print(n+h)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = t+s
print(ans)

Submission status: Accepted

Solution code:
L = input().split()
L.reverse()
print(*L, sep="")

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# import math
# from itertools import permutations as permus
# from fractions import gcd

# import numpy as np
# import scipy as scp

# 入力の受け取り
s,t = input().split()

ans = t + s

print(ans)

Submission status: Accepted

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

Submission status: Accepted

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


def solve(S: str, T: str):
    ans = T + S
    print(ans)


# Generated by 1.1.6 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 = input().split()

result = T + S

print(result)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import unittest

def print_str(S,T):
	return T+S
    
S, T = input().split(' ')
print(print_str(S,T))

class TestPrint_str(unittest.TestCase):

  def test_print_str(selt):
    
    self.assertEqual(T+S, print_str(T,S))

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
import sys
input = sys.stdin.readline
MOD = 10**9 + 7
INF = float('INF')

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

if __name__ == '__main__':
    main()

Submission status: Accepted

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

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:
import sys
input = lambda: sys.stdin.readline().rstrip()
input_nums = lambda: list(map(int, input().split()))

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

Submission status: Accepted

Solution code:
from itertools import accumulate, permutations, combinations, product, combinations_with_replacement
from math import floor, ceil, sqrt, factorial, log
from bisect import bisect_left, bisect_right
from collections import Counter, defaultdict
from heapq import heappop, heappush, heappushpop
from itertools import product
import sys
stdin = sys.stdin
mod = 10**9 + 7


def ns(): return stdin.readline().rstrip()


def ni(): return int(ns())


def na(): return list(map(int, stdin.readline().split()))


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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
b,a = input().split()
print(''.join([a,b]).strip())

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import math
from functools import reduce
from collections import deque
import sys
sys.setrecursionlimit(10**7)

# スペース区切りの入力を読み込んで数値リストにして返します。
def get_nums_l():
    return [ int(s) for s in input().split(" ")]

# 改行区切りの入力をn行読み込んで数値リストにして返します。
def get_nums_n(n):
    return [ int(input()) for _ in range(n)]

# 改行またはスペース区切りの入力をすべて読み込んでイテレータを返します。
def get_all_int():
    return map(int, open(0).read().split())

def log(*args):
    print("DEBUG:", *args, file=sys.stderr)

s,t = input().split()

print(t+s)

Submission status: Accepted

Solution code:

a, b = input().split()

print(b,end='')
print(a,end='')

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys


def solve():
    readline = sys.stdin.buffer.readline
    mod = 10 ** 9 + 7
    s, t = list(map(str, readline().rstrip().decode('utf-8').split()))
    print(t + s)


if __name__ == '__main__':
    solve()

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

combine = T + S

print(combine)

Submission status: Accepted

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

print(t, s, sep='')

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip()  # ignore trailing spaces

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':
  line=input().split()
  print(line[1],end="")
  print(line[0],end="")

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
import socket

hostname = socket.gethostname()

if hostname == 'F451C':
    sys.stdin = open('a1.in')


def read_int_list():
    return list(map(int, input().split()))


def read_str_list():
    return input().split()


def read_int():
    return int(input())


def read_str():
    return input()


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


main()

Submission status: Accepted

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

Submission status: Accepted

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

print(T + S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
if __name__ == '__main__':

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

Submission status: Accepted

Solution code:
s,t=map(str,input().split())
print(''.join([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,end="")
print(S)

Submission status: Accepted

Solution code:
S, T = [(_) for _ in 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 = input().split()
print (T + S)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
# https://atcoder.jp/contests/abc149/tasks/abc149_a

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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


linking = T + S

print(linking)

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

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

Submission status: Accepted

Solution code:
def connect(s):
  return s[1] + s[0]

s = input().split()
print(connect(s))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# -*- coding -*-
s,t = 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:
import sys
sys.setrecursionlimit(12345678)
import itertools
from collections import Counter
from collections import defaultdict
from collections import deque
import bisect
from heapq import heappush, heappop


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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
N,M = map(str,input().split())

print(M + N)

Submission status: Accepted

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

Submission status: Accepted

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

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:
def main():
    s,t=input().split()
    print(t+s)

main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
n,m=map(str, input().split())
print(m+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())
ans=T+S
print(ans)

Submission status: Accepted

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

ans = T + S

print(ans)

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
S = input().split(" ")
print(S[1] + S[0])

Submission status: Accepted

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

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


if __name__ == '__main__':
    main()

Submission status: Accepted

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

print(T+S)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
a=input()
S,T=a.split(" ",2)
print(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 = input().split()

word = T+S
print(word)

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, end="")
print(s)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
from io import StringIO
import unittest


def resolve() :
    a = input().split()

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

if __name__ == "__main__":
    resolve()

Submission status: Accepted

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

Submission status: Accepted

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


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


if __name__ == "__main__":
    main()

Submission status: Accepted

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

N, M = input().split()

print(M + N)

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

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 = [str(i) for i in 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,sep='')

Submission status: Accepted

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

s,t = input().split()

print(t+s)

Submission status: Accepted

Solution code:
A,B = input().rstrip().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()

ans = t+s

print(ans)

Submission status: Accepted

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

Submission status: Accepted

Solution code:
#!/usr/bin/env python3
import sys
input = sys.stdin.readline

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

def read_ints(row):
    return list(map(int, row().split()))
  
S, T = row().rstrip().split() 
print(T+S)

Submission status: Accepted

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


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

Submission status: Accepted

Solution code:
# A - Strings

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

Submission status: Accepted

Solution code:
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline

##### リストの 二分木検索 #####
# bisect_left(lists, 3)
# bisect_right(lists, 3)

##### プライオリティキュー #####
# heapq.heapify(a) #リストaのheap化
# heapq.heappush(a,x) #heap化されたリストaに要素xを追加
# heapq.heappop(a) #heap化されたリストaから最小値を削除＆その最小値を出力

# heapq.heappush(a, -x) #最大値を取り出す時は、pushする時にマイナスにして入れよう
# heapq.heappop(a) * (-1) #取り出す時は、-1を掛けて取り出すこと

##### タプルリストのソート #####
# sorted(ans) #(a, b) -> 1st : aの昇順, 2nd : bの昇順
# sorted(SP, key=lambda x:(x[0],-x[1])) #(a, b) -> 1st : aの昇順, 2nd : bの降順
# sorted(SP, key=lambda x:(-x[0],x[1])) #(a, b) -> 1st : aの降順, 2nd : bの昇順
# sorted(SP, key=lambda x:(-x[0],-x[1])) #(a, b) -> 1st : aの降順, 2nd : bの降順

# sorted(SP, key=lambda x:(x[1])) #(a, b) -> 1st : bの昇順
# sorted(SP, key=lambda x:(-x[1])) #(a, b) -> 1st : bの降順

def inputInt(): return int(input())
def inputMap(): return map(int, input().split())
def inputList(): return list(map(int, input().split()))

def main():
	I = input()
	I = I[:-1]
	II = I.split()
	ans = II[1] + II[0]

	print(ans)



if __name__ == "__main__":
	main()

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans = t + s
print(ans)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

ans =''

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

O = T+S 

print(O)

Submission status: Accepted

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

print(y+x)

Submission status: Accepted

Solution code:
import sys
s, t = map(str, sys.stdin.readline().split())

print(t+s)

Submission status: Accepted

Solution code:
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines

s, t =  readline().split()
print('{}{}'.format(str(t), str(s)))

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys

stdin = sys.stdin

ns = lambda : stdin.readline().rstrip()
ni = lambda : int(ns())
na = lambda : stdin.readline().split()
sys.setrecursionlimit(10 ** 7)

def main():
    s, t = na()
    print(t + s)


if __name__ == '__main__':
    main()

Submission status: Accepted

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

Submission status: Accepted

Solution code:


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

print("".join((T,S)))

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
s=input()
a='0'
b='0'
p=False
for i in range(len(s)):
  if s[i]==' ':
    p=True
  if p==False:
    a+=s[i]
  else:
    b+=s[i]
a=a.replace('0','')
b=b.replace('0','')
b=b.replace(' ','')
b+=a
print(b)

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
# ABC 149 A

S, T = input().split()

print(T+S)

Submission status: Accepted

Solution code:
# coding: utf-8
# Your code here!
def pin(type=int):
    return map(type,input().split())


S,T = pin(str)
print(T+S)

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

Submission status: Accepted

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

Submission status: Accepted

Solution code:
import sys
input=sys.stdin.readline
def INT(): return int(input())
def MAP(): return map(int, input().split())
def LIST(): return list(map(int, input().split()))

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

Submission status: Accepted

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

Submission status: Accepted

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