200720 알고스팟 문제

	tc = int(input())
	for j in range(tc):
	c = [input().split(' ') for k in range(3)]
	if(c[0][0] == c[1][0]):
	if(c[0][1] == c[2][1]):
	c.append([c[2][0], c[1][1]])
	elif(c[1][1] == c[2][1]):
	c.append([c[2][0], c[0][1]])
	elif(c[0][0] == c[2][0]):
	if(c[0][1] == c[1][1]):
	c.append([c[1][0], c[2][1]])
	elif(c[1][1] == c[2][1]):
	c.append([c[1][0], c[0][1]])
	elif(c[1][0] == c[2][0]):
	if(c[0][1] == c[1][1]):
	c.append([c[0][0], c[2][1]])
	elif(c[0][1] == c[2][1]):
	c.append([c[0][0], c[1][1]])
	print(' '.join(c[3]))

view raw drawrect.py hosted with ❤ by GitHub

	tc = int(input())
	nn = []
	for j in range(tc):
	n = int(input())
	a = n & 0xFF
	b = (n >> 8) & 0xFF
	c = (n >> 16) & 0xFF
	d = (n >> 24) & 0xFF
	nn.append(0x00000000 | d | (c<<8) | (b<<16) | (a<<24))
	for j in range(tc):
	print(nn[j])

view raw endians.py hosted with ❤ by GitHub

	i = int(input())
	for j in range(0, i):
	print('Hello Algospot!')

view raw mercy.py hosted with ❤ by GitHub