AtCoder Beginner Contest 149 - Strings

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-----
oder atc

-----Sample Output-----
atcoder

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

Difficulty: EASY

Starter code:

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


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


(k, x) = input().split()
print(x + k)


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


a = input().split()
print(f'{a[1]}{a[0]}')


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


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


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


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


(a, b) = input().split()
for i in (b, a):
	print(i, end='')


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


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


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


a = input().rstrip().split()
print(a[1] + a[0])


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


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


(x, y) = input().split()
print(y + x)


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


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

def __starting_point():
	main()
__starting_point()


(A, B) = input().rstrip().split()
print(B + A)


(L, R) = input().split()
k = R + L
print(k)


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


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


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


(a, s) = map(str, input().split())
print(s + a)


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


a = input().split()
s = a[0]
t = a[1]
print(t + s)


print(''.join(reversed(input().split())))


A = input().split(' ')
print(A[1] + A[0])


(X, Y) = input().split(' ')
print(Y + X)


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


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


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


(S, T) = input().split()
print(''.join([T, S]))


(a, b) = input().split()
c = b + a
print(c)


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


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


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


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


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


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


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


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


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


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


(n, k) = list(input().split(' '))
print(k + n)


(S, T) = input().split(' ')
print(T, S, sep='')


(A, B) = input().split(' ')
print(B + A)


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


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


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


X = input().split(' ')
print(X[1] + X[0])


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


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


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


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


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


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


S = input().split()
print(S[1] + S[0])


(f, b) = input().split()
print(b + f)


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


(s, ss) = map(str, input().split())
print(ss + s)


(S, T) = [s for s in input().split()]
print(''.join([T, S]))


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


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


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


(s, t) = input().split()
print(f'{t}{s}')


(a, b) = map(str, input().split(' '))
print(b + a)


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


li = input().split(' ')
print(li[1] + li[0])


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


(b, c) = input().split(' ')
print(c + b)


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


(b, c) = map(str, input().split())
print(c + b)


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


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


ST = input().split()
print(ST[1] + ST[0])


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


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


N = input().split(' ')
print(N[1] + N[0])


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


a = input()
(S, T) = a.split(' ', 2)
print(T + S)


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


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


string = input()
(a, b) = string.split()
print(b + a)


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


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


(n, m) = input().split()
print(m + n)


(N, M) = map(str, input().split())
print(M + N)


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


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

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

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

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

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

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

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

def main():
	solve()

def __starting_point():
	main()
__starting_point()


S = input().split()
print(''.join(S[::-1]))


n = input()
(p, q) = n.split()
print(q + p)


(s, t) = list(map(str, input().split()))
ans_str = ''
for i in range(0, len(t)):
	ans_str += t[i]
ans_str1 = ''
for j in range(0, len(s)):
	ans_str1 += s[j]
print(ans_str + ans_str1)


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


ar = input().split(' ')
print(ar[1] + ar[0])


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


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


(n, m) = map(str, input().split())
print(m + n)


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


import math
from collections import Counter
from itertools import product
ii = lambda : int(input())
mi = lambda : map(int, input().split())
li = lambda : list(map(int, input().split()))
(s, t) = input().split()
print(t + s)


(A, B) = list(input().split())
print(B + A)


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


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


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


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


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


(Ss, Ts) = input().split()
print(Ts + Ss)


c = input().split(' ')
print(c[1] + c[0])


(str1, str2) = input().split()
print(str2 + str1)


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


arr = input().split()
print(arr[1] + arr[0])


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


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


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


import sys
from itertools import chain

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

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

def __starting_point():
	main()
__starting_point()


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


(s1, s2) = input().split()
print(s2 + s1)


str = input().split(' ')
print(str[1] + str[0])


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