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... | #
# 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... | 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):
... | 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):
... | 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]}
... | 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]}
... | 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(se... | # 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(se... | 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" : ... | 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" : ... | 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
... | 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],di... | 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]
... | # -*- 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]
... | 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 = k... | 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
... | 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... | 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... | 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)
... | # 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)
... | 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)... | 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]
... | 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
p... | 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
e... | 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
el... | 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 tmp... | 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] -= ... | 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 - su... | 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 += d... | 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... | #!/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... | 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... | 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... | 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... | 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)
... | # 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... | 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")... | #!/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_cac... | 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.d... | 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.d... | 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)]
... | 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 = [Fal... | 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 * ... | #-------最強ライブラリ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 * ... | 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()... | # 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(in... | 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:
... | 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:
ret... | 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_cake... | 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... | 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:
... | 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:
prin... | 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:
... | 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 els... | 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.