input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
#
# itp1 11d
#
import random
class Cube:
def __init__(self, u, s, e, w, n, d):
self.u = u
self.s = s
self.e = e
self.w = w
self.n = n
self.d = d
def rotate(self, dic):
if dic == "N":
tmp = self.u
self.u = self.s
self.s = self.d
self.d = self.n
self.n = tmp
elif dic == "E":
tmp = self.u
self.u = self.w
self.w = self.d
self.d = self.e
self.e = tmp
elif dic == "W":
tmp = self.u
self.u = self.e
self.e = self.d
self.d = self.w
self.w = tmp
else:
tmp = self.u
self.u = self.n
self.n = self.d
self.d = self.s
self.s = tmp
def main():
N = int(eval(input()))
cubeL = []
for i in range(N):
u, s, e, w, n, d = list(map(int, input().split()))
cube = Cube(u, s, e, w, n, d)
cubeL.append(cube)
ret = "Yes"
for i in range(N):
for j in range(i+1, N):
flag = True
for k in range(1000):
cubeL[j].rotate(random.choice("NEWS"))
if cubeL[i].u == cubeL[j].u and cubeL[i].n == cubeL[j].n and cubeL[i].w == cubeL[j].w and cubeL[i].e == cubeL[j].e and cubeL[i].s == cubeL[j].s and cubeL[i].d == cubeL[j].d:
flag = False
break
if not flag:
break
if not flag:
ret = "No"
break
print(ret)
if __name__ == '__main__':
main()
| #
# itp1 11d
#
import random
class Cube:
def __init__(self, u, s, e, w, n, d):
self.u = u
self.s = s
self.e = e
self.w = w
self.n = n
self.d = d
def rotate(self, dic):
if dic == "N":
tmp = self.u
self.u = self.s
self.s = self.d
self.d = self.n
self.n = tmp
elif dic == "E":
tmp = self.u
self.u = self.w
self.w = self.d
self.d = self.e
self.e = tmp
elif dic == "W":
tmp = self.u
self.u = self.e
self.e = self.d
self.d = self.w
self.w = tmp
else:
tmp = self.u
self.u = self.n
self.n = self.d
self.d = self.s
self.s = tmp
def main():
N = int(eval(input()))
cubeL = []
for i in range(N):
u, s, e, w, n, d = list(map(int, input().split()))
cube = Cube(u, s, e, w, n, d)
cubeL.append(cube)
ret = "Yes"
for i in range(N):
for j in range(i+1, N):
flag = True
for k in range(100):
cubeL[j].rotate(random.choice("NEWS"))
if cubeL[i].u == cubeL[j].u and cubeL[i].n == cubeL[j].n and cubeL[i].w == cubeL[j].w and cubeL[i].e == cubeL[j].e and cubeL[i].s == cubeL[j].s and cubeL[i].d == cubeL[j].d:
flag = False
break
if not flag:
break
if not flag:
ret = "No"
break
print(ret)
if __name__ == '__main__':
main()
| p02386 |
mask = [[i for i in range(6)], (1, 5, 2, 3, 0, 4), (2, 1, 5, 0, 4,3),(3, 1, 0, 5, 4, 2), (4, 0, 2, 3, 5, 1)]
mask += [[mask[1][i] for i in mask[1]]]
def set_top(dice, top):
return [dice[i] for i in mask[top]]
def twist(dice):
return [dice[i] for i in (0, 3, 1, 4, 2, 5)]
def equal(dice1, dice2):
for i in range(6):
tmp_dice = set_top(dice2, i)
for _ in range(4):
if dice1 == tmp_dice:
return True
tmp_dice = twist(tmp_dice)
return False
def diff_check_all(dices, n):
for i in range(n -1):
for j in range(i + 1, n):
if equal(dices[i], dices[j]):
return False
return True
n = int(eval(input()))
dices = [input().split() for _ in range(n)]
print(('Yes' if diff_check_all(dices, n) else 'No')) | mask = [[i for i in range(6)], (1, 5, 2, 3, 0, 4), (2, 1, 5, 0, 4,3),(3, 1, 0, 5, 4, 2), (4, 0, 2, 3, 5, 1)]
mask += [[mask[1][i] for i in mask[1]]]
def set_top(dice, top):
return [dice[i] for i in mask[top]]
def twist(dice):
return [dice[i] for i in (0, 3, 1, 4, 2, 5)]
def equal(dice1, dice2):
if sorted(dice1) != sorted(dice2):
return False
for i in range(6):
tmp_dice = set_top(dice2, i)
for _ in range(4):
if dice1 == tmp_dice:
return True
tmp_dice = twist(tmp_dice)
return False
def diff_check_all(dices, n):
for i in range(n -1):
for j in range(i + 1, n):
if equal(dices[i], dices[j]):
return False
return True
n = int(eval(input()))
dices = [input().split() for _ in range(n)]
print(('Yes' if diff_check_all(dices, n) else 'No')) | p02386 |
class dice:
def __init__(self,label):
self.label = {i+1: l for i,l in enumerate(label)}
def roll(self,op):
l = self.label
if op=='N': self.label = {1:l[2], 2:l[6], 3:l[3], 4:l[4], 5:l[1], 6:l[5]}
elif op=='E': self.label = {1:l[4], 2:l[2], 3:l[1], 4:l[6], 5:l[5], 6:l[3]}
elif op=='W': self.label = {1:l[3], 2:l[2], 3:l[6], 4:l[1], 5:l[5], 6:l[4]}
elif op=='S': self.label = {1:l[5], 2:l[1], 3:l[3], 4:l[4], 5:l[6], 6:l[2]}
def yaw(self,op):
l = self.label
if op=='CW' : self.label = {1:l[1], 2:l[3], 3:l[5], 4:l[2], 5:l[4], 6:l[6]}
elif op=='CCW': self.label = {1:l[1], 2:l[4], 3:l[2], 4:l[5], 5:l[3], 6:l[6]}
def get_label(self,i=0):
if 1 <= i <= 6:
return self.label[i]
else:
return [self.label[x] for x in range(1,7)]
def cmp_dice(d0,d1):
dc = dice(d0.get_label())
d1_l = d1.get_label()
result=False
if set(dc.get_label())==set(d1_l):
for i in range(6):
for _ in range(4):
if dc.get_label()==d1_l:
result=True
break
dc.yaw('CW')
if dc.get_label()==d1_l:
break
if i < 4:
dc.roll('E')
if i >= 3:
dc.roll('N')
if i >= 4:
dc.roll('N')
return result
if __name__ == '__main__':
import itertools
n=int(eval(input()))
d_list = [dice(list(map(int, input().split()))) for _ in range(n)]
result='Yes'
for dx, dy in itertools.combinations(d_list,2):
if cmp_dice(dx,dy):
result='No'
break
print(result) | class dice:
def __init__(self,label):
self.label = {i+1: l for i,l in enumerate(label)}
def roll(self,op):
l = self.label
if op=='N': self.label = {1:l[2], 2:l[6], 3:l[3], 4:l[4], 5:l[1], 6:l[5]}
elif op=='E': self.label = {1:l[4], 2:l[2], 3:l[1], 4:l[6], 5:l[5], 6:l[3]}
elif op=='W': self.label = {1:l[3], 2:l[2], 3:l[6], 4:l[1], 5:l[5], 6:l[4]}
elif op=='S': self.label = {1:l[5], 2:l[1], 3:l[3], 4:l[4], 5:l[6], 6:l[2]}
def yaw(self,op):
l = self.label
if op=='CW' : self.label = {1:l[1], 2:l[3], 3:l[5], 4:l[2], 5:l[4], 6:l[6]}
elif op=='CCW': self.label = {1:l[1], 2:l[4], 3:l[2], 4:l[5], 5:l[3], 6:l[6]}
def get_label(self,i=0):
if 1 <= i <= 6:
return self.label[i]
else:
return [self.label[x] for x in range(1,7)]
def cmp_dice(d0,d1):
dc = dice(d0.get_label())
d1_l = d1.get_label()
result=False
if set(dc.get_label())==set(d1_l):
for i in range(6):
for _ in range(4):
if dc.get_label()==d1_l:
result=True
break
dc.yaw('CW')
if dc.get_label()==d1_l:
break
if i < 4:
dc.roll('E')
if i >= 3:
dc.roll('N')
if i >= 4:
dc.roll('N')
return result
if __name__ == '__main__':
import itertools
d_grp={}
for _ in range(int(eval(input()))):
d = dice(list(map(int, input().split())))
d_set = tuple(set(d.get_label()))
if d_set in d_grp:
d_grp[d_set].append(d)
else:
d_grp[d_set]=[d]
result='Yes'
for d_list in list(d_grp.values()):
for dx, dy in itertools.combinations(d_list,2):
if cmp_dice(dx,dy):
result='No'
break
print(result) | p02386 |
# coding=utf-8
from itertools import combinations
class Dice(object):
def __init__(self, list_):
self.label = list_
def getLabel(self, i):
return self.label[i - 1]
def _rotateS(self):
self.label = [self.getLabel(i) for i in [5, 1, 3, 4, 6, 2]]
def _rotateN(self):
self.label = [self.getLabel(i) for i in [2, 6, 3, 4, 1, 5]]
def _rotateE(self):
self.label = [self.getLabel(i) for i in [4, 2, 1, 6, 5, 3]]
def _rotateW(self):
self.label = [self.getLabel(i) for i in [3, 2, 6, 1, 5, 4]]
def _spinPos(self):
self.label = [self.getLabel(i) for i in [1, 4, 2, 5, 3, 6]]
def _spinNeg(self):
self.label = [self.getLabel(i) for i in [1, 3, 5, 2, 4, 6]]
def rotate(self, rotates):
for r in rotates:
if r == 'S':
self._rotateS()
elif r == 'N':
self._rotateN()
elif r == 'E':
self._rotateE()
elif r == 'W':
self._rotateW()
elif r == 'T':
self._spinPos()
elif r == 'B':
self._spinNeg()
def matchTopFront(self, top, front):
try:
iTop = self.label.index(top) + 1
topRot = {1: '', 2: 'N', 3: 'W', 4: 'E', 5: 'S', 6: 'SS'}
self.rotate(topRot[iTop])
iFront = self.label.index(front) + 1
frontRot = {2: '', 3: 'B', 4: 'T', 5: 'TT'}
self.rotate(frontRot[iFront])
return True
except KeyError:
return False
def copy(self):
return Dice(self.label[:])
def __eq__(self, other):
# ?????¢???????????¢?????\????????§6????????????
for rs in ['', 'S', 'N', 'E', 'W', 'SS']:
tmp = self.copy()
for r in rs:
tmp.rotate(r)
# ?????¢????????¢????????§??????
top = tmp.getLabel(1) == other.getLabel(1)
bottom = tmp.getLabel(6) == other.getLabel(6)
# ??´??¢?????????????????????????????????????????¢??????????????????????????´??????????????°??????
# top and bottom ???False??????????????????????????????????????§?????¢??°?????????
def _side():
result, n = False, 3
while not result and n > 0:
if tmp.label[1:5] == other.label[1:5]:
result = True
else:
tmp.rotate('T')
n -= 1
return result
if top and bottom and _side():
return True
else:
return False
def sub(face1, face2):
# ????????????????????????????????´?????????????????´???
if set(face1) != set(face2):
return False
# ???????????????????????´???
elif len(face1) == len(set(face1)):
d1 = Dice(face1)
d2 = Dice(face2)
if d2.matchTopFront(d1.getLabel(1), d1.getLabel(2)):
return True if d1.label == d2.label else False
else:
return False
# ???????????????????????´???
else:
d1 = Dice(face1)
d2 = Dice(face2)
return True if d1 == d2 else False
def main():
n = eval(input())
faces = [list(map(int, input().split())) for _ in range(n)]
for f1, f2 in combinations(faces, 2):
if f1 == f2 or sub(f1, f2) == True:
print('No')
break
else:
print('Yes')
if __name__ == '__main__':
main() | # coding=utf-8
from itertools import combinations
class Dice(object):
def __init__(self, list_):
self.label = list_
def getLabel(self, i):
return self.label[i - 1]
def _rotateS(self):
self.label = [self.getLabel(i) for i in [5, 1, 3, 4, 6, 2]]
def _rotateN(self):
self.label = [self.getLabel(i) for i in [2, 6, 3, 4, 1, 5]]
def _rotateE(self):
self.label = [self.getLabel(i) for i in [4, 2, 1, 6, 5, 3]]
def _rotateW(self):
self.label = [self.getLabel(i) for i in [3, 2, 6, 1, 5, 4]]
def _spinPos(self):
self.label = [self.getLabel(i) for i in [1, 4, 2, 5, 3, 6]]
def _spinNeg(self):
self.label = [self.getLabel(i) for i in [1, 3, 5, 2, 4, 6]]
def rotate(self, rotates):
for r in rotates:
if r == 'S':
self._rotateS()
elif r == 'N':
self._rotateN()
elif r == 'E':
self._rotateE()
elif r == 'W':
self._rotateW()
elif r == 'T':
self._spinPos()
elif r == 'B':
self._spinNeg()
def matchTopFront(self, top, front):
try:
iTop = self.label.index(top) + 1
topRot = {1: '', 2: 'N', 3: 'W', 4: 'E', 5: 'S', 6: 'SS'}
self.rotate(topRot[iTop])
iFront = self.label.index(front) + 1
frontRot = {2: '', 3: 'B', 4: 'T', 5: 'TT'}
self.rotate(frontRot[iFront])
return True
except KeyError:
return False
def copy(self):
return Dice(self.label[:])
def _equalWithOverlap(self, other):
# ?????¢???????????¢?????\????????§6????????????
for rs in ['', 'S', 'N', 'E', 'W', 'SS']:
tmp = self.copy()
for r in rs:
tmp.rotate(r)
# ?????¢????????¢????????§??????
top = tmp.getLabel(1) == other.getLabel(1)
bottom = tmp.getLabel(6) == other.getLabel(6)
# ??´??¢?????????????????????????????????????????¢??????????????????????????´??????????????°??????
# top and bottom ???False??????????????????????????????????????§?????¢??°?????????
def _side():
result, n = False, 3
while not result and n > 0:
if tmp.label[1:5] == other.label[1:5]:
result = True
else:
tmp.rotate('T')
n -= 1
return result
if top and bottom and _side():
return True
else:
return False
def __eq__(self, other):
# ????????????????????????????????´?????????????????´???
if set(self.label) != set(other.label):
return False
# ???????????????????????´???
elif len(self.label) == len(set(self.label)):
if other.matchTopFront(self.getLabel(1), self.getLabel(2)):
return True if self.label == other.label else False
else:
return False
# ???????????????????????´???
else:
return True if self._equalWithOverlap(other) else False
def main():
n = eval(input())
faces = [list(map(int, input().split())) for _ in range(n)]
for f1, f2 in combinations(faces, 2):
if f1 == f2 or Dice(f1) == Dice(f2):
print('No')
break
else:
print('Yes')
if __name__ == '__main__':
main() | p02386 |
from copy import deepcopy
from itertools import groupby
import queue
import sys
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
def isDiceSame(d1, d2):
if not isinstance(d1, Dice) or not isinstance(d2, Dice):
return False
if set(d1.labels[1:]) != set(d2.labels[1:]):
return False
else:
q = ["T", "S", "E", "N", "W", "B"]
memo = [[False] * 7 for i in range(7)]
memo[d1.pos["T"]][d1.pos["S"]] = ""
res = {}
for i in q[:3]:
if d1.labels[d1.pos[i]] != d2.labels[d2.pos[i]]:
break
else:
res[memo[d1.pos["T"]][d1.pos["S"]]] = d1
def bfs_isDiceSame():
que = queue.Queue()
que.put(d1)
while not que.empty():
d = que.get()
for i in q[1:5]:
d_next = Dice.rolled(d, i)
if memo[d_next.pos["T"]][d_next.pos["S"]] == False:
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
for j in q[:3]:
if d_next.labels[d_next.pos[j]] != d2.labels[d2.pos[j]]:
break
else:
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next
bfs_isDiceSame()
if len(res) == 0:
return False
else:
for k, v in list(res.items()):
for i in q[3:]:
if v.labels[v.pos[i]] != d2.labels[d2.pos[i]]:
break
else:
return True
else:
return False
n = int(sys.stdin.readline().rstrip())
d_nums = [tuple([int(x) for x in sys.stdin.readline().rstrip().split()]) for _ in range(n)]
if len(d_nums) != len(set(d_nums)):
print("No")
else:
d_nums.sort(key=lambda t: sum(t))
for (_, g) in groupby(d_nums, key=lambda t: sum(t)):
gl = list(g)
if len(gl) == 1:
continue
else:
for i in range(len(gl)):
for j in range(i+1, len(gl)):
if Dice.isDiceSame(Dice(gl[i]), Dice(gl[j])):
print("No")
sys.exit()
else:
print("Yes")
| from copy import deepcopy
from itertools import groupby
import queue
import sys
class Dice:
def __init__(self, nums):
self.labels = [None] + [ nums[i] for i in range(6) ]
self.pos = {
"E" : 3,
"W" : 4,
"S" : 2,
"N" : 5,
"T" : 1,
"B" : 6
}
def rolled(dice, queries):
d = deepcopy(dice)
for q in queries:
if q == "E":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["W"], d.pos["T"], d.pos["E"], d.pos["B"]
elif q == "W":
d.pos["T"], d.pos["E"], d.pos["B"], d.pos["W"] = d.pos["E"], d.pos["B"], d.pos["W"], d.pos["T"]
elif q == "S":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["N"], d.pos["T"], d.pos["S"], d.pos["B"]
elif q == "N":
d.pos["T"], d.pos["S"], d.pos["B"], d.pos["N"] = d.pos["S"], d.pos["B"], d.pos["N"], d.pos["T"]
else:
return d
def isDiceSame(d1, d2):
if not isinstance(d1, Dice) or not isinstance(d2, Dice):
return False
if set(d1.labels[1:]) != set(d2.labels[1:]):
return False
else:
q = ["T", "S", "E", "N", "W", "B"]
memo = [[False] * 7 for i in range(7)]
memo[d1.pos["T"]][d1.pos["S"]] = ""
res = {}
for i in q[:3]:
if d1.labels[d1.pos[i]] != d2.labels[d2.pos[i]]:
break
else:
res[memo[d1.pos["T"]][d1.pos["S"]]] = d1
def bfs_isDiceSame():
que = queue.Queue()
que.put(d1)
while not que.empty():
d = que.get()
for i in q[1:5]:
d_next = Dice.rolled(d, i)
if memo[d_next.pos["T"]][d_next.pos["S"]] == False:
que.put(d_next)
memo[d_next.pos["T"]][d_next.pos["S"]] = memo[d.pos["T"]][d.pos["S"]] + i
for j in q[:3]:
if d_next.labels[d_next.pos[j]] != d2.labels[d2.pos[j]]:
break
else:
res[memo[d_next.pos["T"]][d_next.pos["S"]]] = d_next
bfs_isDiceSame()
if len(res) == 0:
return False
else:
for k, v in list(res.items()):
for i in q[3:]:
if v.labels[v.pos[i]] != d2.labels[d2.pos[i]]:
break
else:
return True
else:
return False
n = int(sys.stdin.readline().rstrip())
d_nums = [tuple([int(x) for x in sys.stdin.readline().rstrip().split()]) for _ in range(n)]
if len(d_nums) != len(set(d_nums)):
print("No")
else:
def var(data):
ava = sum(data)/len(data)
return sum([(ava-data[i])**2 for i in range(len(data))])/len(data)
d_nums.sort(key=lambda t: sum(t))
d_nums.sort(key=lambda t: var(t))
for (_, g) in groupby(d_nums, key=lambda t: var(t)):
gl = list(g)
if len(gl) == 1:
continue
else:
for i in range(len(gl)):
for j in range(i+1, len(gl)):
if Dice.isDiceSame(Dice(gl[i]), Dice(gl[j])):
print("No")
sys.exit()
else:
print("Yes")
| p02386 |
def move(d, r):
if r == 'N':
return (d[1], d[5], d[2], d[3], d[0], d[4])
if r == 'E':
return (d[3], d[1], d[0], d[5], d[4], d[2])
if r == 'W':
return (d[2], d[1], d[5], d[0], d[4], d[3])
if r == 'S':
return (d[4], d[0], d[2], d[3], d[5], d[1])
return d
def gen_all(dice_1):
dice = {dice_1}
while True:
dice2 = {move(d,r) for d in dice for r in list("NEWS")}.union(dice)
if dice == dice2: break
dice = dice2
return dice
n = int(eval(input()))
count = 0
dice = [0 for i in range(n)]
for i in range(n):
dice[i] = tuple(map(int,input().split()))
for i in range(n):
for k in range(i):
if count == 1: break
if dice[i] in gen_all(dice[k]):
print("No")
count = 1
break
if count == 0:
print("Yes")
| n = int(eval(input()))
def rot(dice,rotation):
if rotation == "E":
dice = (dice[3],dice[1],dice[0],dice[5],dice[4],dice[2])
elif rotation == "W":
dice = (dice[2],dice[1],dice[5],dice[0],dice[4],dice[3])
elif rotation == "N":
dice = (dice[1],dice[5],dice[2],dice[3],dice[0],dice[4])
elif rotation == "S":
dice = (dice[4],dice[0],dice[2],dice[3],dice[5],dice[1])
return dice
def make_all_pattern(dice):
pattern = {dice}
pattern2 = pattern
while True:
pattern2 = pattern.union({rot(d,r) for d in pattern for r in list("NEWS")})
if pattern2 == pattern:
break
pattern = pattern2
return pattern
dice = [0 for i in range(n)]
for i in range(n):
dice[i] = tuple(map(int,input().split()))
pattern = set()
for i in range(n-1):
pattern = pattern.union(make_all_pattern(dice[i]))
if dice[i+1] in pattern:
print("No")
break
else:
print("Yes")
| p02386 |
# -*- coding: utf-8 -*-
"""
Created on Sun Feb 22 11:38:11 2015
@author: hirose
"""
# -*- coding: utf-8 -*-
from random import *
import copy
def command(hougaku, label):
temp = {}
temp = copy.deepcopy(label)
if(hougaku == 'E'):
label[1] = temp[4]
label[3] = temp[1]
label[4] = temp[6]
label[6] = temp[3]
elif(hougaku == 'W'):
label[1] = temp[3]
label[3] = temp[6]
label[4] = temp[1]
label[6] = temp[4]
elif(hougaku == 'N'):
label[1] = temp[2]
label[2] = temp[6]
label[5] = temp[1]
label[6] = temp[5]
elif(hougaku == 'S'):
label[1] = temp[5]
label[2] = temp[1]
label[5] = temp[6]
label[6] = temp[2]
if __name__=="__main__":
n = eval(input())
label = {}
for i in range(n):
label[i] = {}
temp = list(map(int, input().split()))
for j in range(6):
label[i][j+1] = temp[j]
#print label[i]
flag = 0
for i in range(n-1):
#print label[i]
for j in range(i+1,n):
count = 0
#print label[j]
while True:
if(label[i] == label[j]):
flag = 1
break
x = random()
if(x < 0.25):
command('E', label[j])
elif(x < 0.50):
command('W', label[j])
elif(x < 0.75):
command('N', label[j])
else:
command('S', label[j])
count += 1
if(count > 100):
break
if flag == 1:
break
if flag == 1:
break
if(flag == 0):
print('Yes')
else:
print('No') | # -*- coding: utf-8 -*-
"""
Created on Sun Feb 22 11:38:11 2015
@author: hirose
"""
# -*- coding: utf-8 -*-
from random import *
import copy
def command(hougaku, label):
temp = {}
temp = copy.deepcopy(label)
if(hougaku == 'E'):
label[1] = temp[4]
label[3] = temp[1]
label[4] = temp[6]
label[6] = temp[3]
elif(hougaku == 'W'):
label[1] = temp[3]
label[3] = temp[6]
label[4] = temp[1]
label[6] = temp[4]
elif(hougaku == 'N'):
label[1] = temp[2]
label[2] = temp[6]
label[5] = temp[1]
label[6] = temp[5]
elif(hougaku == 'S'):
label[1] = temp[5]
label[2] = temp[1]
label[5] = temp[6]
label[6] = temp[2]
if __name__=="__main__":
n = eval(input())
label = {}
for i in range(n):
label[i] = {}
temp = list(map(int, input().split()))
for j in range(6):
label[i][j+1] = temp[j]
#print label[i]
flag = 0
for i in range(n-1):
#print label[i]
for j in range(i+1,n):
count = 0
#print label[j]
while True:
if(label[i] == label[j]):
flag = 1
break
x = random()
if(x < 0.25):
command('E', label[j])
elif(x < 0.50):
command('W', label[j])
elif(x < 0.75):
command('N', label[j])
else:
command('S', label[j])
count += 1
if(count > 50):
break
if flag == 1:
break
if flag == 1:
break
if(flag == 0):
print('Yes')
else:
print('No') | p02386 |
import sys
import copy
n = int(eval(input()))
inp = [[i for i in input().split()] for i in range(n)]
a = copy.deepcopy(inp)
number = 3
count = 0
fuck = 0
for i in range(n-3):
number += 3+i
for i in range(number):
for i3 in range(n-1):
if i3 == 0:
kais = n-1
sika = kais
continue
kais += n-i3
if i >= sika and i < kais:
sika = kais
count = i3
for i2 in range(1,33):
if (i2<=20 and i2%5==0) or i2==22 or i2==27 or i2==28:
s = "N"
else:
s = "E"
if s == "E":
for i4 in range(len(inp)):
if i4 == count:
continue
b = []
b.append(a[i4][3])
b.append(a[i4][1])
b.append(a[i4][0])
b.append(a[i4][5])
b.append(a[i4][4])
b.append(a[i4][2])
for ks in range(6):
a[i4][ks] = b[ks]
for x in range(len(inp)):
if x == count:
continue
else:
fuck = 0
for x2 in range(6):
if inp[count][x2] == a[x][x2]:
fuck += 1
if fuck == 6:
print("No")
sys.exit()
elif s == "N":
for i4 in range(len(inp)):
if i4 == count:
continue
b = []
b.append(a[i4][1])
b.append(a[i4][5])
b.append(a[i4][2])
b.append(a[i4][3])
b.append(a[i4][0])
b.append(a[i4][4])
for ks in range(6):
a[i4][ks] = b[ks]
for x in range(len(inp)):
if x == count:
continue
else:
fuck = 0
for x2 in range(6):
if inp[count][x2] == a[x][x2]:
fuck += 1
if fuck == 6:
print("No")
sys.exit()
print("Yes") | import sys
import copy
n = int(eval(input()))
inp = [[i for i in input().split()] for i in range(n)]
a = copy.copy(inp)
number = 3
count = 0
for i in range(n-3):
number += 3+i
for i in range(number):
for i3 in range(n-1):
if i3 == 0:
kais = n-1
sika = kais
continue
kais += n-i3
if i >= sika and i < kais:
sika = kais
count = i3
for i2 in range(1,33):
if (i2<=20 and i2%5==0) or i2==22 or i2==27 or i2==28:
s = "N"
else:
s = "E"
if s == "E":
for i4 in range(len(inp)):
if i4 == count:
continue
b = []
b.append(a[i4][3])
b.append(a[i4][1])
b.append(a[i4][0])
b.append(a[i4][5])
b.append(a[i4][4])
b.append(a[i4][2])
a[i4][:] = b[:]
for x in range(len(inp)):
if x == count:
continue
else:
if inp[count][:] == a[x][:]:
print("No")
sys.exit()
elif s == "N":
for i4 in range(len(inp)):
if i4 == count:
continue
b = []
b.append(a[i4][1])
b.append(a[i4][5])
b.append(a[i4][2])
b.append(a[i4][3])
b.append(a[i4][0])
b.append(a[i4][4])
a[i4][:] = b[:]
for x in range(len(inp)):
if x == count:
continue
else:
if inp[count][:] == a[x][:]:
print("No")
sys.exit()
print("Yes") | p02386 |
class Dice:
def __init__(self,t,f,r,l,b,u):
self.a=[[t,f,r,l,b,u]]
self.direction={'S':(4,0,2,3,5,1),'N':(1,5,2,3,0,4),'E':(3,1,0,5,4,2),'W':(2,1,5,0,4,3),'Y':(0,3,1,4,2,5)}
def roll(self,d,n):
self.a[n]=[self.a[n][i] for i in self.direction[d]]
n=int(eval(input()))
for i in range(n):
if i==0:
t, f, r, l, b, u = list(map(int, input().split()))
dice = Dice(t, f, r, l, b, u)
else:
a = list(map(int, input().split()))
dice.a.append(a)
s='SSSWEEE'
w='YYYY'
try:
for u in range(n - 1):
for t in range(u + 1, n):
for j in s:
for r in w:
if dice.a[t] == dice.a[u]:
raise Exception
dice.roll(r, t)
dice.roll(j, t)
else:
print('Yes')
except Exception:
print('No')
| class Dice:
def __init__(self,t,f,r,l,b,u):
self.a=[[t,f,r,l,b,u]]
self.direction={'S':(4,0,2,3,5,1),'N':(1,5,2,3,0,4),'E':(3,1,0,5,4,2),'W':(2,1,5,0,4,3),'Y':(0,3,1,4,2,5)}
def roll(self,d,n):
self.a[n]=[self.a[n][i] for i in self.direction[d]]
n=int(eval(input()))
for i in range(n):
if i==0:
t, f, r, l, b, u = list(map(int, input().split()))
dice = Dice(t, f, r, l, b, u)
else:
a = list(map(int, input().split()))
dice.a.append(a)
s='SSSWEEE'
w='YYYY'
try:
for u in range(n - 1):
for t in range(u + 1, n):
for j in s:
for r in w:
if dice.a[t] == dice.a[u]:
raise Exception
dice.roll(r, t)
dice.roll(j, t)
else:
print('Yes')
except:
print('No')
| p02386 |
# Dice I - IV
class Dice:
def __init__(self, a1, a2, a3, a4, a5, a6):
# サイコロを縦横にたどると書いてある数字(index1は真上、index3は真下の数字)
self.face = [a1, a2, a3, a4, a5, a6]
self.v = [a5, a1, a2, a6] # 縦方向
self.h = [a4, a1, a3, a6] # 横方向
self.det = 1
# print(self.v, self.h)
# サイコロの上面の数字を表示
def top(self):
return self.v[1]
# サイコロを北方向に倒す
def north(self):
newV = [self.v[1], self.v[2], self.v[3], self.v[0]]
self.v = newV
self.h[1] = self.v[1]
self.h[3] = self.v[3]
return self.v, self.h
# サイコロを南方向に倒す
def south(self):
newV = [self.v[3], self.v[0], self.v[1], self.v[2]]
self.v = newV
self.h[1] = self.v[1]
self.h[3] = self.v[3]
return self.v, self.h
# サイコロを東方向に倒す
def east(self):
newH = [self.h[3], self.h[0], self.h[1], self.h[2]]
self.h = newH
self.v[1] = self.h[1]
self.v[3] = self.h[3]
return self.v, self.h
# サイコロを西方向に倒す
def west(self):
newH = [self.h[1], self.h[2], self.h[3], self.h[0]]
self.h = newH
self.v[1] = self.h[1]
self.v[3] = self.h[3]
return self.v, self.h
def searchFace(self, a):
b = 0
for i in range(6):
if a == self.face[i]:
# print('一致しました')
b = i + 1
return b
def detJudge(self, x): # a は 1 から 6 のどれか
y = int(7 / 2 - abs(x - 7 / 2))
if x != y:
self.det *= -1
# print(self.det)
return y
def rightSide(self, top, front):
r = 0
if top == 1 and front == 2:
r = 3
elif top == 2 and front == 3:
r = 1
elif top == 3 and front == 1:
r = 2
elif top == 1 and front == 3:
r = 5
elif top == 3 and front == 2:
r = 6
elif top == 2 and front == 1:
r = 4
if self.det == -1:
r = 7 - r
return r
diceAmount = int(eval(input()))
dices = []
for i in range(diceAmount):
d = [int(j) for j in input().rstrip().split()]
dice = Dice(d[0], d[1], d[2], d[3], d[4], d[5])
dices.append(dice)
# print(dices)
# Dice I
# command = list(input().rstrip())
# print(command)
# Dice II
# for i, a in enumerate(command):
# if a == 'N':
# dice1.north()
# elif a == 'S':
# dice1.south()
# elif a == 'E':
# dice1.east()
# elif a == 'W':
# dice1.west()
# print(dice1.top())
# questionAmount = int(input())
# for i in range(questionAmount):
# # Initialize det
# dice1.det = 1
# question = [int(i) for i in input().rstrip().split()]
# a = dice1.searchFace(question[0])
# b = dice1.searchFace(question[1])
# # print(a, b)
# top = dice1.detJudge(a)
# front = dice1.detJudge(b)
# # print(top, front)
# position = dice1.rightSide(top, front)
# answer = dice1.face[position - 1]
# print(answer)
# Dice III
# import random
# # print(dice1.face)
# # print(dice2.face)
# yesCount = 0
# i = 0
# while yesCount == 0 and i < 1000:
# j = random.randint(0, 3)
# if j == 0:
# dice2.north()
# elif j == 1:
# dice2.south()
# elif j == 2:
# dice2.east()
# elif j == 3:
# dice2.west()
# if (dice1.v == dice2.v and dice1.h == dice2.h) or ([dice1.v[2], dice1.v[1], dice1.v[0], dice1.v[3]] == [dice2.v[2], dice2.v[1], dice2.v[0], dice2.v[3]] and [dice1.h[2], dice1.h[1], dice1.h[0], dice1.h[3]] == [dice2.h[2], dice2.h[1], dice2.h[0], dice2.h[3]]):
# yesCount += 1
# # print('一致')
# i += 1
# if yesCount >= 1:
# print('Yes')
# else:
# print('No')
# Dice IV
import random
match = 0
diceCount = 1
while match == 0 and diceCount < diceAmount:
for d2 in range(1, diceAmount):
# print(d2)
i = 0
while match == 0 and i < 28:
j = random.randint(0, 3)
if j == 0:
dices[d2].north()
elif j == 1:
dices[d2].south()
elif j == 2:
dices[d2].east()
elif j == 3:
dices[d2].west()
for d1 in range(d2):
if (dices[d1].v == dices[d2].v and dices[d1].h == dices[d2].h):
match += 1
# print('一致')
i += 1
diceCount += 1
if match >= 1:
print('No')
else:
print('Yes')
| # Dice I - IV
class Dice:
def __init__(self, a1, a2, a3, a4, a5, a6):
# サイコロを縦横にたどると書いてある数字(index1は真上、index3は真下の数字)
self.face = [a1, a2, a3, a4, a5, a6]
self.v = [a5, a1, a2, a6] # 縦方向
self.h = [a4, a1, a3, a6] # 横方向
self.det = 1
# print(self.v, self.h)
# サイコロの上面の数字を表示
def top(self):
return self.v[1]
# サイコロを北方向に倒す
def north(self):
newV = [self.v[1], self.v[2], self.v[3], self.v[0]]
self.v = newV
self.h[1] = self.v[1]
self.h[3] = self.v[3]
return self.v, self.h
# サイコロを南方向に倒す
def south(self):
newV = [self.v[3], self.v[0], self.v[1], self.v[2]]
self.v = newV
self.h[1] = self.v[1]
self.h[3] = self.v[3]
return self.v, self.h
# サイコロを東方向に倒す
def east(self):
newH = [self.h[3], self.h[0], self.h[1], self.h[2]]
self.h = newH
self.v[1] = self.h[1]
self.v[3] = self.h[3]
return self.v, self.h
# サイコロを西方向に倒す
def west(self):
newH = [self.h[1], self.h[2], self.h[3], self.h[0]]
self.h = newH
self.v[1] = self.h[1]
self.v[3] = self.h[3]
return self.v, self.h
def searchFace(self, a):
b = 0
for i in range(6):
if a == self.face[i]:
# print('一致しました')
b = i + 1
return b
def detJudge(self, x): # a は 1 から 6 のどれか
y = int(7 / 2 - abs(x - 7 / 2))
if x != y:
self.det *= -1
# print(self.det)
return y
def rightSide(self, top, front):
r = 0
if top == 1 and front == 2:
r = 3
elif top == 2 and front == 3:
r = 1
elif top == 3 and front == 1:
r = 2
elif top == 1 and front == 3:
r = 5
elif top == 3 and front == 2:
r = 6
elif top == 2 and front == 1:
r = 4
if self.det == -1:
r = 7 - r
return r
diceAmount = int(eval(input()))
dices = []
for i in range(diceAmount):
d = [int(j) for j in input().rstrip().split()]
dice = Dice(d[0], d[1], d[2], d[3], d[4], d[5])
dices.append(dice)
# print(dices)
# Dice I
# command = list(input().rstrip())
# print(command)
# Dice II
# for i, a in enumerate(command):
# if a == 'N':
# dice1.north()
# elif a == 'S':
# dice1.south()
# elif a == 'E':
# dice1.east()
# elif a == 'W':
# dice1.west()
# print(dice1.top())
# questionAmount = int(input())
# for i in range(questionAmount):
# # Initialize det
# dice1.det = 1
# question = [int(i) for i in input().rstrip().split()]
# a = dice1.searchFace(question[0])
# b = dice1.searchFace(question[1])
# # print(a, b)
# top = dice1.detJudge(a)
# front = dice1.detJudge(b)
# # print(top, front)
# position = dice1.rightSide(top, front)
# answer = dice1.face[position - 1]
# print(answer)
# Dice III
# import random
# # print(dice1.face)
# # print(dice2.face)
# yesCount = 0
# i = 0
# while yesCount == 0 and i < 1000:
# j = random.randint(0, 3)
# if j == 0:
# dice2.north()
# elif j == 1:
# dice2.south()
# elif j == 2:
# dice2.east()
# elif j == 3:
# dice2.west()
# if (dice1.v == dice2.v and dice1.h == dice2.h) or ([dice1.v[2], dice1.v[1], dice1.v[0], dice1.v[3]] == [dice2.v[2], dice2.v[1], dice2.v[0], dice2.v[3]] and [dice1.h[2], dice1.h[1], dice1.h[0], dice1.h[3]] == [dice2.h[2], dice2.h[1], dice2.h[0], dice2.h[3]]):
# yesCount += 1
# # print('一致')
# i += 1
# if yesCount >= 1:
# print('Yes')
# else:
# print('No')
# Dice IV
import random
match = 0
diceCount = 1
while match == 0 and diceCount < diceAmount:
for d2 in range(1, diceAmount):
# print(d2)
i = 0
while match == 0 and i < 27:
j = random.randint(0, 3)
if j == 0:
dices[d2].north()
elif j == 1:
dices[d2].south()
elif j == 2:
dices[d2].east()
elif j == 3:
dices[d2].west()
for d1 in range(d2):
if (dices[d1].v == dices[d2].v and dices[d1].h == dices[d2].h):
match += 1
# print('一致')
i += 1
diceCount += 1
if match >= 1:
print('No')
else:
print('Yes')
| p02386 |
import sys
n, x=list(map(int, input().split()))
A=list(map(int, input().split()))
ans=0
for i in range(n-1):
while(A[i]+A[i+1]>x and A[i+1]>0):
A[i+1]=A[i+1]-1
ans=ans+1
while(A[i]+A[i+1]>x and A[i]>0):
A[i]=A[i]-1
ans=ans+1
if A[i]+A[i+1]>x:
print((0))
sys.exit()
print(ans)
| import sys
n, x=list(map(int, input().split()))
A=list(map(int, input().split()))
ans=0
for i in range(n-1):
next_sum=A[i]+A[i+1]
if next_sum>x:
if next_sum-x<=A[i+1]:
A[i+1]=A[i+1]-(next_sum-x)
ans=ans+(next_sum-x)
else:
ans=ans+A[i+1]
if next_sum-x-A[i+1]<=A[i]:
A[i]=A[i]-(next_sum-x-A[i+1])
ans=ans+(next_sum-x-A[i+1])
else:
print((0))
sys.exit()
A[i+1]=0
print(ans)
| p03864 |
N, x = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in range(0, N-1):
a = A[i]
b = A[i+1]
while a + b > x:
if b > 0:
b -= 1
ans += 1
elif a > 0:
a -= 1
ans += 1
A[i] = a
A[i+1] = b
print(ans) | N, x = list(map(int,input().split()))
A = list(map(int,input().split()))
ans = 0
for i in range(0, N-1):
while A[i] + A[i+1] > x:
tmp = A[i + 1] + A[i] - x
if A[i+1] > 0:
if tmp > A[i+1]:
tmp = A[i+1]
A[i+1] -= tmp
ans += tmp
elif A[i] > 0:
if tmp > A[i]:
tmp = A[i]
A[i] -= tmp
ans += tmp
print(ans) | p03864 |
n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
i=0
num=0
while i<n-1:
if a[i] + a[i+1] > x:
a[i+1]=a[i+1]-1
num=num+1
else:
i=i+1
print(num) | n,x=list(map(int,input().split()))
a=list(map(int,input().split()))
i=0
num=0
if a[0] > x:
ans=a[0]-x
a[0]=a[0]-ans
num=num+ans
while i<n-1:
if a[i] + a[i+1] > x:
ans=a[i] + a[i+1] - x
a[i+1]=a[i+1]-ans
num=num+ans
else:
i=i+1
print(num) | p03864 |
n,x = list(map(int,input().split()))
lis = list(map(int,input().split()))
cou = 0
if lis[0] > x:
cou += (lis[0] - x)
lis[0] -= (lis[0] -x)
for i in range(n-1):
if lis[i+1] + lis[i] > x:
cou += (lis[i+1] + lis[i] -x)
lis[i+1] -= (lis[i+1] + lis[i] -x)
print(cou) | n,k = list(map(int,input().split()))
lis = list(map(int,input().split()))
cou = lis[0]
ans = 0
if cou > k:
ans += cou-k
cou = k
for i in range(1,n):
if cou + lis[i] > k:
num = cou+lis[i]-k
cou = lis[i]-num
ans += num
else:
cou = lis[i]
print(ans) | p03864 |
import sys
n, x, *lst1 = list(map(int, sys.stdin.read().split()))
res1 = res2 = 0
lst2 = [0] + lst1
lst1.append(0)
for i in range(n):
tmpsum = lst2[i] + lst2[i + 1]
if tmpsum > x:
res1 += tmpsum - x
lst2[i + 1] -= tmpsum - x
for i in range(n, 0, -1):
tmpsum = lst1[i] + lst1[i - 1]
if tmpsum > x:
res2 += tmpsum - x
lst1[i - 1] -= tmpsum - x
print((min(res1, res2))) | import sys
n, x, *lst1 = list(map(int, sys.stdin.read().split()))
res1 = 0
lst2 = [0] + lst1
lst1.append(0)
for i in range(n):
tmpsum = lst2[i] + lst2[i + 1]
if tmpsum > x:
res1 += tmpsum - x
lst2[i + 1] -= tmpsum - x
print(res1) | p03864 |
N,M = list(map(int,input().split(" ")))
ar = list(map(int,input().split(" ")))
count = 0
for i in range(N):
if ar[i] > M:
count += ar[i] - M
ar[i] = M
for i in range(N-1):
if ar[i] + ar[i+1] > M:
while ar[i] + ar[i+1] > M:
if ar[i+1] == 0:
ar[i] -= 1
count += 1
else:
ar[i+1] -= 1
count += 1
print(count) | n,m = list(map(int,input().split(" ")))
ar = list(map(int,input().split(" ")))
a = sum(ar)
for i in range(n-1):
if ar[i] + ar[i+1] > m:
b = (ar[i] + ar[i+1]) - m
if ar[i+1] >= b:
ar[i+1] -= b
else:
ar[i] -= b - ar[i+1]
ar[i+1] = 0
print((a - sum(ar))) | p03864 |
N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
count = 0
for i in range(1,N):
diff = A[i-1]+A[i]-x
if diff > 0:
if A[i]>=diff:
A[i]-=diff
count += diff
else:
A[i] = 0
A[i-1] -= diff - A[i]
count += diff
print(count)
| N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
for i in range(1,N):
diff = A[i]+A[i-1]-x
if diff>0:
cnt += diff
A[i] -= min(A[i],diff)
print(cnt) | p03864 |
N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
for i in range(1,N):
diff = A[i]+A[i-1]-x
if diff>0:
cnt += diff
A[i] -= min(A[i],diff)
print(cnt) | N,x = list(map(int,input().split()))
A = list(map(int,input().split()))
cnt = 0
if A[0] > x:
cnt += (A[0]-x)
A[0] = x
for i in range(1,N):
if A[i]+A[i-1] > x:
cnt += (A[i]+A[i-1]-x)
A[i] -= (A[i]+A[i-1]-x)
print(cnt) | p03864 |
#! /usr/bin/env python3
N, x = list(map(int, input().split()))
C = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
while C[i]+C[i+1] > x:
cnt += 1
C[i+1] -= 1
print(cnt) | #! /usr/bin/env python3
N, x = list(map(int, input().split()))
C = list(map(int, input().split()))
cnt = 0
for i in range(N-1):
if C[i]+C[i+1] > x:
a = C[i]+C[i+1] - x
cnt += a
C[i] = min(C[i+1]-a, 0)
C[i+1] = max(C[i+1]-a, 0)
print(cnt) | p03864 |
n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
ans = 0
for i in range(n - 1):
while a[i] + a[i + 1] > x:
a[i + 1] -= 1
ans += 1
print(ans)
| n, x = list(map(int, input().split()))
a = list(map(int, input().split()))
cnt, a[0] = sum(a), min(a[0], x)
for i in range(1, n):
if a[i - 1] + a[i] > x:
a[i] = x - a[i - 1]
print((cnt - sum(a)))
| p03864 |
#!/usr/bin/env python3
# GRL_5_B: Tree - Height of a Tree
import bisect
class Edge:
__slots__ = ('v', 'w')
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class WeightedEdge(Edge):
__slots__ = ('v', 'w', 'weight')
def __init__(self, v, w, weight):
super().__init__(v, w)
self.weight = weight
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def heights(graph):
s = 0
edge_to = [None] * graph.v
dists = [[(0, i)] for i in range(graph.v)]
stack = [s]
while stack:
v = stack.pop()
for e in graph.adj(v):
if e != edge_to[v]:
w = e.other(v)
if edge_to[w] is None:
edge_to[w] = e
stack.append(v)
stack.append(w)
break
else:
for e in graph.adj(v):
if e != edge_to[v]:
w = e.other(v)
bisect.insort(dists[v], (dists[w][-1][0] + e.weight, w))
hs = [d[-1][0] for d in dists]
for i in range(graph.v):
j = i
weight = 0
while j != s:
e = edge_to[j]
weight += e.weight
w = e.other(j)
for vw, v in dists[w]:
if v != j and weight + vw > hs[i]:
hs[i] = weight + vw
j = w
return hs
def run():
n = int(eval(input()))
g = Graph(n)
for _ in range(n-1):
s, t, w = [int(i) for i in input().split()]
g.add(WeightedEdge(s, t, w))
for w in heights(g):
print(w)
if __name__ == '__main__':
run()
| #!/usr/bin/env python3
# GRL_5_B: Tree - Height of a Tree
import bisect
class Edge:
__slots__ = ('v', 'w')
def __init__(self, v, w):
self.v = v
self.w = w
def either(self):
return self.v
def other(self, v):
if v == self.v:
return self.w
else:
return self.v
class WeightedEdge(Edge):
__slots__ = ('v', 'w', 'weight')
def __init__(self, v, w, weight):
super().__init__(v, w)
self.weight = weight
class Graph:
def __init__(self, v):
self.v = v
self._edges = [[] for _ in range(v)]
def add(self, e):
self._edges[e.v].append(e)
self._edges[e.w].append(e)
def adj(self, v):
return self._edges[v]
def edges(self):
for es in self._edges:
for e in es:
yield e
def heights(graph):
def select_root():
leaves = [v for v in range(graph.v) if len(graph.adj(v)) < 2]
visited = [False] * graph.v
while len(leaves) > 2:
v, *leaves = leaves
if not visited[v]:
visited[v] = True
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
visited[w] = True
leaves.append(w)
return leaves.pop()
def dfs(s):
visited = [False] * graph.v
stack = [s]
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
stack.append(v)
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
edge_to[w] = e
stack.append(w)
else:
e = edge_to[v]
if e is not None:
w = e.other(v)
bisect.insort(dists[w], (dists[v][-1][0] + e.weight, v))
def _heights(s):
hs = [0] * graph.v
visited = [False] * graph.v
stack = [s]
while stack:
v = stack.pop()
if not visited[v]:
visited[v] = True
hs[v] = dists[v][-1][0]
for e in graph.adj(v):
w = e.other(v)
if not visited[w]:
for x, xv in reversed(dists[v]):
if xv != w:
bisect.insort(dists[w], (x + e.weight, v))
break
stack.append(w)
return hs
root = select_root()
edge_to = [None] * graph.v
dists = [[(0, i)] for i in range(graph.v)]
dfs(root)
return _heights(root)
def run():
n = int(eval(input()))
g = Graph(n)
for _ in range(n-1):
s, t, w = [int(i) for i in input().split()]
g.add(WeightedEdge(s, t, w))
for w in heights(g):
print(w)
if __name__ == '__main__':
run()
| p02372 |
print((-(-int(eval(input()))//111*111))) | print((0--int(eval(input()))//111*111)) | p03243 |
num = str(eval(input()))
a = []
x=[]
for i in str(num):
a.append(i)
if a[1] <= a[0] and a[2] < a[0]:
x.append(a[0])
x.append(a[0])
x.append(a[0])
print((''.join(str(i) for i in x)))
elif a[1] < a[0]:
x.append(a[0])
x.append(a[0])
x.append(a[0])
print((''.join(str(i) for i in x)))
elif a[0] == a[1] == a[2]:
x.append(a[0])
x.append(a[0])
x.append(a[0])
print((''.join(str(i) for i in x)))
else:
z = int (a[0]) +1
x.append(z)
x.append(z)
x.append(z)
print((''.join(str(i) for i in x)))
| a=[111,222,333,444,555,666,777,888,999]
i=0
n=int(eval(input()))
while a[i]<n:
i=i+1
print((a[i]))
| p03243 |
from math import ceil
print((ceil(int(eval(input())) / 111) * 111)) | # ABC111B - AtCoder Beginner Contest 111
def main():
N = int(eval(input()))
ans = (N + 110) // 111 * 111
print(ans)
if __name__ == "__main__":
main() | p03243 |
n = int(eval(input()))
if n % 111 ==0:
print(n)
exit()
while n % 111 != 0:
n += 1
if n % 111 == 0:
print(n)
exit() | import sys
n = int(eval(input()))
for i in range(n,1000):
a = i//100
b = (i - a*100)//10
c = i - a*100-b*10
if a == b == c:
print(i)
sys.exit() | p03243 |
n=int(eval(input()))
if n<=111:
print((111))
elif n<=222:
print((222))
elif n<=333:
print((333))
elif n<=444:
print((444))
elif n<=555:
print((555))
elif n<=666:
print((666))
elif n<=777:
print((777))
elif n<=888:
print((888))
else:
print((999)) | n=int(eval(input()))
num=str(n)[0]*3
if n<=int(num):
print(num)
else:
print((int(num)+111)) | p03243 |
n = int(eval(input()))
ok = False
for i in range(1,10):
if int(str(i)*3)>=n:
print((str(i)*3))
exit() | n = int(eval(input()))
for i in range(1, 10):
if n <= i * 111:
print((i * 111))
exit()
| p03243 |
A = int(eval(input()))
if A <=111:
print((111))
elif A<= 222:
print((222))
elif A <= 333:
print((333))
elif A <= 444:
print((444))
elif A <= 555:
print((555))
elif A <=666:
print((666))
elif A <= 777:
print((777))
elif A <= 888:
print((888))
elif A <=999:
print((999)) | A = int(eval(input()))
B = int(A / 111)
C = A % 111 == 0
if not C:
B = (B+1) * 111
print(B)
else:
B = B*111
print(B) | p03243 |
n = int(eval(input()))
c = 0
while (n+c)%111 != 0:
c += 1
print((n+c))
| n = int(eval(input()))
while True:
if len(set(str(n))) == 1:
print(n)
break
else:
n += 1 | p03243 |
def ok(n):
v=n%10
ret=True
while n>0:
ret&=n%10==v
n//=10
return ret
N=int(eval(input()))
while not(ok(N)):
N+=1
print(N) | n=int(eval(input()))
ans=0
while ans<n:
ans+=111
print(ans) | p03243 |
n = int(eval(input()))
lst = [111,222,333,444,555,666,777,888,999]
for i in lst:
if n <= i:
print(i)
break
| kaisai_lst = [111,222,333,444,555,666,777,888,999]
N = int(eval(input()))
for target_list in kaisai_lst:
if N <= target_list:
print(target_list)
break | p03243 |
import sys
import math
import itertools
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
d,m = divmod(N-1,111)
print(((d+1)*111))
if __name__ == "__main__":
main()
| import sys
def input():
return sys.stdin.readline().rstrip()
def main():
N = int(eval(input()))
d =(N-1)//111
print(((d+1)*111))
if __name__ == "__main__":
main()
| p03243 |
n=int(eval(input()))
if 100<=n<=111:
print((111))
elif 112<=n<=222:
print((222))
elif 223<=n<=333:
print((333))
elif 334<=n<=444:
print((444))
elif 445<=n<=555:
print((555))
elif 556<=n<=666:
print((666))
elif 667<=n<=777:
print((777))
elif 778<=n<=888:
print((888))
elif 889<=n<=999:
print((999)) | n=int(eval(input()))
L=[111,222,333,444,555,666,777,888,999]
for i in L:
if n<=i:
print(i)
break | p03243 |
print((-(-int(eval(input()))//111)*111)) | print((-int(eval(input()))//111*-111)) | p03243 |
import itertools
import math
import fractions
import functools
n = int(eval(input()))
if 100 <= n and n <= 111:
print((111))
if 112 <= n and n <= 222:
print((222))
if 223 <= n and n <= 333:
print((333))
if 334 <= n and n <= 444:
print((444))
if 445 <= n and n <= 555:
print((555))
if 556 <= n and n <= 666:
print((666))
if 667 <= n and n <= 777:
print((777))
if 778 <= n and n <= 888:
print((888))
if 889 <= n and n <= 999:
print((999))
| import itertools
import math
import fractions
import functools
n = int(eval(input()))
i = math.ceil(n / 111)
print((i*100+i*10+i)) | p03243 |
import itertools
import math
import fractions
import functools
n = int(eval(input()))
i = math.ceil(n / 111)
print((i*100+i*10+i)) | n = int(eval(input()))
if n % 111 == 0:
print(n)
quit()
print(((n//111+1)*111)) | p03243 |
import re
import sys
n = int(eval(input()))
for i in range(n, 1000):
if re.match('^([0-9])\\1+$', str(i)):
print(i)
sys.exit(0) | n = int(eval(input()))
for i in range(1, 10):
if n <= i*111:
print((i*111))
exit()
| p03243 |
N = int(eval(input()))
if N > 888:
print((999))
elif N > 777:
print((888))
elif N > 666:
print((777))
elif N > 555:
print((666))
elif N > 444:
print((555))
elif N > 333:
print((444))
elif N > 222:
print((333))
elif N > 111:
print((222))
else:
print((111)) | N = int(eval(input()))
ans = -(-N // 111) * 111
print(ans) | p03243 |
print((-(-int(eval(input()))//111)*111)) | print((0--int(eval(input()))//111*111)) | p03243 |
n = int(eval(input()))
while True:
if len(set(str(n))) == 1:
print(n)
break
n += 1
| n = int(eval(input()))
print((((n-1)//111+1)*111)) | p03243 |
N= int(eval(input()))
A = [111, 222, 333, 444, 555, 666, 777, 888, 999]
for i in A:
if N==i:
print(i)
break
elif N > i:
continue
elif N <= i:
print(i)
break
| n=int(eval(input()))
for i in range(n,1000):
if str(i)[0] == str(i)[1] == str(i)[2]:
print(i)
exit() | p03243 |
import sys
n = int(eval(input()))
for x in range(n, 1000):
s = str(x)
if s[0] == s[1] and s[1] == s[2]:
print(s)
sys.exit() | n=int(eval(input()))
print(((n+110)//111*111)) | p03243 |
n = int(eval(input()))
while n%111!=0:
n += 1
print(n)
| n = int(eval(input()))
while n % 111:
n += 1
print(n)
| p03243 |
N = int(eval(input()))
num_list = [111*i for i in range(1,10)]
nums = [num_list[i]-N for i in range(len(num_list)) if num_list[i]-N >= 0]
n = min(nums)
print((N+n)) | N = int(eval(input()))
print((((N-1)//111+1)*111))
| p03243 |
def ans():
N = int(eval(input()))
if(N%111 == 0):
print(N)
else:
print(((N//111+1)*111))
ans() | N = int(eval(input()))
if(N%111 == 0):
print(N)
else:
print(((N//111+1)*111)) | p03243 |
for i in range(int(eval(input())), 1000):
if(str(i)[0] == str(i)[1] and str(i)[1] == str(i)[2]):
print(i)
break | n = int(eval(input()))
for i in range(n,1000):
if i % 111 == 0:
print(i)
break | p03243 |
# A - Grouping 2
# ある学校に N 人の生徒がいる
# なるべく多く 3人 以上のグループにしたい！
# 3人以上のグループを 最大で x 個 作れるときの x の値を出力する
# 生徒数 N （整数） を入力
N = int(eval(input()))
# print(N)
# N を 3 で割った余りで 計算する
if N % 3 == 0:
# print('amari0')
answer = int(N / 3)
elif N % 3 == 1:
# print('amari1')
answer = int((N - 1) / 3)
else:
# print('amari2')
answer = int((N - 2) / 3)
# 結果の表示
print(answer)
| # A - Grouping 2
# ある学校に N 人の生徒がいる
# なるべく多く 3人 以上のグループにしたい！
# 3人以上のグループを 最大で x 個 作れるときの x の値を出力する
# 生徒数 N （整数） を入力
N = int(eval(input()))
# print(N)
# # N を 3 で割った余りで 計算する
# if 及び % を使わずに再現
answer = int(N / 3)
# 結果の表示
print(answer)
| p03423 |
n = int(eval(input()))
print((n // 3))
| print((int(eval(input())) // 3)) | p03423 |
n = int(eval(input()))
print((n // 3)) | n = int(eval(input()))
ans = n // 3
print(ans) | p03423 |
# author: kagemeka
# created: 2019-11-06 16:52:04(JST)
import sys
# import collections
# import math
# import string
# import bisect
# import re
# import itertools
# import statistics
def main():
n = int(sys.stdin.readline().rstrip())
ans = n // 3
print(ans)
if __name__ == "__main__":
# execute only if run as a script
main()
| import sys
n = int(sys.stdin.readline().rstrip())
def main():
return n // 3
if __name__ == '__main__':
ans = main()
print(ans) | p03423 |
# A - Grouping 2
n = int(eval(input()))
print((n // 3)) | # ABC 089: A – Grouping 2
n = int(eval(input()))
print((n // 3)) | p03423 |
print((int(eval(input()))//3)) | n = int(eval(input()))
print((n//3)) | p03423 |
N = int(eval(input()))
print((N//3)) | print((int(eval(input()))//3)) | p03423 |
a = int(eval(input()))
print((a // 3))
| print((int(eval(input())) // 3))
| p03423 |
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
INF = float("inf")
import sys
sys.setrecursionlimit(10000)
def solve(N):
return N // 3
def main():
N = int(eval(input()))
print((solve(N)))
if __name__ == '__main__':
main()
| #!/usr/bin/python3
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]
def inside(y, x, H, W):
return 0 <= y < H and 0 <= x < W
def main():
N = int(eval(input()))
print((N // 3))
if __name__ == '__main__':
main()
| p03423 |
print((int(eval(input())) // 3)) | N = int(eval(input()))
print((N // 3)) | p03423 |
import math
N = int(eval(input()))
N = math.ceil(N)
print((math.floor(N/3))) | print((int(int(eval(input()))/3))) | p03423 |
N = int(eval(input()))
print((N//3)) | N = eval(input ())
N = int (N)
print((N//3))
| p03423 |
# N人の生徒がいる
N = int( eval(input()) )
# 3人以上のグループの数を最大化
# つまり ３人のグループを最大数作る
# 最大数作るグループ数を x とする
x = int( N / 3 )
print( x ) | N = int( eval(input()))
x = N // 3
print(x) | p03423 |
import sys
def input():
return sys.stdin.buffer.readline()[:-1]
sys.setrecursionlimit(10**7)
class SCC():
def __init__(self, n):
self.n = n
self.adj = [[] for _ in range(self.n)]
self.inv = [[] for _ in range(self.n)]
self.post_order = []
self.visited = [False for _ in range(self.n)]
self.dag_v_to_num = [-1 for _ in range(self.n)]
self.dag_num_to_v = []
return
def add_edge(self, u, v):
self.adj[u].append(v)
self.inv[v].append(u)
return
def dfs1(self, i):
for j in self.adj[i]:
if not self.visited[j]:
self.visited[j] = True
self.dfs1(j)
self.post_order.append(i)
return
def dfs2(self, i, num):
self.dag_num_to_v[-1].append(i)
self.dag_v_to_num[i] = num
for j in self.inv[i]:
if not self.visited[j]:
self.visited[j] = True
self.dfs2(j, num)
return
def make_scc(self):
for i in range(self.n):
if not self.visited[i]:
self.visited[i] = True
self.dfs1(i)
self.visited = [False for _ in range(self.n)]
num = 0
for i in range(self.n-1, -1, -1):
if not self.visited[self.post_order[i]]:
self.visited[self.post_order[i]] = True
self.dag_num_to_v.append(list())
self.dfs2(self.post_order[i], num)
num += 1
return self.dag_v_to_num, self.dag_num_to_v
class TwoSAT(SCC):
"""
node 2*i : x_i
node 2*i+1: not x_i
"""
def __init__(self, n):
super().__init__(2*n)
return
def add_clause(self, i, f, j, g):
super().add_edge(2*i + (1^f), 2*j + g)
super().add_edge(2*j + (1^g), 2*i + f)
return
def satisfy(self):
topol, _ = super().make_scc()
res = []
for i in range(0, self.n, 2):
x, y = topol[i], topol[i+1]
if x == y:
return False, None
elif x > y:
res.append(False)
else:
res.append(True)
return True, res
n, d = list(map(int, input().split()))
ts = TwoSAT(n)
flags = [list(map(int, input().split())) for _ in range(n)]
for i in range(n):
for j in range(i+1, n):
for k in range(4):
f, g = k//2, k%2
if abs(flags[i][f] - flags[j][g]) < d:
ts.add_clause(i, f, j, g)
ok, ans = ts.satisfy()
if not ok:
print("No")
else:
print("Yes")
for f, b in zip(flags, ans):
print((f[1^b])) | import sys
def input():
return sys.stdin.buffer.readline()[:-1]
sys.setrecursionlimit(10**7)
class SCC():
def __init__(self, n):
self.n = n
self.adj = [[] for _ in range(self.n)]
self.inv = [[] for _ in range(self.n)]
self.post_order = []
self.visited = [False for _ in range(self.n)]
self.dag_v_to_num = [-1 for _ in range(self.n)]
self.dag_num_to_v = []
return
def add_edge(self, u, v):
self.adj[u].append(v)
self.inv[v].append(u)
return
def dfs1(self, i):
for j in self.adj[i]:
if not self.visited[j]:
self.visited[j] = True
self.dfs1(j)
self.post_order.append(i)
return
def dfs2(self, i, num):
self.dag_num_to_v[-1].append(i)
self.dag_v_to_num[i] = num
for j in self.inv[i]:
if not self.visited[j]:
self.visited[j] = True
self.dfs2(j, num)
return
def make_scc(self):
for i in range(self.n):
if not self.visited[i]:
self.visited[i] = True
self.dfs1(i)
self.visited = [False for _ in range(self.n)]
num = 0
for i in range(self.n-1, -1, -1):
if not self.visited[self.post_order[i]]:
self.visited[self.post_order[i]] = True
self.dag_num_to_v.append(list())
self.dfs2(self.post_order[i], num)
num += 1
return self.dag_v_to_num, self.dag_num_to_v
class TwoSAT(SCC):
"""
node 2*i : x_i
node 2*i+1: not x_i
"""
def __init__(self, n):
super().__init__(2*n)
return
def add_clause(self, i, f, j, g):
super().add_edge(2*i + (1^f), 2*j + g)
super().add_edge(2*j + (1^g), 2*i + f)
return
def satisfy(self):
topol, _ = super().make_scc()
res = []
for i in range(0, self.n, 2):
x, y = topol[i], topol[i+1]
if x == y:
return False, None
elif x > y:
res.append(False)
else:
res.append(True)
return True, res
n, d = map(int, input().split())
ts = TwoSAT(n)
flags = [list(map(int, input().split())) for _ in range(n)]
for i in range(n):
for j in range(i+1, n):
for k in range(4):
f, g = k//2, k%2
if abs(flags[i][f] - flags[j][g]) < d:
ts.add_clause(i, f, j, g)
ok, ans = ts.satisfy()
if not ok:
print("No")
else:
print("Yes")
print(*[f[1^b] for f, b in zip(flags, ans)], sep="\n")
| p02565 |
from itertools import product
import sys
input = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 6 + 100)
class StronglyConnectedComponets:
def __init__(self, n: int) -> None:
self.n = n
self.edges = [[] for _ in range(n)]
self.rev_edeges = [[] for _ in range(n)]
self.vs = []
self.order = [0] * n
self.used = [False] * n
def add_edge(self, from_v: int, to_v: int) -> None:
self.edges[from_v].append(to_v)
self.rev_edeges[to_v].append(from_v)
def dfs(self, v: int) -> None:
self.used[v] = True
for child in self.edges[v]:
if not self.used[child]:
self.dfs(child)
self.vs.append(v)
def rdfs(self, v: int, k: int) -> None:
self.used[v] = True
self.order[v] = k
for child in self.rev_edeges[v]:
if not self.used[child]:
self.rdfs(child, k)
def run(self) -> int:
self.used = [False] * self.n
self.vs.clear()
for v in range(self.n):
if not self.used[v]:
self.dfs(v)
self.used = [False] * self.n
k = 0
for v in reversed(self.vs):
if not self.used[v]:
self.rdfs(v, k)
k += 1
return k
class TwoSat(StronglyConnectedComponets):
def __init__(self, num_var: int) -> None:
super().__init__(2 * num_var + 1)
self.num_var = num_var
self.ans = []
def add_constraint(self, a: int, b: int) -> None:
super().add_edge(self._neg(a), self._pos(b))
super().add_edge(self._neg(b), self._pos(a))
def _pos(self, v: int) -> int:
return v if v > 0 else self.num_var - v
def _neg(self, v: int) -> int:
return self.num_var + v if v > 0 else -v
def run(self) -> bool:
super().run()
self.ans.clear()
for i in range(self.num_var):
if self.order[i + 1] == self.order[i + self.num_var + 1]:
return False
self.ans.append(self.order[i + 1] > self.order[i + self.num_var + 1])
return True
def main() -> None:
N, D = map(int, input().split())
flags = [tuple(int(x) for x in input().split()) for _ in range(N)]
# (X_i, Y_i) -> (i, -i) (i=1, ..., N) と考える
sat = TwoSat(N)
# 節 a, b の距離が D 以下の場合，
# a -> -b つまり -a or -b が成立しなければならない
for i, (x_i, y_i) in enumerate(flags, 1):
for j, (x_j, y_j) in enumerate(flags[i:], i+1):
if abs(x_i - x_j) < D:
sat.add_constraint(-i, -j)
if abs(y_i - x_j) < D:
sat.add_constraint(i, -j)
if abs(x_i - y_j) < D:
sat.add_constraint(-i, j)
if abs(y_i - y_j) < D:
sat.add_constraint(i, j)
if sat.run():
print("Yes")
print(*[x_i if sat.ans[i] else y_i for i, (x_i, y_i) in enumerate(flags)], sep="\n")
else:
print("No")
if __name__ == "__main__":
main()
| import sys
input = sys.stdin.buffer.readline
class StronglyConnectedComponets:
def __init__(self, n: int) -> None:
self.n = n
self.edges = [[] for _ in range(n)]
self.rev_edeges = [[] for _ in range(n)]
self.vs = []
self.order = [0] * n
self.used = [False] * n
def add_edge(self, from_v: int, to_v: int) -> None:
self.edges[from_v].append(to_v)
self.rev_edeges[to_v].append(from_v)
def dfs(self, v: int) -> None:
self.used[v] = True
for child in self.edges[v]:
if not self.used[child]:
self.dfs(child)
self.vs.append(v)
def rdfs(self, v: int, k: int) -> None:
self.used[v] = True
self.order[v] = k
for child in self.rev_edeges[v]:
if not self.used[child]:
self.rdfs(child, k)
def run(self) -> int:
self.used = [False] * self.n
self.vs.clear()
for v in range(self.n):
if not self.used[v]:
self.dfs(v)
self.used = [False] * self.n
k = 0
for v in reversed(self.vs):
if not self.used[v]:
self.rdfs(v, k)
k += 1
return k
class TwoSat(StronglyConnectedComponets):
def __init__(self, num_var: int) -> None:
super().__init__(2 * num_var + 1)
self.num_var = num_var
self.ans = []
def add_constraint(self, a: int, b: int) -> None:
super().add_edge(self._neg(a), self._pos(b))
super().add_edge(self._neg(b), self._pos(a))
def _pos(self, v: int) -> int:
return v if v > 0 else self.num_var - v
def _neg(self, v: int) -> int:
return self.num_var + v if v > 0 else -v
def run(self) -> bool:
super().run()
self.ans.clear()
for i in range(self.num_var):
if self.order[i + 1] == self.order[i + self.num_var + 1]:
return False
self.ans.append(self.order[i + 1] > self.order[i + self.num_var + 1])
return True
def main() -> None:
N, D = map(int, input().split())
flags = [tuple(int(x) for x in input().split()) for _ in range(N)]
# (X_i, Y_i) -> (i, -i) (i=1, ..., N) と考える
sat = TwoSat(N)
# 節 a, b の距離が D 以下の場合，
# a -> -b つまり -a or -b が成立しなければならない
for i, (x_i, y_i) in enumerate(flags, 1):
for j, (x_j, y_j) in enumerate(flags[i:], i+1):
if abs(x_i - x_j) < D:
sat.add_constraint(-i, -j)
if abs(y_i - x_j) < D:
sat.add_constraint(i, -j)
if abs(x_i - y_j) < D:
sat.add_constraint(-i, j)
if abs(y_i - y_j) < D:
sat.add_constraint(i, j)
if sat.run():
print("Yes")
print(*[x_i if sat.ans[i] else y_i for i, (x_i, y_i) in enumerate(flags)], sep="\n")
else:
print("No")
if __name__ == "__main__":
main()
| p02565 |
#-------最強ライブラリ2-SAT(Python)------
#最強ライブラリSCC(Python)が必要
class two_sat:
def __init__(s):
s._n = 0
s.scc = scc_graph(0)
def __init__(s, n):
s._n = n
s._answer = [False] * n
s.scc = scc_graph(2 * n)
# クローズを足す
# クローズってなに
def add_clause(s, i, f, j, g):
s.scc.add_edge(2 * i + (not f), 2 * j + (g))
s.scc.add_edge(2 * j + (not g), 2 * i + (f))
# 判定
# O(n + m)
def satisfiable(s):
id = s.scc.scc_ids()[1]
for i in range(s._n):
if id[2 * i] == id[2 * i + 1]: return False
s._answer[i] = id[2 * i] < id[2 * i + 1]
return True
# クローズを満たす割当を返す
# satisfiableがTrueとなった後に呼ばないと意味ない
# O(1だよね？）
def answer(s): return s._answer
#-------最強ライブラリここまで------
#-------最強ライブラリSCC(Python)ver25252------
import copy
import sys
sys.setrecursionlimit(1000000)
class csr:
# start 頂点iまでの頂点が、矢元として現れた回数
# elist 矢先のリストを矢元の昇順にしたもの
def __init__(s, n, edges):
s.start = [0] * (n + 1)
s.elist = [[] for _ in range(len(edges))]
for e in edges:
s.start[e[0] + 1] += 1
for i in range(1, n + 1):
s.start[i] += s.start[i - 1]
counter = copy.deepcopy(s.start)
for e in edges:
s.elist[counter[e[0]]] = e[1]
counter[e[0]] += 1
class scc_graph:
edges = []
# n 頂点数
def __init__(s, n): s._n = n
def num_vertices(s): return s._n
# 辺を追加 frm 矢元 to 矢先
# O(1)
def add_edge(s, frm, to): s.edges.append([frm, [to]])
# グループの個数と各頂点のグループidを返す
def scc_ids(s):
g = csr(s._n, s.edges)
now_ord = group_num = 0
visited = []
low = [0] * s._n
ord = [-1] * s._n
ids = [0] * s._n
# 再帰関数
def dfs(self, v, now_ord, group_num):
low[v] = ord[v] = now_ord
now_ord += 1
visited.append(v)
for i in range(g.start[v], g.start[v + 1]):
to = g.elist[i][0]
if ord[to] == -1:
now_ord, group_num = self(self, to, now_ord, group_num)
low[v] = min(low[v], low[to])
else:
low[v] = min(low[v], ord[to])
if low[v] == ord[v]:
while True:
u = visited.pop()
ord[u] = s._n
ids[u] = group_num
if u == v: break
group_num += 1
return now_ord, group_num
for i in range(s._n):
if ord[i] == -1: now_ord, group_num = dfs(dfs, i, now_ord, group_num)
for i in range(s._n):
ids[i] = group_num - 1 - ids[i]
return [group_num, ids]
# 強連結成分となっている頂点のリストのリスト トポロジカルソート済み
# O(n + m)
def scc(s):
ids = s.scc_ids()
group_num = ids[0]
counts = [0] * group_num
for x in ids[1]: counts[x] += 1
groups = [[] for _ in range(group_num)]
for i in range(s._n):
groups[ids[1][i]].append(i)
return groups
#-------最強ライブラリここまで------
def main():
input = sys.stdin.readline
N, D = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
ts = two_sat(N)
for i in range(N):
for j in range(i + 1, N):
xi, yi = XY[i]
xj, yj = XY[j]
# 距離がD未満の組み合わせに関して、
# 少なくとも一つは使用しない
# → 少なくとも一つは別の座標を使用する
# というルールを追加する
if (abs(xi - xj) < D):
ts.add_clause(i, False, j, False)
if (abs(xi - yj) < D):
ts.add_clause(i, False, j, True)
if (abs(yi - xj) < D):
ts.add_clause(i, True, j, False)
if (abs(yi - yj) < D):
ts.add_clause(i, True, j, True)
if not ts.satisfiable():
print("No")
exit()
print("Yes")
answer = ts.answer()
for i in range(N):
x, y = XY[i]
if answer[i]:
print(x)
else:
print(y)
main() | #-------最強ライブラリ2-SAT(Python)------
#最強ライブラリSCC(Python)が必要
class two_sat:
def __init__(s):
s._n = 0
s.scc = scc_graph(0)
def __init__(s, n):
s._n = n
s._answer = [False] * n
s.scc = scc_graph(2 * n)
# クローズを足す
# クローズってなに
def add_clause(s, i, f, j, g):
s.scc.add_edge(2 * i + (not f), 2 * j + (g))
s.scc.add_edge(2 * j + (not g), 2 * i + (f))
# 判定
# O(n + m)
def satisfiable(s):
id = s.scc.scc_ids()[1]
for i in range(s._n):
if id[2 * i] == id[2 * i + 1]: return False
s._answer[i] = id[2 * i] < id[2 * i + 1]
return True
# クローズを満たす割当を返す
# satisfiableがTrueとなった後に呼ばないと意味ない
# O(1だよね？）
def answer(s): return s._answer
#-------最強ライブラリここまで------
#-------最強ライブラリSCC(Python) ver83025------
import sys
sys.setrecursionlimit(1000000)
class scc_graph:
# n 頂点数
def __init__(s, n):
s._n = n
s.g = {}
def num_vertices(s): return s._n
# 辺を追加 frm 矢元 to 矢先
# O(1)
def add_edge(s, frm, to):
if frm in s.g: s.g[frm].append(to)
else: s.g[frm] = [to]
# グループの個数と各頂点のグループidを返す
def scc_ids(s):
now_ord = group_num = 0
visited = []
low = [0] * s._n
ord = [-1] * s._n
ids = [0] * s._n
# 再帰関数
def dfs(self, v, now_ord, group_num):
low[v] = ord[v] = now_ord
now_ord += 1
visited.append(v)
if v in s.g:
for to in s.g[v]:
if ord[to] == -1:
now_ord, group_num = self(self, to, now_ord, group_num)
low[v] = min(low[v], low[to])
else:
low[v] = min(low[v], ord[to])
if low[v] == ord[v]:
while True:
u = visited.pop()
ord[u] = s._n
ids[u] = group_num
if u == v: break
group_num += 1
return now_ord, group_num
for i in range(s._n):
if ord[i] == -1: now_ord, group_num = dfs(dfs, i, now_ord, group_num)
for i in range(s._n):
ids[i] = group_num - 1 - ids[i]
return group_num, ids
# 強連結成分となっている頂点のリストのリスト トポロジカルソート済み
# O(n + m)
def scc(s):
group_num, ids = s.scc_ids()
counts = [0] * group_num
for x in ids: counts[x] += 1
groups = [[] for _ in range(group_num)]
for i in range(s._n):
groups[ids[i]].append(i)
return groups
class edge:
def __init__(s, frm, to):
s.frm = frm
s.to = to
#-------最強ライブラリここまで------
def main():
input = sys.stdin.readline
N, D = list(map(int, input().split()))
XY = [list(map(int, input().split())) for _ in range(N)]
ts = two_sat(N)
for i in range(N):
for j in range(i + 1, N):
xi, yi = XY[i]
xj, yj = XY[j]
# 距離がD未満の組み合わせに関して、
# 少なくとも一つは使用しない
# → 少なくとも一つは別の座標を使用する
# というルールを追加する
if (abs(xi - xj) < D):
ts.add_clause(i, False, j, False)
if (abs(xi - yj) < D):
ts.add_clause(i, False, j, True)
if (abs(yi - xj) < D):
ts.add_clause(i, True, j, False)
if (abs(yi - yj) < D):
ts.add_clause(i, True, j, True)
if not ts.satisfiable():
print("No")
exit()
print("Yes")
answer = ts.answer()
for i in range(N):
x, y = XY[i]
if answer[i]:
print(x)
else:
print(y)
main()
| p02565 |
ans = float("inf")
def solve():
N = int(eval(input()))
for cake in range(100):
for donuts in range(100):
if cake*4 + donuts*7 == N:
print("Yes")
exit()
print("No")
if __name__ == "__main__":
solve()
| N = int(eval(input()))
for i in range(100):
for j in range(100):
if i * 4+j*7 == N:
print("Yes")
exit()
print("No")
| p03285 |
n = int(eval(input()))
money = [4*i + 7*j for i in range(n//4+1) for j in range(n//7+1)]
print(('Yes' if n in money else 'No'))
| n=int(eval(input()))
X=[]
for i in range(0,26):
for j in range(0,15):
if i*4+j*7<=100:
X.append(i*4+j*7)
print(('Yes' if n in X else 'No'))
| p03285 |
n = int(eval(input()))
flag = False
for i in range(int(n/4)+1):
for j in range(int(n/7)+1):
if i==0 and j==0:
continue
if n%((4*i)+(7*j)) == 0:
flag = True
break
if flag:
print("Yes")
else:
print("No") | N = int(eval(input()))
f = False
for i in range(N//4+1):
for j in range(N//7+1):
if i*4 + j*7 == N:
f = True
break
if f:
print("Yes")
else:
print("No") | p03285 |
# 入力
N = int(eval(input()))
# 処理
exist = False # 条件を満たす買い方が存在する
for i in range(100): # ケーキを買う個数
for j in range(100): # ドーナツを買う個数
s = i*4 + j*7 # 合計金額
if s == N:
exist = True # 条件を満たす買い方を見つけた
# 出力
if exist:
print("Yes")
else:
print("No") | N = int(eval(input()))
ans = "No"
for i in range(N):
rem = N-4*i
if rem >= 0 and rem % 7 == 0:
ans = "Yes"
print(ans)
| p03285 |
import sys
n = int(eval(input()))
for i in range(100):
for j in range(100):
if 7* i + 4 * j == n:
print("Yes")
sys.exit()
print("No")
| import sys
n = int(eval(input()))
i = 0
j = 0
while(i < 100):
j = 0
while(j < 100):
if 7* i + 4 * j == n:
print("Yes")
sys.exit()
j+= 1
i+= 1
print("No")
| p03285 |
import sys
n = int(eval(input()))
i = 0
j = 0
while(i < 100):
j = 0
while(j < 100):
if 7* i + 4 * j == n:
print("Yes")
sys.exit()
j+= 1
i+= 1
print("No")
| import sys
n = int(eval(input()))
for i in range(100):
for j in range(100):
if 7* i + 4 * j == n:
print("Yes")
sys.exit()
print("No")
| p03285 |
# Problem:
# Python Try
import sys
# from collections import defaultdict
# import heapq
# import copy
# from collections import deque
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solver(totalsum):
result = "No"
for j in range(0, 100//4+1, +1):
for k in range(0, 100//7+1, +1):
thiscase = j * 4 + k * 7
if thiscase == totalsum:
result = "Yes"
return result
if __name__ == "__main__":
print("{}".format(solver(II())))
| # Problem: https://atcoder.jp/contests/abc105/tasks/abc105_b
# Python 2nd Try
import sys
# from collections import defaultdict
# import heapq,copy
# from collections import deque
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def II(): return int(sys.stdin.readline())
def MI(): return map(int, sys.stdin.readline().split())
def MI1(): return map(int1, sys.stdin.readline().split())
def LI(): return list(map(int, sys.stdin.readline().split()))
def LLI(rows_number): return [LI() for _ in range(rows_number)]
def solver(TOTALSUM):
result = "No"
totalsum4max = TOTALSUM // 4 + 1
totalsum7max = TOTALSUM // 7 + 1
for j in range(0,totalsum4max):
for k in range(0,totalsum7max):
nowtotal = j * 4 + k * 7
if nowtotal == TOTALSUM :
result = "Yes"
return result
if __name__ == "__main__":
print("{}".format(solver(II())))
| p03285 |
n = int(eval(input()))
a = int(n / 7)
check = False
for i in range(a, -1, -1):
if (n - 7 * i) % 4 == 0:
check = True
if check:
print('Yes')
else:
print('No')
| n = int(eval(input()))
a = int(n / 7)
for i in range(a, -1, -1):
if (n - 7 * i) % 4 == 0:
print('Yes')
exit()
print('No')
| p03285 |
import sys
cand = set()
for i in range(0, 100+1, 4):
for j in range(0, 100-i+1, 7):
cand.add(i + j)
n = int(sys.stdin.readline().rstrip())
def main():
return 'Yes' if n in cand else 'No'
if __name__ == '__main__':
ans = main()
print(ans) | import sys
cand = set()
for i in range(0, 20+1, 4):
for j in range(0, 20-i+1, 7):
cand.add(i + j)
n = int(sys.stdin.readline().rstrip())
def main():
return 'Yes' if n in cand or n >= 21 else 'No'
if __name__ == '__main__':
ans = main()
print(ans) | p03285 |
n = int(eval(input()))
for i in range(n//4+1):
for j in range(n//7+1):
if 4 * i + 7 * j == n:
print('Yes')
exit()
print('No')
| n = int(eval(input()))
for i in range((n+3)//4+1):
if (n - i * 4 ) % 7 == 0:
print('Yes')
break
else:
print('No') | p03285 |
import math
N = int(eval(input()))
flag = False
for i in range(100):
for j in range(100):
if flag == True:
continue
#print(N - i * 7 - j * 4 )
if N - i * 7 - j * 4 == 0:
flag = True
if flag == True:
print('Yes')
else:
print('No')
| import math
N = int(eval(input()))
flag = False
for i in range(math.ceil(N/7)+1):
for j in range(math.ceil(N/4)+1):
if flag == True:
continue
#print(N - i * 7 - j * 4 )
if N - i * 7 - j * 4 == 0:
flag = True
if flag == True:
print('Yes')
else:
print('No')
| p03285 |
def actual(N):
oks = []
for idx, n in enumerate(list(range(4, 104, 4)), start=1):
for i in range(idx + 1):
satisfied_value = n + (3 * i)
if satisfied_value <= 100:
oks.append(satisfied_value)
oks = sorted(set(oks))
if N in oks:
return 'Yes'
return 'No'
N = int(eval(input()))
print((actual(N))) | def actual(N):
# 0 <= ケーキの数 <= N/4
# 0 <= ドーナツの数 <= N/7
# その範囲で (ケーキの数A, ドーナツの数B) を全探索する
# N = 4A + 7B を満たす組があれば Yes
n_max_cakes = N // 4
n_max_donuts = N // 7
for n_cakes in range(n_max_cakes + 1):
for n_donuts in range(n_max_donuts + 1):
price = (4 * n_cakes) + (7 * n_donuts)
if price == N:
return 'Yes'
return 'No'
N = int(eval(input()))
print((actual(N))) | p03285 |
n = int(eval(input()))
for i in range(100//4):
for j in range(100//7):
if n == i * 4 + j * 7:
print('Yes')
exit()
print('No') | n = int(eval(input()))
for i in range(100 // 4 + 1):
for j in range(100 // 7 + 1):
if n == i * 4 + j * 7:
print('Yes')
exit()
print('No')
| p03285 |
n=int(eval(input()))
for i in range(15):
if i*7>n:break
for j in range(26):
if i*7+j*4>n:break
if i*7+j*4==n:
print("Yes")
exit()
print("No") | n=int(eval(input()))
for i in range(15):
for j in range(26):
if i*7+j*4==n:
print("Yes")
exit()
print("No")
| p03285 |
def check(n):
if n == 0:
return True
if 0 > n:
return False
return any([check(n - 4), check(n - 7)])
def main():
if check(int(eval(input()))) is True:
print('Yes')
else:
print('No')
main()
| def main():
N = int(eval(input()))
flg = False
for n in range(N // 7 + 1):
if (N - 7 * n) % 4 == 0:
flg = True
break
if flg is True:
print('Yes')
else:
print('No')
main()
| p03285 |
import itertools
import sys
"""
1個4ドルのケーキX個と1個7ドルのドーナツY個
合計Nドルとなる買い方があるときはyes、逆はno
1<= N <=100
4 * X + 7 * Y = N
0<= X <= 25, 0<= Y <= 14
"""
N = int(eval(input()))
X = list(range(26))
Y = list(range(15))
for i, j in list(itertools.product(X, Y)):
if 4 * i + 7 * j == N:
print('Yes')
sys.exit()
print('No') | import itertools
import sys
N = int(eval(input()))
x = list(range(25 + 1))
y = list(range(14 + 1))
for i, j in itertools.product(x, y):
if i * 4 + j * 7 == N:
print('Yes')
sys.exit()
else:
print('No') | p03285 |
N=int(eval(input()))
ans=0
if N>3:
for i in range(N):
for j in range(N):
if 4*i+7*j==N:
ans=ans+1
final_answer=lambda x:'Yes' if ans!=0 else 'No'
print((final_answer(ans))) | n=int(eval(input()))
for i in range(25):
for j in range(14):
p=4*i+7*j
if p==n:
print("Yes")
exit()
print("No") | p03285 |
n=int(eval(input()))
for i in range(30):
for j in range(30):
if 4*i+7*j==n:
print('Yes')
exit()
print('No') | n=int(eval(input()))
for i in range(27):
for j in range(27):
if 4*i+7*j==n:
print('Yes')
exit()
print('No')
| p03285 |
N = int(eval(input()))
ans = 'No'
for cake in range(26):
for donatsu in range(15):
if 4*cake + 7*donatsu == N:
ans = 'Yes'
break
print(ans) | N = int(eval(input()))
for i7 in range(20):
for i4 in range(30):
if i7 * 7 + i4 * 4 == N:
print('Yes')
break
else:
continue
break
else:
print('No') | p03285 |
N = int(eval(input()))
flag = False
for i in range(26):
for j in range(15):
if 4 * i + 7 * j == N:
flag = True
if flag:
print("Yes")
else:
print("No")
| N = int(eval(input()))
flag = False
for i in range(N // 4 + 1):
for j in range(N // 7 + 1):
if 4 * i + 7 * j == N:
flag = True
if flag:
print("Yes")
else:
print("No")
| p03285 |
N = int(eval(input()))
result = "No"
for i in range(101):
for j in range(101):
total = 4 * i + 7 * j
if N == total :
result = "Yes"
break
print(result) | N = int(eval(input()))
cMax = round(100 / 4)
dMax = round(100 / 7)
result = "No"
for c in range(cMax):
for d in range(dMax):
if 4 * c + 7 * d == N:
result = "Yes"
break
print(result) | p03285 |
print(('Yes' if [4 * i + 7* j for i in range(101) for j in range(101)].count(int(eval(input()))) else 'No'))
| # coding: utf-8
import sys
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
N = ir()
time = N // 7
bl = False
for x in range(time+1):
y = N - x * 7
if y % 4 == 0:
bl = True; break
print(('Yes' if bl else 'No'))
| p03285 |
N = int(eval(input()))
for i in range(101):
if N - 7 * i < 0:
break
if (N - 7 * i) % 4 == 0:
print('Yes')
exit()
print('No') | if int(eval(input())) in [1, 2, 3, 5, 6, 9, 10, 13, 17]:
print('No')
else:
print('Yes') | p03285 |
N = int(eval(input()))
four = [4*i for i in range(26)]
seven = [7*i for i in range(15)]
exist = False
for f in four:
for s in seven:
sm = f+s
if sm == N:
exist = True
if exist:
print("Yes")
else:
print("No") | N = int(eval(input()))
four = [4*i for i in range(26)]
seven = [7*i for i in range(15)]
exist = False
for f in four:
for s in seven:
if f+s == N:
exist = True
if exist:
print("Yes")
else:
print("No")
| p03285 |
def judge(a):
global flg
if a % 4 == 0 or a % 7 == 0:
flg = 1
N = int(eval(input()))
flg = 0
judge(N)
while N > 7:
N -= 7
judge(N)
if flg == 1:
print("Yes")
else:
print("No")
| N = int(eval(input()))
f = 0
if N % 4 == 0 or N % 7 == 0:
f = 1
else:
while N > 4:
N -= 4
if N % 7 == 0:
f = 1
break
if f == 0:
print("No")
else:
print("Yes") | p03285 |
n = int(eval(input()))
string = "No"
for i in range(1, n+1):
for j in range(1, n+1):
if n % (4 * i + 7 * j) == 0:
string = "Yes"
break
elif n % (4 * i) == 0:
string = "Yes"
break
elif n % (7 * j) == 0:
string = "Yes"
break
print(string) | n = int(eval(input()))
string = "No"
for i in range(n+1):
for j in range(n+1):
if n == 4*i + 7*j :
string = "Yes"
break
print(string) | p03285 |
N = int(eval(input()))
for i in range(4, N + 1, 4):
d = N % i
if d == 0:
print("Yes")
exit()
if d % 7 == 0:
print("Yes")
exit()
for i in range(7, N + 1, 7):
d = N % i
if d == 0:
print("Yes")
exit()
if d % 4 == 0:
print("Yes")
exit()
print("No") | N = int(eval(input()))
for i in range(0, N + 1, 4):
for j in range(0, N + 1, 7):
if (i + j) == N:
print('Yes')
exit()
print("No")
| p03285 |
n = int(eval(input()))
can_buy = False
for i in range(101):
for j in range(101):
if 4 * i + 7 * j == n:
can_buy = True
break
print(("Yes" if can_buy else "No"))
| n = int(eval(input()))
yes_or_no = False
for i in range(15):
for j in range(26):
if 7 * i + 4 * j == n:
yes_or_no = True
break
print(("Yes" if yes_or_no else "No"))
| p03285 |
n = int(eval(input()))
yes_or_no = False
for i in range(15):
for j in range(26):
if 7 * i + 4 * j == n:
yes_or_no = True
break
print(("Yes" if yes_or_no else "No"))
| n = int(eval(input()))
count_of_donut = n // 7
result = False
for i in range(count_of_donut + 1):
rest = n - i * 7
if rest % 4 == 0:
result = True
break
print(("Yes" if result else "No"))
| p03285 |
n = int(eval(input()))
count = 0
for i in range(n+1):
for j in range(n+1):
if 4*i + 7*j == n:
count = 1
break
if count == 1:
print("Yes")
else:
print("No") | n = int(eval(input()))
for i in range(n//4+1):
for j in range(n//7+1):
if 4*i + 7*j == n:
print('Yes')
exit()
print('No') | p03285 |
def canbuy(n):
for i in range(int(100/7)):
tmp = n-7*i
if tmp==0 or (tmp>3 and tmp%4==0):
return 'Yes'
return 'No'
n=int(eval(input()))
print((canbuy(n))) | def canbuy(n):
if n%7==0 or n%4==0:
return 'Yes'
else:
if n<4:
return 'No'
else:
if canbuy(n-7)=='Yes':
return 'Yes'
else:
if canbuy(n-4)=='Yes':
return 'Yes'
else:
return 'No'
n=int(eval(input()))
print((canbuy(n))) | p03285 |
N = int(eval(input()))
for a in range(100 // 4 + 1):
for b in range(100 // 7 + 1):
if 4 * a + 7 * b == N:
print("Yes")
exit()
print("No") | N = int(eval(input()))
for c in range(N // 4 + 1):
for d in range(N // 7 + 1):
if 4 * c + 7 * d == N:
print("Yes")
exit()
print("No") | p03285 |
N=int(eval(input()))
if N in [1,2,3,5,6,9,10,13,17]:
print("No")
else:
print("Yes") | N=int(eval(input()))
for i in range(0,4):
if N-7*i>=0 and (N-7*i)%4==0:
print("Yes")
break
else:
print("No") | p03285 |
list47=set([0,4,7,8,11,12,14,15,16,18,19,20,21,22,23,24,25,26,27])
n=int(eval(input()))
print(('Yes' if (n%28) in list47 else 'No')) | n = int(eval(input()))
list47 = set([1,2,3,5,6,9,10,13,17])
print(('No' if n in list47 else 'Yes')) | p03285 |
N=int(eval(input()))
L = []
for j in range(25):
for i in range(15):
l = 4*j+7*i
L.append(l)
if N in L :
print("Yes")
else :
print("No")
| N = int(eval(input()))
L = []
counter = 0
for i in range(26) :
for j in range(16) :
l = 4*i + 7*j
L.append(l)
if N in L :
print("Yes")
else :
print("No")
| p03285 |
N = int(eval(input()))
ans = "No"
for i in range(26):
for j in range(16):
if(4*i+7*j == N):
ans = "Yes"
print(ans) | N = int(eval(input()))
ans = "No"
for i in range(26):
for j in range(16):
if(i*4+j*7 == N):
ans = "Yes"
print(ans) | p03285 |
n=int(eval(input()))
flag=False
for i in range(n//4+1):
for j in range(n//7+1):
sum=4*i+7*j
if sum==n:
flag=True
print(('Yes' if flag else'No'))
| import sys
n=int(eval(input()))
ans=False
if n%7==0 or n%4==0:
ans=True
print(('Yes' if ans else 'No'))
sys.exit()
for i in range(n//4+1):
total=0
for j in range(n//7+1):
total=4*i+7*j
if total==n:
ans=True
break
print(('Yes' if ans else 'No')) | p03285 |
from sys import stdin
N = int(stdin.readline().rstrip())
if N in [1, 2, 3, 5, 6, 9, 10, 13, 17]:
print('No')
else:
print('Yes')
| N = int(eval(input()))
if N in [1, 2, 3, 5, 6, 9, 10, 13, 17]:
print('No')
else:
print('Yes')
| p03285 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.