print("Hello, World!")
n = int(input()) if n % 2 != 0: print("Weird") elif n % 2 == 0 and n > 20 or n < 6: print("Not Weird") elif n % 2 == 0 and n in range (6,20): print("Weird") else: print("Weird")
a = int(input()) b = int(input()) print(a+b) print(a-b) print(a*b)
a = int(input()) b = int(input()) print(a//b) print(a/b)
N = int(input()) for i in range(0,N): print(i**2)
def is_leap(year): leap = False return year%4==0 and year%100!=0 or year%400==0
n = int(input()) i = 1 while i<= n: print(i, end="") i+=1
x = int(input())
y = int(input())
z = int(input())
n = int(input())
print([[i,j, k] for i in range(x+1) for j in range(y+1) for k in range(z+1) if i+j+k != n ])
n = int(input()) s = [int(x) for x in input().split()] if len(s)==n: sa=sa=(set(sorted(s))) sa.remove(max(sa)) print(max(sa))
students = [] for _ in range(int(input())): name = input() score = float(input()) students.extend([[name, score]])
minst = (sorted(set([b for a, b in students]))[1]) for i,j in sorted(students): if j == minst: print(i)
n = int(input()) student_marks = {} for _ in range(n): name, *line = input().split() scores = list(map(float, line)) student_marks[name] = scores
print('%.2f' %(sum(student_marks[input()])/3))
lst =[]
m = int(input())
for i in range (m):
c = input().split()
if c[0] == "insert":
lst.insert(int(c[1]) ,int(c[2]))
elif c[0] == "remove":
lst.remove(int(c[1]))
elif c[0] == "reverse":
lst.reverse()
elif c[0] == "append":
lst.append(int(c[1]))
elif c[0] == "sort":
lst.sort()
elif c[0] == "pop":
lst.pop(-1)
elif c[0] == "print":
print(lst)
i +=1
import builtins n = int(input()) t = [int(x) for x in input().split()] t = tuple(t) if len(t) == n: print(hash(t))
s=input() l='' for i in s: if i.isupper (): l=l+i.lower() elif i.islower(): l=l+i.upper() else: l=l+i print(l)
def split_and_join(line): return "-".join(line.split())
def print_full_name(a, b): print("Hello {} {}! You just delved into python.".format(a,b))
def mutate_string(string, position, character): return string[:position:]+character+string[position+1:]
def count_substring(string, sub_string):
count=0
for i in range(0,len(string)):
if string[i:len(sub_string)+i]==sub_string:
count+=1
return count
S=input() fun=["isalnum()", "isalpha()", "isdigit()", "islower()", "isupper()"] for x in fun: print(any(eval("k."+x) for k in S))
thickness = int(input()) #This must be an odd number c = 'H' for i in range(0,thickness): print((thickness-i-1)" " + (2i+1)*c)
for i in range(thickness+1): print((thickness)//2*" " + cthickness+(thickness3)" "+ cthickness)
for i in range((thickness+1)//2): print((thickness)//2 " " +c(thickness*5))
for i in range(thickness+1): print((thickness)//2*" " + cthickness+(thickness3)" "+ cthickness)
for i in range(thickness-1,-1,-1): print((thickness4)" "+(thickness-i-1)" " + (2i+1)*c)
#Top Cone
#Top Pillars
#Middle Belt
#Bottom Pillars
#Bottom Cone
print(((c*(thickness-i-1)).rjust(thickness)+c+(c*(thickness-i-1)).ljust(thickness)).rjust(thickness*6))
def wrap(string, max_width): ss=" ".join(textwrap.wrap(string, max_width)) return textwrap.fill(ss,max_width )
n, m = map(int,input().split()) k = 1 for i in range(1,n+1):
if i == 1+(n-1)/2:
print("-"*((m-len('WELCOME'))//2)+ 'WELCOME'+ "-"*((m-len('WELCOME'))//2))
elif i> 1+(n-1)//2:
k-=2
print( "-"*((m-3*k)//2) + ".|."*k + "-"*((m-3*k)//2))
else:
print("-"*((m-3*k)//2)+".|."*k + "-"*((m-3*k)//2))
k+=2
def print_formatted(number):
for i in range(1,number+1):
print("{0:{width}d} {0:{width}o} {0:{width}X} {0:{width}b}".format(i, width= len(bin(n))-2))
def print_rangoli(size): alpa= 'abcdefghijklmnopqrstuvwxyz' for i in range(-size+1,size): t= '-'.join(alpa[size-1:abs(i):-1]+alpa[abs(i):size]) print(t.center(4*size-3, '-'))
def solve(s): import string return string.capwords(s,' ')
def minion_game(s): # your code goes here vw = 'AEIOU' stl = len(s) kevin = sum(stl-i for i in range(stl) if s[i] in vw) stuart = stl*(stl + 1)/2 - kevin
if kevin == stuart:
print('Draw')
elif kevin > stuart:
print( 'Kevin {}'.format(int(kevin)))
else:
print('Stuart {}'.format(int(stuart)))
def merge_the_tools(string, k):
let = list(string)
for i in range(1,len(let)//k+1):
w = let[k*i-k :k*i]
d = []
for j in w:
if j not in d:
d.append(j)
print("".join(d))
def average(array): # your code goes here return sum(set(array))/len(set(array))
n , m = map(int , input().split()) l = list(map(int , input().split())) A = set(map(int , input().split())) B = set(map(int , input().split()))
happiness = 0
print(sum([(i in A) - (i in B) for i in l ]) ) #print(happiness)
a = int(input()) s = set(map(int , input().split())) b = int(input()) d = set(map(int , input().split())) for i in sorted((s.difference(d)| d.difference(s))): print(i)
s= set() for _ in range(int(input())): s.add(input()) print(len(s))
n = int(input()) s = set(map(int, input().split()))
for _ in range(int(input())): x = input().split() if x[0]=='pop': s.pop() else: eval('s.%s(%d)' % (x[0] , int(x[1]))) print(sum(s))
n = int(input()) e = set(map(int,input().split())) m =int(input()) f = set(map(int,input().split()))
print(len(set(f|e)))
n = int(input()) f = set(map(int,input().split())) m = int(input()) e = set(map(int,input().split()))
print(len(f&e))
n = int(input()) e = set(map(int,input().split())) m = int(input()) f = set(map(int,input().split()))
print(len(e.difference(f)))
n = int(input()) e = set(map(int,input().split())) m = int(input()) f = set(map(int,input().split()))
print(len(e.symmetric_difference(f)))
n = int(input()) A = set(map(int, input().split()))
for _ in range(int(input())):
x = input().split()
y = set(map(int, input().split()))
eval('A.%s(%s)' %(x[0] , y))
print(sum(A))
import collections k =int(input()) d = [int(x) for x in input().split()] count = collections.Counter(d) print(count.most_common()[-1][0])
for _ in range(int(input())): int(input()); A = set(map(int, input().split())) int(input()); B = set(map(int, input().split())) print(A.issubset(B))
issuperset= True superset = set(input().split()) n = int(input()) for i in range (1, n+1): subset = set(input().split()) if not all(x in superset for x in subset): issuperset = False elif len(superset) <= len(subset): issuperset = False print(issuperset)
n n = int(input())
size = list(map(int, input().split())) amount = 0 for _ in range(int(input())): x = input().split()
try:
size.remove(int(x[0]))
amount += int(x[1])
except:
pass
print(amount)
from collections import defaultdict d = defaultdict(list)
x = list(map(int, input().split())) l = [] for i in range(1, x[0]+1): z =input() d[z].append(i) for k in range(x[1]): l.append(input())
for j in l: if d[j]==[]: print(-1) else: print(*d[j])
from collections import namedtuple n, marks = int(input()), input().split().index("MARKS") print (sum([int(input().split()[marks]) for _ in range(n)]) / n)
from collections import defaultdict d = defaultdict(list)
x = list(map(int, input().split())) l = [] for i in range(1, x[0]+1): z =input() d[z].append(i) for k in range(x[1]): l.append(input())
for j in l: if d[j]==[]: print(-1) else: print(*d[j])
from collections import Counter l = [] for _ in range(int(input())): l.append(input())
print(len(set(l))) print(*list(Counter(l).values()))
from collections import deque
d = deque()
for _ in range(int(input())):
a = input().split()
if( a[0]=='pop' or a[0]=='popleft'):
eval('d.%s()'%(a[0]) )
else:
eval('d.%s(%d)' % (a[0] , int(a[1])))
print(*list(d))
import calendar i,j ,k = [int(x) for x in input().split()] print(calendar.day_name[calendar.weekday(k, i ,j)].upper())
from datetime import datetime for _ in range(int(input())): t1=datetime.strptime(input(),'%a %d %b %Y %H:%M:%S %z') t2=datetime.strptime(input(),'%a %d %b %Y %H:%M:%S %z') print(int(abs((t1-t2).total_seconds())))
for _ in range(int(input())): try: a,b= map(int,input().split()) print(a//b) except BaseException as error: print("Error Code:",error)
import re number = re.split(r'[. ,]+',input().strip('. ,')) for i in number: print(i)
import re z= re.findall(r'([A-Za-z0-9])\1', input().strip()) print(z[0] if z else -1)
import numpy p = [float(x) for x in input().split()] val = float(input()) value = numpy.polyval(p, val) print(value)
import numpy p = [] for _ in range (int(input())): p.extend([[float(x) for x in input().split()]]) print(numpy.linalg.det(p))
cs = []
numerator , denominator = 1,1
for _ in range (int(input())):
i = [int(x) for x in input().split()]
cs.extend([i])
for i, j in cs:
numerator = numerator* i
denominator = denominator * j
k = Fraction(numerator,denominator)
print(k.numerator,k.denominator)
def check_email(email):
try:
username, web = email.split("@")
website, extention = web.split(".")
valid = username.replace("_", "").replace("-", "")
if len(extention)<= 3 and valid.isalnum() and website.isalnum():
return email
except:
False
emails = [] for _ in range (int(input())): emails.append(input()) valid = list(filter(check_email, emails)) print(sorted(valid))