text
stringlengths
37
1.41M
N=int(input()) a=1 sum=0 while a in range(N+1): if a%3 !=0 and a%5 !=0: sum=sum+a a = a + 1 else:a=a+1 print(sum)
def main(): A = list(input()) B = list(input()) if A == B: print("EQUAL") elif len(A) > len(B): print("GREATER") elif len(A) < len(B): print("LESS") else: for a, b in zip(A, B): if a > b: print("GREATER") break elif a < b: print("LESS") break if __name__ == '__main__': main()
n=int(input()) a=n%10 if a==2 or a==4 or a==5 or a==7 or a==9: print("hon") elif a==0 or a==1 or a==6 or a==8: print("pon") else: print("bon")
# あなたは、X 円を持ってケーキとドーナツを買いに出かけました。 # あなたはまずケーキ屋で 1個 A円のケーキを 1個買いました。 # 次に、ドーナツ屋で 1個 B 円のドーナツをできるだけたくさん買いました。 # # これらの買い物のあと手元に残っている金額は何円ですか。 # 制約 # 1 ≦ A, B ≦ 1,000 # A + B ≦ X ≦ 10,000 # X, A, B は整数である # 標準入力から、X, A, B の値を取得する x = int(input()) a = int(input()) b = int(input()) # 残金を計算して出力する result = 0 result = (x - a) % b print(result)
n=int(input()) if n==4 or n==5: print(1) else: print(n//3)
n=int(input()) c=0 for i in input().split(): c+=int(i) print("YES" if c%2==0 else "NO")
a,b,c = (int(x) for x in input().split()) if a<c<b or b<c<a: print("Yes") else: print("No")
N = int(input()) if N==25:print("Christmas") elif N==24:print("Christmas Eve") elif N==23:print("Christmas Eve Eve") else : print("Christmas Eve Eve Eve")
from math import sqrt while True: input_data =[] # ????´?????????? alpha = 0 # ?????? num = int(input()) if num == 0: break input_data = [float(i) for i in input().split()] m = sum(input_data) / float(num) for i in range(num): alpha += (input_data[i] - m)**2 print(sqrt(alpha/num))
a,b,c=map(int,input().split()) if a==b==c or (a!=b!=c and a!=c!=b): print("No") else: print("Yes")
string = input() sum = 0 for i in range(len(string)): sum += int(string[i]) if sum % 9 == 0: print('Yes') else: print('No')
s=int(input()) a=s//100 b=s%100 if 1<=a<=12 and 1<=b<=12: print("AMBIGUOUS") elif 1<=a<=12 and (b>12 or b==0): print("MMYY") elif (a==0 or a>12) and 1<=b<=12: print("YYMM") else: print("NA")
x = int(input()) ans = 0 s = 0 while s < x: ans += 1 s += ans print(ans)
def solve(): from collections import deque S = input() s = deque(S) Q = int(input()) reverse = False for i in range(Q): T = input().split() if T[0] == '1': if reverse: reverse = False else: reverse = True else: if T[1] == '1' and not reverse: s.appendleft(T[2]) elif T[1] == '1' and reverse: s.append(T[2]) elif T[1] == '2' and not reverse: s.append(T[2]) else: s.appendleft(T[2]) if reverse: print(''.join(s)[::-1]) else: print(''.join(s)) if __name__ == "__main__": solve()
n = int(input()) string = input() ans = 0 for i in range(0, n-2): if string[i] == "A" and string[i+1] == "B" and string[i+2] == "C": ans += 1 print(ans)
a,b,x=map(int,input().split()) if a<=x and a+b>=x: ans="YES" else: ans="NO" print(ans)
N=int(input()) bandera=False for i in range(10): for j in range(10): producto=i*j if producto==N: bandera=True if bandera==True: print("Yes") else: print("No")
c=input() d=ord(c) if c=="z": exit() print(chr(d+1))
N = int(input()) memo = [] memo = [1,1] + [0] * (N - 1) def f(n): if memo[n] == 0: memo[n] = f(n-1) + f(n-2) return(memo[n]) if memo[n] != 0: return(memo[n]) print(f(N))
n=int(input()) num=[2,1] for i in range(n-1): num.append(num[-1]+num[-2]) print(num[n])
x=int(input()) if x==1: print('Hello World') else: l=[int(input()) for i in range(2)] print(l[0]+l[1])
c = input() print("vowel" if (c=='a'or c=='i'or c=='u' or c=='e' or c =='o') else "consonant")
def gcd(a,b): if b == 0: return a return gcd(b, a % b) def lcm(a,b): return a * b / gcd(a,b) print reduce(lcm, [int(raw_input()) for oo in range(int(raw_input()))])
A, B = input().split() X = int(A + B) if (X ** 0.5).is_integer(): print("Yes") else: print("No")
def LI(): return list(map(int, input().split())) A, B, C = LI() if A+B >= C: ans = "Yes" else: ans = "No" print(ans)
n=list(input().split()) n.sort() if n[0]=="1" and n[1]=="4" and n[2]=="7" and n[3]=="9": print("YES") else: print("NO")
a = input() b = input() c = input() Sa,Sb,Sc = [],[],[] for x in a: Sa.append(x) for x in b: Sb.append(x) for x in c: Sc.append(x) x = Sa.pop(0) while True: if x == "a": if Sa == []: print("A") break else: x = Sa.pop(0) elif x == "b": if Sb == []: print("B") break else: x = Sb.pop(0) else : if Sc == []: print("C") break else: x = Sc.pop(0)
# coding: utf-8 s=input() flg=False for i in range(len(s)-1): if s[i]=="A" and s[i+1]=="C": flg=True if flg: print("Yes") else: print("No")
rectArray = [] h, w = input().split() h = int(h) w = int(w) while h != 0 and w != 0: rectArray.append([h, w]) h, w = input().split() h = int(h) w = int(w) for x in rectArray: for i in range(x[0]): if i == 0 or i%2 == 0: lever = True else: lever = False for j in range(x[1]): if lever == True: print("#", end = '') lever = False else: print(".", end ='') lever = True print("") print("")
#!/usr/bin/env python3 import sys input = sys.stdin.readline class UnionFind(): def __init__(self, n, m = None, read = 0): self.n = n self.parents = [-1] * n if read: if m is None: raise ValueError("What is M") for i in range(m): a, b = map(int, input().split()) self.union(a - 1, b - 1) def find(self, x): if self.parents[x] < 0: return x else: self.parents[x] = self.find(self.parents[x]) return self.parents[x] def union(self, x, y): x = self.find(x) y = self.find(y) if x == y: return if self.parents[x] > self.parents[y]: x, y = y, x self.parents[x] += self.parents[y] self.parents[y] = x def size(self, x): return -self.parents[self.find(x)] def same(self, x, y): return self.find(x) == self.find(y) def members(self, x): root = self.find(x) return [i for i in range(self.n) if self.find(i) == root] def roots(self): return [i for i, x in enumerate(self.parents) if x < 0] def group_count(self): return len(self.roots()) def all_group_members(self): return {r: self.members(r) for r in self.roots()} n, m = map(int, input().split()) *p, = map(int, input().split()) UF = UnionFind(n, m, read = 1) a = 0 for i in range(n): P = p[i] - 1 if UF.same(P, i): a += 1 print(a)
def prime(num): if num == 0: return False elif num == 1: return False elif num == 2: return True i = 2 while True: if i**2 > num: break if num%i==0: return False i += 1 return True n = int(raw_input()) nums = [] for _ in range(n): a = int(raw_input()) nums.append(a) ret = 0 for num in nums: if prime(num): ret += 1 print ret
mojiretsua=input() mojiretsub=input() count=0 for i in range(len(mojiretsua)): if mojiretsua[i] != mojiretsub[i]: count=count+1 print(count)
N = str(input()) num = 0 ln = len(N) for nn in range(ln): if N[nn] == "2": num = num + 1 print(num)
n = int(input()) # 動的計画法 def fibonacci(n): F = [0]*(n+1) F[0] = 1 F[1] = 1 for i in range(2, n+1): F[i] = F[i-2] + F[i-1] return F f = fibonacci(n) print(f[n])
l = [int(i) for i in input().split(" ")] if l[0] == l[1] and l[0] == l[2]: print("Yes") else: print("No")
import sys n=int(input()) b=True print(0) w1=input() if w1=="Vacant": b=False sys.exit() print(n-1) w2=input() if w2=="Vacant": b=False sys.exit() left=0 right=n-1 count=2 while b and count<20: mid=(left+right)//2 print(mid) w=input() count+=1 if w=="Vacant": b=False sys.exit() else:#left%2 right%2 mid%2 が等しいかどうか全部で4通り if left%2==mid%2 and w1!=w: right=mid w2=w elif left%2!=mid%2 and w1==w: right=mid w2=w elif right%2==mid%2 and w2!=w: left=mid w1=w elif right%2!=mid%2 and w2==w: left=mid w1=w
S = str(input()) if len(S) == 2: print(S) else: A = list(reversed(S)) print(''.join(A))
n=int(input()) s=0 for i in str(n): s+=int(i) if(s%9==0): print("Yes") else: print("No")
import math x=int(input()) def eratosthenes(n): """n以下の素数をエラトステネスの篩によって求める.リストをかえす""" prime = [] limit = math.sqrt(n) data = [i + 1 for i in range(1, n)] while True: p = data[0] if limit <= p: return prime + data prime.append(p) data = [e for e in data if e % p != 0] ans=eratosthenes(10**5+3) for i in range(len(ans)): if ans[i]>=x: print(ans[i]) exit() else: pass
n = int(input()) s = input() list_intersection = [] for i in range(1, n + 1): a = set(s[:i]) b = set(s[i:]) intersection_a_b = a.intersection(b) list_intersection.append(len(intersection_a_b)) print(max(list_intersection))
n = int(input()) for i in range(1, n + 1): if (i % 3) == 0: print(' ' + str(i), end='') continue x = i while True: if (x == 0): break if (x % 10 == 3): print(' ' + str(i), end='') break x //= 10 print()
from math import sqrt a,b,c=map(int,input().split()) if (c-a-b)>0 and 4*a*b<(c-a-b)*(c-a-b): print("Yes") else: print("No")
s = input() c = 0 for i in range(3): if s[i] == "R": c += 1 if c == 2: if s[1] == "S": print(1) else: print(2) else: print(c)
x = int(input()) h = x // 3600 m = x % 3600 // 60 s = x % 60 print(h,m,s,sep=':')
C=str(input()) V="aiueo" if C in V: ans="vowel" else: ans="consonant" print(ans)
def get_int_list(): return list(map(int, input().split())) d, t, s = get_int_list() if t * s >= d: print("Yes") else: print("No")
s = input() k = len(s) potential_win = 15 - k win_cnt = s.count("o") if win_cnt + potential_win >= 8: print("YES") else: print("NO")
INF = 10000000000 def merge(A,left,mid,right): count = 0 L = A[left:mid] + [INF] R = A[mid:right] + [INF] i,j = 0,0 for k in range(left, right): count += 1 if L[i] <= R[j]: A[k]=L[i] i += 1 else: A[k]=R[j] j += 1 return count def merge_sort(A,left,right): if left+1 < right: mid = (left+right)//2 count_l = merge_sort(A,left,mid) count_r = merge_sort(A,mid,right) return merge(A,left,mid,right) + count_l + count_r return 0 n = int(input()) A = [int(i) for i in input().split()] count = merge_sort(A, 0, n) for i in range(n): if i: print(" ", end = "") print(A[i], end = "") print() print(count)
input_str = list(input()) ans = '' for i in input_str: if i == '0': ans = ans +'0' elif i == '1': ans = ans + '1' elif i == 'B': if ans == None: continue else: ans = ans[:-1] print(ans)
S = input() ans = [0,0] if 1<=int(S[:2]) and int(S[:2]) <= 12 : ans[0] = 1 if 1 <=int(S[2:]) and int(S[2:]) <= 12 : ans[1] = 1 if ans == [1,1] : print('AMBIGUOUS') elif ans == [0,0] : print('NA') elif ans == [0,1] : print('YYMM') elif ans == [1,0] : print('MMYY')
def test(): arr = input() arr = arr.split() arr = sorted(arr) if arr==['5', '5', '7']: print("YES") else: print("NO") test()
N =int(input()) if N<=2: print(0) exit() count = 0 while N >=6: N-=3 count+=1 count+=1 print(count)
s = input() ans = 0 if s == 'SUN': ans = 7 elif s == 'MON': ans = 6 elif s == 'TUE': ans = 5 elif s == 'WED': ans = 4 elif s == 'THU': ans = 3 elif s == 'FRI': ans = 2 elif s == 'SAT': ans = 1 print(ans)
a = int(input()) b = int(input()) if a == 1: if b == 2: print(3) else: print(2) elif a == 2: if b == 1: print(3) else: print(1) else: if b == 2: print(1) else: print(2)
x = input().split() a = int(x[0]) b = int(x[1]) c = int(x[2]) d = int(x[3]) left = a+b right = c+d if left > right: print('Left') elif left < right: print('Right') else: print('Balanced')
a=list(input()) b=list(input()) c=list(input()) order='a' while True: if order=='a': if len(a)==0: print('A') break else: order=a[0] a=a[1:] elif order=='b': if len(b)==0: print('B') break else: order=b[0] b=b[1:] elif order=='c': if len(c)==0: print('C') break else: order=c[0] c=c[1:]
from fractions import gcd def lcm(a,b): return a*b//gcd(a,b) N,M = map(int,input().split()) A = [int(i) for i in input().split()] a = 0 b = A[0] while b % 2 == 0: a += 1 b = b//2 for i in range(1,N): if A[i] % (2**a) != 0 or A[i] % (2**(a+1)) == 0: print(0) exit() c = A[0] for i in range(N-1): c = lcm(c,A[i+1]) print((M+c//2)//c)
# -*- coding: utf-8 -*- # 整数の入力 a, b = map(int, input().split()) if a * b % 2 == 0: x = "Even" else: x = "Odd" print(x)
X = int(input()) r = 0 ans = 0 while True: r += X r %= 360 ans += 1 if r == 0: break print(ans)
import math from fractions import Fraction a,b,x=map(int,input().split()) if b*(a**2)<=x*2: print(math.degrees(math.atan(Fraction(2*(a*a*b-x),a**3)))) else: print(math.degrees(math.atan(Fraction(a*b*b,2*x))))
AA = input() A =list(AA) BB = input() B = list(BB) CC = input() C = list(CC) X ='a' while True: if X == 'a': if len(A) == 0: break else: X = A.pop(0) elif X =='b': if len(B) ==0: break else: X = B.pop(0) else: if len(C) == 0: break else: X = C.pop(0) print(X.upper())
import sys for line in sys.stdin: a,b = map(int, line.split()) if a < b: a,b = b,a def gcd(x,y): while y > 0: x,y = y,x%y return x def lcm(x,y): return x * y / gcd(x, y) print(gcd(a,b), int(lcm(a,b)))
a,b = map(int, input().split()) if a==1 and b!=1: print("Alice") elif a!=1 and b==1: print("Bob") elif a==1 and b==1: print("Draw") elif a>b: print("Alice") elif a<b: print("Bob") else: print("Draw")
S = input() s=[] for i in S: s.append(i) t = [] for i in range(len(s)): if s[i] == '?': t.append('D') else: t.append(s[i]) Strt = "".join(t) print(Strt)
N = int(input()) W = input() L = [W] for n in range(N-1): w = input() if W[-1] == w[0] and w not in L: L.append(w) W = w else: print("No") exit() print("Yes")
N=int(input()) if len(input().replace("B",""))>N/2: print("Yes") else: print("No")
a = input().split() if int(a[2])-int(a[1]) == int(a[1])-int(a[0]): print("YES") else: print("NO")
s=input() a=s[:len(s)//2+1//2] b=s[len(s)//2+1:] if s==s[::-1] and a==a[::-1] and b==b[::-1]: print("Yes") else: print("No")
import math a, b = input().split() ab = int(a+b) if int(math.sqrt(ab))**2 == ab: print('Yes') else: print('No')
syl=sorted(list(map(int,input().split()))) syl2=[5, 5, 7] if syl == syl2: print('YES') else: print('NO')
#!/usr/bin/env python3 MOD = 10**9 def make_divisors(n): divisors = [] for i in range(1, int(n**0.5)+1): if n % i == 0: divisors.append(i) if i != n // i: divisors.append(n//i) return divisors a, b, c = map(int, input().split()) print(a*b//2)
def check(str): str2 = str[::-1] return str == str2 def main(): s = input() n = len(s) first = s[:(n-1)//2] end = s[((n+3)//2)-1:] if all((check(s), check(first), check(end))): print("Yes") else: print("No") main()
s1,s2,s3=map(str,input().split()) s1=list(str.upper(s1)) s2=list(str.upper(s2)) s3=list(str.upper(s3)) print(s1[0]+s2[0]+s3[0])
def main(): import math s = int(input()) mod = 10**9+7 c = s//3 ans = 0 for i in range(1,c+1): l = s - i*3 ans += (math.factorial(l+i-1)//math.factorial(l)//math.factorial(i-1)) % mod print(ans%mod) if __name__ == "__main__": main()
from math import gcd k = int(input()) sum = 0 for a in range(1,k+1): for b in range(1,k+1): for c in range(1,k+1): sum += gcd(gcd(a, b), c) print(sum)
s=[] for i in range(3): s.append(input()) member=["A","B","C"] turn=0 while True: if s[turn]=="": winner=turn break if s[turn][0]=="a": next=0 elif s[turn][0]=="b": next=1 else: next=2 s[turn]=s[turn][1:] turn=next print(member[winner])
N=int(input()) MAX = 55555*5 + 10 def makePrimeChecker(n): """ エラトステネスの篩. nまでの自然数が素数かどうかを表すリストを返す. O(nloglog(n)) """ isPrime = [True] * (n + 1) isPrime[0] = False isPrime[1] = False for i in range(2, int(n ** 0.5) + 1): if isPrime[i]: for j in range(i*i, n+1, i): #i 毎に大きくする isPrime[j] = False return isPrime is_prime = makePrimeChecker(MAX) nums = [] for num in range(2, 55555+1): if is_prime[num]: if num % 5 == 1: nums.append(num) ans = nums[:N] print(*ans)
a = input() print("A" if a =="T" else "T" if a =="A" else "G" if a =="C" else "C")
s=list(input()) c=False for x in s: if not c: if x=="C":c=True if c and x=="F": print("Yes") exit(0) print("No")
import sys N = int(input()) for cake in range(30): for donut in range(15): if 4*cake+7*donut == N: print('Yes') sys.exit() print('No')
s = list(input()) count = 0 list1 = [] for x in s: if x == 'A' or x == 'G' or x == 'T' or x == 'C': count = count + 1 list1.append(count) if x != 'A' and x != 'G' and x != 'T' and x != 'C': count = 0 print(max(list1))
import math r = float(input()) print("{:.6f} {:.6f}\n".format(math.pi * r ** 2, 2 * math.pi * r))
import math def main(): a, b, x = map(int, input().split()) if (a*b)*a/2 >= x: y = 2*x/(a*b) ans = math.degrees(math.atan((b/y))) else: y = (2*(a**2*b - x))/(a**2) ans = math.degrees(math.atan(y/a)) print(ans) if __name__ == "__main__": main()
m=[] for i in range(10): x = input() m.append(x) m.sort() m.reverse() for i in range(0,3): print m[i]
N=int(input()) s=input() k=s.count("R") o=s.count("B") print("Yes"if k>o else "No")
x,y=map(int,input().split()) if(x>8 or y>8): print(":(") else: print("Yay!")
import math import bisect def is_prime(n): if n == 1: return False for k in range(2, int(math.sqrt(n)) + 1): if n % k == 0: return False return True result=[] a=int(input()) for i in range(a-500,a+501): if i<0: continue if is_prime(i): result.append(i) bisect.insort_left(result,a) n=bisect.bisect_left(result,a) print(result[n+1])
a, b = input().split(" ") a = int(a) b = int(b) if a-2*b < 0: print(0) else: print(a-2*b)
a,b = map(int,input().split()) print("Possible" if a%3 == 0 else "Possible" if b%3 == 0 else "Possible" if (a+b)%3 == 0 else "Impossible")
n=input() if n=="abc"or n=="acb" or n=="bac" or n=="bca" or n== "cab" or n=="cba": print("Yes") else:print("No")
print("Yes" if sorted(input()) == sorted("abc") else "No")
min_x = 123 max_x = 0 for _ in range(5): x = int(input()) if x <= min_x: min_x = x if x >= max_x: max_x = x k = int(input()) if k < max_x-min_x: print(":(") else: print("Yay!")
while(1): char_list = list(input()) int_list = [0 for i in range(len(char_list))] if char_list[0] == '0': break for i in range(len(char_list)): int_list[i] = int(char_list[i]) print(sum(int_list))
X = int(input()) i = 1 while i*(i+1)<2*X: i+=1 print(i)
alf=['A','B','C','D','E','F'] x,y=input().split() if alf.index(x)<alf.index(y): print('<') elif alf.index(x)>alf.index(y): print('>') else: print('=')
# -*- coding : utf-8 -*- def gcd(num_a, num_b): if num_b == 0: return num_a elif num_a == 0: return num_b if num_a < num_b: return gcd(num_a, num_b % num_a) else: return gcd(num_b, num_a % num_b) num_a, num_b = [int(x) for i, x in enumerate(input().split()) if i < 2] print(gcd(num_a, num_b))
list = [] for i in range(10): a = input() list.append(a) list = sorted(list) for i in range(-1, -4, -1): print(list[i])
s = input() first = 0 < int(s[:2]) < 13 second = 0 < int(s[2:]) < 13 if first and second: print('AMBIGUOUS') elif first: print('MMYY') elif second: print('YYMM') else: print('NA')
for n in range(1,10): for i in range(1, 10): print('{}x{}={}'.format(n, i, eval('{}*{}'.format(n, i))))
def main(): n = int(input()) inlis = list(map(int, input().split())) inset = set(inlis) if len(inlis) == len(inset): print("YES") else: print("NO") if __name__ == "__main__": main()