text
stringlengths 37
1.41M
|
|---|
input()
A = list(input())
B = list(input())
C = list(input())
ans = 0
for a, b, c in zip(A, B, C):
if a == b == c:
ans += 0
elif a == b or b == c or c == a:
ans += 1
else:
ans += 2
print(ans) |
(a,b,c) = map(int,raw_input().split())
if a < b and b < c : print "Yes"
else : print "No" |
def euclid(a, b):
if b == 0:
return a
else:
return euclid(b, a%b)
def multiple(a, b):
return a*b // euclid(a, b)
N = int(input())
print(multiple(N,2)) |
n = list(str(i) for i in input())
print(sum(1 for i in n if i=='2')) |
def actual(s):
N = len(s)
count_operation = 0
for i in range(N):
head = s[i]
tail = s[N - 1 - i]
if head != tail:
count_operation += 1
return int(count_operation / 2)
s = input()
print(actual(s))
|
N = int(input())
for i in range(N,N*2+1,N):
if i % 2 == 0 and i % N == 0:
print(i)
break |
x = list(map(int,input().split()))
y = sorted(x)
if y[0]+y[1]==y[2]:
print("Yes")
else:
print("No") |
a = [1,3,5,7,8,10,12]
b = [4,6,9,11]
c = [2]
x,y=map(int,input().split())
if x in a and y in a:
print("Yes")
elif x in b and y in b:
print("Yes")
else:
print("No") |
lin = input()
l = lin.split(" ")
a = int(l[0])
b = int(l[1])
c = int(l[2])
if a < b < c:
print('Yes')
else:
print('No') |
S = str(input())
if (S[0]==S[1] and S[2]==S[3]) or (S[0]==S[2] and S[1]==S[3]) or (S[0]==S[3] and S[1]==S[2]):
if S[0]==S[1] and S[1]==S[2] and S[2]==S[3]:
print("No")
else:
print("Yes")
else:
print("No") |
l = list(input())
l=set(l)
if len(l)==4: print('Yes')
elif len(l)==2 and 'N' in l and 'S' in l: print('Yes')
elif len(l)==2 and 'E' in l and 'W' in l: print('Yes')
else: print('No') |
N = int(input())
if N ==1:
print("Hello World")
else:
A = int(input())
B = int(input())
ans =A+B
print(ans)
|
def fib(n):
global F
if n not in F:
F[n] = fib(n-1)+fib(n-2)
return F[n]
F = {0:1,1:1}
print(fib(int(input())))
|
s=input().split()
a=int(s[0])
b=int(s[1])
c=int(s[2])
num=[a,b,c]
num.sort()
print(str(num[0])+" "+str(num[1])+" "+str(num[2]))
|
if __name__ == '__main__':
H = int(input())
cnt = 0
while H!=1:
H //= 2
cnt += 1
ans = 0
for c in range(cnt+1):
ans += pow(2, c)
print(ans) |
a = int(input())
a2 = pow(a, 2)
a3 = pow(a, 3)
print(a + a2 + a3) |
from math import gcd
K = int(input())
sum = 0
for i in range(1,K+1):
for j in range(1,K+1):
A = gcd(i,j)
for k in range(1,K+1):
sum += gcd(A,k)
print(sum) |
for i in range(int(raw_input())):
sides = map(int, raw_input().split())
if sides[0]**2 == sides[1]**2 + sides[2]**2 or\
sides[1]**2 == sides[2]**2 + sides[0]**2 or\
sides[2]**2 == sides[0]**2 + sides[1]**2:
print "YES"
else:
print "NO" |
a,b,h = [int(input()) for _ in range(3)]
print(round(((a + b)*h)/2)) |
def factorial(a,n):
# n*(n-1)*,,,,,*(n-a+1)
ans=1
for i in range(n,n-a,-1):
ans=(ans*i)%M
return ans
def pow(x, n):
ans=1
while n:
if n % 2 == 1:
ans = (ans*x)%M
x = (x*x)%M
n >>= 1
return ans
def main():
ans=pow(2,N) - 1
ans-=(factorial(A,N)*pow(factorial(A,A),M-2))%M
ans+= 0 if ans>=0 else M
ans-=(factorial(B,N)*pow(factorial(B,B),M-2))%M
print(ans if ans>=0 else ans+M)
if __name__=='__main__':
N, A, B = map(int, input().split())
M = 10**9 + 7
main()
|
r = int(input())
standard_area = 1
ans_area = r ** 2
ans = ans_area // standard_area
print(ans) |
a=input()
if a[0]!=a[1] and a[1]!=a[2] and a[2]!=a[0]:
print("Yes")
else:
print("No") |
nums = input()
num1 = int(nums.split()[0])
num2 = int(nums.split()[1])
print(num1 * num2) |
S = input()
ans = 0
if S == "RSS" or S == "RSR" or S == "SRS" or S == "SSR":
ans = 1
if S == "RRS" or S == "SRR":
ans = 2
if S == "RRR":
ans = 3
print(ans)
|
import sys
from itertools import accumulate
def input(): return sys.stdin.readline().strip()
sys.setrecursionlimit(10**6)
class UnionFind():
"""
https://note.nkmk.me/python-union-find/
DFSの上位互換と考えて良い
２要素x, yがpath-connectedかどうかをlogオーダーで判定する（螺旋本の14.1節参照）
さらに連結成分の要素数がO(1)で取得可能なように改造してある
"""
def __init__(self, n):
"""
要素数をnとして、各ノードを0,1,...,(n-1)の番号で管理する
parentsは各ノードの属する木の根を表す
ただし根ノードのparentには(その木のノード数)*(-1)を格納する
"""
self.n = n
self.parents = [-1] * n
def find(self, x):
"""
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, yのそれぞれ属する木Tx, Tyの根同士を繋ぐ
このとき木の要素数が小さい方を大きい方に繋ぐ（rankではなくsizeを用いる）
"""
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):
"""
xの属する木の要素数を返す
根の親を要素数の(-1)倍で定めておいたおかげでO(1)で取得可能
"""
return -self.parents[self.find(x)]
def same(self, x, y):
"""
xとyがpath-connectedかを判定する
"""
return self.find(x) == self.find(y)
def members(self, x):
"""
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()}
def __str__(self):
"""
連結成分およびその代表元を出力
"""
return '\n'.join('{}: {}'.format(r, self.members(r)) for r in self.roots())
def main():
N = int(input())
repn = [[] for _ in range(N)]
edge = []
for _ in range(N - 1):
a, b = map(int, input().split())
repn[a - 1].append(b - 1)
repn[b - 1].append(a - 1)
if a > b: a, b = b, a
edge.append((a - 1, b - 1))
"""
まさかの問題を読み間違えていた。。。
（プレイヤーがマスの上を１マスずつ動くと思っていた）
「最適に行動した時」＝「どちらかに必勝法が存在する」と言い換える。
あとはその戦略を見出せば勝ち。見抜けなければ相手の全行動パターンに勝つ手の存在を示す。
同じ色が隣接していればどのマスでも塗れるなら、最初に一気に２人が距離を詰めた方がいいに決まってる。
"""
# 頂点０からのdepthを求める
depth_from_0 = [-1] * N
parent = [-1] * N
depth_from_0[0] = 0
def dfs(u):
for v in repn[u]:
if depth_from_0[v] != -1: continue
depth_from_0[v] = depth_from_0[u] + 1
parent[v] = u
dfs(v)
dfs(0)
# ２人を結ぶパスの同定
path = [N - 1]
while path[-1] != 0: path.append(parent[path[-1]])
l = len(path)
# ２人が互いに塗るマスの数を計算
tree = UnionFind(N)
a0, b0 = path[l // 2 - 1], path[l // 2]
if a0 > b0: a0, b0 = b0, a0
for a, b in edge:
if a != a0 or b != b0: tree.union(a, b)
Fennec = tree.size(0)
Snuke = tree.size(N - 1)
if Fennec > Snuke:
print("Fennec")
else:
print("Snuke")
if __name__ == "__main__":
main()
|
n = 10 ** 2
for i in range(int(input())) :
n = float(n) * 1.05
if n - int(n) > 0 : n = int(n) + 1
else : n = int(n)
print(n * (10 ** 3)) |
L = raw_input().split()
a = int(L[0])
b = int(L[1])
d = int(0)
r = int(0)
f = float(0)
d = a / b
r = a % b
f = float(a) / float(b)
print "{0} {1} {2:f}".format(d,r,f) |
#A
S=input()
T=input()
ans='No'
if S != T:
if S==T[:(len(S))]:
if T[-1].islower():
ans='Yes'
print(ans)
|
def rotate(dice,d):
if d == "N":
temp = dice[0]
dice[0] = dice[1]
dice[1] = dice[5]
dice[5] = dice[4]
dice[4] = temp
elif d == "E":
temp = dice[0]
dice[0] = dice[3]
dice[3] = dice[5]
dice[5] = dice[2]
dice[2] = temp
elif d == "W":
temp = dice[0]
dice[0] = dice[2]
dice[2] = dice[5]
dice[5] = dice[3]
dice[3] = temp
elif d == "S":
temp = dice[0]
dice[0] = dice[4]
dice[4] = dice[5]
dice[5] = dice[1]
dice[1] = temp
elif d == "R":
temp = dice[1]
dice[1] = dice[2]
dice[2] = dice[4]
dice[4] = dice[3]
dice[3] = temp
return dice
dice = input().split()
for j in range(int(input())):
t,f = map(str, input().split())
flag = False
i = 0
while True:
if dice[0] == t:
while True:
if dice[1] == f:
print(dice[2])
flag = True
break
else:
dice = rotate(dice, "R")
if flag:
break
if i%2 == 0:
dice = rotate(dice, "N")
else:
dice = rotate(dice, "E")
i += 1 |
#!/usr/bin/env python3
H, W = map(int, input().split())
M = [list(input()) for _ in range(H)]
# yoko
for i in range(H):
for j in range(W-1):
if (M[i][j] == '#' or M[i][j] == 'M') and (M[i][j+1] == '#' or M[i][j+1] == 'M'):
M[i][j] = 'M'
M[i][j+1] = 'M'
#tate
for j in range(W):
for i in range(H-1):
if (M[i][j] == '#' or M[i][j] == 'M') and (M[i+1][j] == '#' or M[i+1][j] == 'M'):
M[i][j] = 'M'
M[i+1][j] = 'M'
ret = 0
for m in M:
ret += m.count('#')
if ret == 0: print('Yes')
else: print('No')
|
a = input()
N = int(a)
if N == 10**5:
print(90909)
elif N >= 10**4:
print(N-(9000+90))
elif N >= 10**3:
print(909)
elif N >= 10**2:
print(N-90)
elif N >= 10:
print(9)
else:
print(N)
|
if __name__ == '__main__':
# ??????????????\???
num = int(input())
triangles = []
for i in range(num):
triangles.append([int(x) for x in input().split(' ')])
# ??´?§?????§???¢?????????????????????
results = []
for t in triangles:
t.sort()
if t[0]**2 + t[1]**2 == t[2]**2:
results.append('YES')
else:
results.append('NO')
# ???????????????
for r in results:
print(r) |
n = int(input())
if n%2==1:
print(0)
else:
ans = 0
div = 10
pt = 1
while div<=n:
ans += n//div
div *=5
print(ans) |
X,Y = (int(X,16) for X in input().split())
print((X<Y)*'<'+(X==Y)*'='+(X>Y)*'>') |
N = int(input())
res = ''
while True:
amari = N % 26
if amari == 0:
amari = 26
res += chr(96 + amari)
N -= amari
if N == 0:
break
N //= 26
print(res[::-1])
|
import math
x = int(input().replace(' ',''))
y = int(math.sqrt(x))
if y * y == x:
print("Yes")
else:
print("No") |
X = input()
X = int(X)
if X < -40 or X > 40:
print("invalid number 'X'")
elif X >= 30:
print("Yes")
else:
print("No")
|
#!/usr/bin/env python3
#import
import math
#import numpy as np
#= int(input())
#= input()
a, b, x= map(int, input().split())
#= list(map(int, input().split()))
#= [input(), input()]
#= [list(map(int, input().split())) for _ in range(N)]
#= [int(input()) for _ in range(N)]
#= {i:[] for i in range(N)}
d = a * a * b
# 半分より多い
if x * 2 > d:
x = d - x
xx = 2 * x / (a * a * a)
theta = math.atan(xx)
print(theta * 180 / math.pi)
else:
xx = 2 * x / (a * b * b)
theta = math.atan(xx)
print(90 - theta * 180 / math.pi)
|
a=int(input())
if a%10==9 or a>=90:
print("Yes")
else:
print("No") |
n=int(input())
def isprime(n):
if n==1:return False
for i in range(2,int(n**0.5)+1):
if n%i==0:return False
return True
while 1:
if isprime(n):
print(n)
exit()
else:
n+=1
|
X,A,B = list(map(int,input().split()))
if B <= A:
print("delicious")
elif B-A <= X:
print("safe")
else:
print("dangerous") |
print("".join([x.upper() if x.islower() else x.lower() for x in raw_input()])) |
#! /usr/bin/env python
# -*- coding: utf-8 -*-
def main():
#print ("x???%d??§???" % x)
for left in range(1, 10):
for right in range(1, 10):
print("{0}x{1}={2}".format(left, right, left * right))
if __name__ == '__main__':
main() |
data = input().split()
for n in range(len(data)):
data[n] = int(data[n])
W, H, x, y, r = data
if (r <= x <= W - r) and (r <= y <= H - r):
print("Yes")
else:
print("No") |
data=list(map(int,input().split()))
if data[0]/data[1]<=data[2]:
print('Yes')
else:
print('No') |
# Grading
end = 0
while end == 0:
test = [int(i) for i in input().rstrip().split()]
midterm = test[0]
final = test[1]
makeup = test[2]
if midterm == -1 and final == -1 and makeup == -1:
end += 1
elif midterm == -1 or final == -1:
print('F')
else:
if midterm + final >= 80:
print('A')
elif midterm + final >= 65:
print('B')
elif midterm + final >= 50:
print('C')
elif midterm + final >= 30:
if makeup >= 50:
print('C')
else:
print('D')
else:
print('F')
|
n = int(input())
for i in range(1,10):
if n // i == n/i and n//i in range(1,10):
print('Yes')
break
else:
print('No') |
a, b, c = map(int, input().split())
r = 'No'
if c >= a and c <= b:
r = 'Yes'
print(r) |
import sys
def print_arr(arr):
for i in range(len(arr)):
sys.stdout.write(str(arr[i]))
if i != len(arr) - 1:
sys.stdout.write(' ')
print()
def insertion_sort(arr, n, g):
cnt = 0
for i in range(g, n):
v = arr[i]
j = i - g
while j >= 0 and arr[j] > v:
arr[j + g] = arr[j]
j = j - g
cnt += 1
arr[j + g] = v
return cnt
def shell_sort(arr, g):
cnt = 0
for i in range(len(g)):
cnt += insertion_sort(arr, len(arr), g[i])
return cnt
def get_gap(gap):
lst = []
v = 1
cnt = 1
while v <= gap:
lst.append(v)
v += 3**cnt
cnt += 1
if len(lst) == 0: lst.append(1)
return list(reversed(lst))
n = int(input())
arr = [0] * n
for i in range(n):
arr[i] = int(input())
g = get_gap(n)
m = len(g)
cnt = shell_sort(arr, g)
print(m)
print_arr(g)
print(cnt)
for i in range(n):
print(arr[i])
|
s=list(input().split())
if int(s[0])<int(s[2])<int(s[1]):
c='Yes'
elif int(s[1])<int(s[2])<int(s[0]):
c='Yes'
else:
c='No'
print(c) |
a, b = map(int,input().split())
num = int(str(a) + str(b))
if (num**(1/2)).is_integer():
print('Yes')
else:
print('No') |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
s=input()
num=0
for i in s:
#'C'がまだ見つかっていない状態：num=0
#'C'が見つかって'F'がまだ見つかっていない状態:num=1
#'C'が見つかってから'F'が見つかった状態:num=2
#num==0のときに'C'が見つかったらnumを１にする
#num==１のときに'F'が見つかったらnumを２にする
if i=='C' and num==0:
num+=1
if i=='F' and num==1:
num+=1
if num==2:
print('Yes')
else:
print('No')
resolve() |
x,a,b=map(int,input().split())
plan1=x*a
plan2=b
if plan1<plan2:
print(plan1)
elif plan1==plan2:
print(plan1)
else:
print(plan2)
|
#ABC-112-A
N = int(input())
if N == 1:
print("Hello World")
else:
ans = 0
for _ in range(2):
AB = int(input())
ans += AB
print(ans) |
array1 = [1,3,5,7,8,10,12]
array2 = [4,6,9,11]
array3 = [2]
x,y = map(int,input().split())
if (x in array1 and y in array1) or (x in array2 and y in array2) or (x in array3 and y in array3):
print("Yes")
else:
print("No") |
#http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_1_A&lang=jp
#?????\????????????????£?
#?¨?????????????????????????????????±?????????
def insertion_sort(target_list, n_list):
for focus_index in range(1, n_list):
print(*target_list)
target = target_list[focus_index]
if target < target_list[focus_index - 1]:#?????£?????°??????????????§??????
compare_index = focus_index
while compare_index > 0 and target_list[compare_index - 1] > target:
target_list[compare_index] = target_list[compare_index - 1]
compare_index -= 1;
target_list[compare_index] = target
return target_list
def main():
n_list = int(input())
target_list = [int(a) for a in input().split()]
print(*insertion_sort(target_list, n_list))
if __name__ == "__main__":
main() |
num1,num2 = map(int,input().split(" "))
men = num1*num2
leng = (num1+num2)*2
print(men,leng)
|
r = float(input())
s = r * r * 3.14159265358979
l = 2 * r * 3.14159265358979
print(s, end = " ")
print(l) |
a = input()
b = input()
a = a.zfill(101)
b = b.zfill(101)
if a<b:
print('LESS')
elif a>b:
print('GREATER')
else:
print('EQUAL') |
def func(S):
if S[-1] == "s":
return S+"es"
else:
return S+"s"
if __name__ == "__main__":
S = input()
print(func(S)) |
N = int(input())
M = N
X = 0
while M:
X += M % 10
M //= 10
if N % X == 0:
print("Yes")
else:
print("No") |
print('Yes' if '9' in list(input()) else 'No')
|
h={}
for _ in range(input()):
a,b=raw_input().split()
if a[0]=="f":
print "yes" if b in h else "no"
else:
h[b]=1 |
# -*- coding: utf-8 -*-
class dice_class:
def __init__(self, list):
self.num = list
def sut(self, top): #set_up_top
while True:
if self.num[0] == top:
break
else:
self.roll('E')
if self.num[0] == top:
break
else:
self.roll('N')
def suf(self, front): #set_up_front
while True:
if self.num[1] == front:
break
else:
self.roll('SEN')
def roll(self, s):
for i in s:
if i == 'E':
self.rollE()
elif i == 'N':
self.rollN()
elif i == 'S':
self.rollS()
elif i == 'W':
self.rollW()
def rollE(self):
self.num = [self.num[3], self.num[1], self.num[0], self.num[5], self.num[4], self.num[2]]
def rollN(self):
self.num = [self.num[1], self.num[5], self.num[2], self.num[3], self.num[0], self.num[4]]
def rollS(self):
self.num = [self.num[4], self.num[0], self.num[2], self.num[3], self.num[5], self.num[1]]
def rollW(self):
self.num = [self.num[2], self.num[1], self.num[5], self.num[0], self.num[4], self.num[3]]
if __name__ == "__main__":
dice = dice_class(map(int, raw_input().split()))
n = int(raw_input())
for i in range(n):
top, front = map(int, raw_input().split())
dice.sut(top)
dice.suf(front)
print dice.num[2] |
s = input()
t = input()
ans = 'No'
if t==s:
ans = "Yes"
for i in range(len(s)):
s = "".join([s[-1],s[:len(s)-1]])
if t==s:
ans = "Yes"
print(ans) |
n = int(input())
def is_prime(n):
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
num = 11
tmp = 0
while 1:
if is_prime(num):
print(num, end = " ")
tmp += 1
num += 10
if n == tmp:
exit() |
from collections import namedtuple
Task = namedtuple('Task', 'name time')
class Queue:
def __init__(self, n):
self.n = n
self._l = [None for _ in range(self.n + 1)]
self._head = 0
self._tail = 0
def enqueue(self, x):
self._l[self._tail] = x
self._tail += 1
if self._tail > self.n:
self._tail -= self.n
def dequeue(self):
if self.isEmpty():
raise IndexError("pop from empty queue")
else:
e = self._l[self._head]
self._l[self._head] = None
self._head += 1
if self._head > self.n:
self._head -= self.n
return e
def isEmpty(self):
return self._head == self._tail
def isFull(self):
return self._tail == self.n
if __name__ == '__main__':
n, q = map(int, input().split())
queue = Queue(n+1)
for _ in range(n):
name, time = input().split()
time = int(time)
queue.enqueue(Task(name=name, time=time))
now = 0
while not queue.isEmpty():
task = queue.dequeue()
t = task.time
if t <= q:
now += t
print(task.name, now)
else:
now += q
queue.enqueue(Task(task.name, t - q))
|
S = list(input())
f = False
c = 0
for i in range(len(S) - 1):
# if i == len(S) - 2:
# break
if S[i] != S[i + 1]:
continue
else:
if S[i] == "0":
S[i+1] = "1"
c += 1
else:
S[i+1] = "0"
c += 1
print(c) |
# -*- coding: utf-8 -*-
s = input()
c = s.find('C')
f = s.rfind('F')
print('Yes' if c != -1 and f != -1 and c < f else 'No')
|
x = int(input())
y = x **3
print(y, end = "\n") |
G = [set([1,3,5,7,8,10,12]), set([4,6,9,11]), set([2])]
def check(x, y):
for g in G:
if x in g and y in g:
return True
return False
x, y = map(int, input().split())
print("Yes" if check(x, y) else "No")
|
def resolve():
matrix = []
for i in range(3):
line = input()
matrix.append(line)
ans = ""
for i in range(3):
ans += matrix[i][i]
print(ans)
resolve() |
a=input()
if ('a' in a) and ('b' in a) and ('c' in a):
print("Yes")
else:
print("No") |
a,b= list(map(int,input().split()))
if a==0 or b==0:
print("Zero")
elif a>0 and b>0:
print("Positive")
elif a<0 and b>0:
print("Zero")
else:
c = abs(b-a)
if c%2 == 0:
print("Negative")
else:
print("Positive")
|
while(1):
H,W=map(int,input().split());
if H==0 and W==0 :
break
else:
print(('#'*W+'\n')*H) |
while 1:
a,b,c = list(map(str,input().split()))
num_a=int(a)
num_c=int(c)
if b=="+":
print(num_a+num_c)
elif b=="-":
print(num_a-num_c)
elif b=="*":
print(num_a*num_c)
elif b=="/":
print(num_a//num_c)
elif b=="?":
break |
N=int(input())
if N==1:
print("Hello World")
else:
A,B=(input().split() for i in range(2));print(int(A[0])+int(B[0])) |
n = int(input())
ret = ''
for i in range(1,n+1):
str = repr(i)
if (i % 3 == 0): ret += ' ' + repr(i)
elif ('3' in str): ret += ' ' + repr(i)
print(ret) |
N = int(input())
def digitSum(n):
s = str(n)
array = list(map(int, s))
return sum(array)
if digitSum(N) % 9 == 0:
print("Yes")
else:
print("No") |
z = input()
a= z.split()
if int(a[0]) < int(a[1]) < int(a[2]):
print('Yes')
else:
print('No') |
a,b=map(int,input().split())
if a>=10 or b>=10:
print(str(-1)+"\n")
else:
print(str(a*b)+"\n") |
def main(N):
ans = 0
for n in str(N):
ans += int(n)
if ans%9==0:
return 'Yes'
else:
return 'No'
if __name__ == '__main__':
N = int(input())
ans = main(N)
print(ans)
|
N = int(input())
S = sum(i for i in range(1, N + 1) if not (i % 3 == 0 or i % 5 == 0))
print(S)
|
s = input()
ans = ""
for _ in range(len(s)):
if s[0] == "0":
ans += "0"
s = s[1:]
elif s[0] == "1":
ans += "1"
s = s[1:]
else:
s = s[1:]
ans = ans[:-1]
print(ans) |
n = int(input())
a_ = 2
a = 1
for i in range(n-1):
a, a_ = a + a_, a
print(a) |
S = {}
for i in 'ABC':
S[i] = [w for w in input()]
ans = ''
judge = True
turn = S['A'].pop(0).upper()
while judge:
if S[turn] == []:
ans = turn
judge = False
else:
turn = S[turn].pop(0).upper()
print(ans) |
def check(A,B,C):
if A==0 or B==0 or C==0:
return False
if A%2!=0 or B%2!=0 or C%2!=0:
return False
return True
A,B,C=map(int,input().split())
ans=0
if A%2==B%2==C%2==0 and A==B==C:
print(-1)
exit()
while check(A,B,C)==True:
a=B//2+C//2
b=A//2+C//2
c=A//2+B//2
A,B,C=a,b,c
ans+=1
if 10**9<ans:
ans=-1
break
print(ans)
|
N = int(input())
if N == 1:
print(1)
elif N%2 == 0:
print(0.5)
else:
print((N+1)/2/N) |
import math
def prime(num):
array=[]
tmp=int(math.sqrt(n))+1
for i in range(2,tmp):
while num % i == 0:
num/=i
array.append(i)
# リストが空なら入力(num)は素数
if array==[]:
return [num]
else:
if num>1:
array.append(int(num))
return array
n=int(input())
P=prime(n)
P=sorted(P)
num=n
if 1 in P:
print(0)
else:
ans=0
tmp=0
for i in range(0,len(P)):
if i==0:
tmp=P[i]
elif P[i]==P[i-1]:
tmp*=P[i]
else:
tmp=P[i]
num=n
if num%tmp==0:
num/=tmp
ans+=1
print(ans) |
import sys
import os
def file_input():
f = open('CODE_FESTIVAL_2017Final/input.txt', 'r')
sys.stdin = f
def main():
#file_input()
S=input()
a=b=c=0
for s in S:
if s=='a':
a+=1
elif s=='b':
b+=1
else:
c+=1
if max(a,b,c)-min(a,b,c)<=1:
print('YES')
else:
print('NO')
if __name__ == '__main__':
main()
|
STABLE = 'Stable'
UNSTABLE = 'Not stable'
def main():
card_num = int(input())
cards = input().split()
bubble_sorted = bubble_sort(cards, card_num)
select_sorted = select_sort(cards, card_num)
stability = True
for i, c in enumerate(select_sorted):
if c != bubble_sorted[i]:
stability = False
break
stability = STABLE if stability else UNSTABLE
print(' '.join(bubble_sorted))
print(STABLE)
print(' '.join(select_sorted))
print(stability)
return 0
def order(card_sym):
order = int(card_sym[1])
return order
def select_sort(elements, element_num):
elements = list(elements)
for i in range(0, element_num - 1):
min_val = order(elements[i + 1])
min_index = i + 1
for j in range(i + 1, element_num):
if order(elements[j]) < min_val:
min_val = order(elements[j])
min_index = j
if order(elements[i]) > order(elements[min_index]):
elements[i], elements[min_index] = elements[min_index], elements[i]
return elements
def bubble_sort(elements, element_num):
elements = list(elements)
for i in range(1, element_num):
for j in reversed(range(i, element_num)):
if order(elements[j - 1]) > order(elements[j]):
elements[j - 1], elements[j] = elements[j], elements[j - 1]
return elements
if __name__ == '__main__':
main() |
import math
N=int(input())
x=math.ceil(N/1.08)
if math.floor(x*1.08) == N:
print(x)
else:
print(":(")
|
n = int(input())
alphabet = list("abcdefghij"[:n])
# DFS
def print_string(string="", depth=1):
if len(string) == n:
print(string)
else:
for i in range(depth):
if i+1 == depth:
print_string(string+alphabet[i], depth=depth+1)
else:
print_string(string+alphabet[i], depth=depth)
print_string() |
from copy import deepcopy
def bubble_sort(lst):
size=len(lst)
for i in xrange(size):
for j in reversed(range(i+1,size)):
if lst[j].num<lst[j-1].num:
tmp=lst[j]
lst[j]=lst[j-1]
lst[j-1]=tmp
def selection_sort(lst):
size=len(lst)
for i in xrange(size):
mn=i
for j in xrange(i+1,size):
if lst[mn].num>lst[j].num:
mn=j
tmp=lst[i]
lst[i]=lst[mn]
lst[mn]=tmp
class pock:
def __init__(self,val):
self.val=val
self.num=int(val[1:])
def __gt__(self,other):
return self.num>other.num
num=raw_input().strip()
inp=raw_input().strip().split()
arr=[]
for ii in inp:
arr.append(pock(ii))
bubb=deepcopy(arr)
bubble_sort(bubb)
insec=deepcopy(arr)
selection_sort(insec)
print " ".join(pp.val for pp in bubb)
print "Stable"
print " ".join(pp.val for pp in insec)
ok=1
ln=len(arr)
for i in xrange(ln):
if(bubb[i].val!=insec[i].val):
ok=0
break
if ok==1:
print "Stable"
else:
print "Not stable"
|
def main():
s = input()
t = input()
lis = []
for i in range(len(s)-len(t)+1):
f=True
for j in range(len(t)):
if(s[i+j]==t[j] or s[i+j]=="?"):
continue
else:
f=False
break
if(f):
tmp = s[0:i]+t+s[i+len(t):]
res = ""
for k in range(len(tmp)):
if(tmp[k]=="?"):
res += "a"
else:
res+=tmp[k]
lis.append(res)
if(len(lis)==0):
print("UNRESTORABLE")
else:
print(sorted(lis)[0])
if __name__ == '__main__':
main()
|
def main():
n = int(input())
if n%2==1:
print(0)
else:
ans = 0
waru = 10
while n>=waru:
ans += n//waru
waru = waru*5
print(ans)
if __name__ == "__main__":
main()
|
# coding:utf-8
# Doubly Linked List
from collections import deque
def main():
n = int(input())
dll = deque()
for _ in range(n):
operation = input().split(' ')
if operation[0] in ["insert", "delete"]:
key = operation[1]
if operation[0] == "insert":
dll.appendleft(key)
else:
try:
dll.remove(key)
except:
pass
else:
if operation[0][6] == 'F':
dll.popleft()
else:
dll.pop()
print(' '.join(dll))
if __name__ == "__main__":
main() |
a,b=map(int,input().split())
f=a%3==0 or b%3==0 or (a+b)%3==0
print("Possible" if f==True else "Impossible") |
N = input()
S = list(map(str,input().split()))
if "P" in S and "W" in S and "G" in S and "Y" in S :
print("Four")
else :
print("Three") |
k = int(input())
sum = 0
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
for a in range(1, k + 1):
for b in range(1, k + 1):
ab_gcd = gcd(a, b)
for c in range(1, k + 1):
abc_gcd = gcd(c, ab_gcd)
sum += abc_gcd
print(sum)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.