input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in a:
ans^=i
k=~ans
for i in range(n):
a[i]&=k
rank=0
# 掃き出し法
for i in range(59,-1,-1):
for j in range(rank,n):
if a[j]>>i&1:
break
if j==n:
continue
if j>rank:
# a[rank]のi番目のbitを1に... | n=int(eval(input()))
a=list(map(int,input().split()))
ans=0
for i in a:
ans^=i
k=~ans
for i in range(n):
a[i]&=k
rank=0
# 掃き出し法
for i in range(59,-1,-1):
for j in range(rank,n):
if a[j]>>i&1:
break
if j==n:
continue
if j>rank:
# a[rank]のi番目のbitを1に... | p02914 |
n = int(eval(input()))
A = list(map(int, input().split()))
not_important = 0
for a in A:
not_important ^= a
for i in range(n):
A[i] &= ~not_important
A.sort()
rank = 0
for digit in range(60, -1, -1):
check_bit = 1 << digit
for i in range(rank, n):
if A[i] & check_bit:
... | n = int(eval(input()))
A = list(map(int, input().split()))
not_important = 0
for a in A:
not_important ^= a
for i in range(n):
A[i] &= ~not_important
A.sort(reverse=True)
rank = 0
for digit in range(60, -1, -1):
check_bit = 1 << digit
for i in range(rank, n):
if A[i] & check_... | p02914 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=sys.stdin.readline
def resolve():
n=int(eval(input()))
A=list(map(int,input().split()))
xor=0
max_digit=0
for a in A:
xor^=a
max_digit=max(max_digit,a.bit_length())
# xorのうち、bitが立っていない部分だ... | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda: sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
A=list(map(int,input().split()))
xor=0
max_digit=0
for a in A:
xor^=a
max_digit=max(max_digit,a.bit_length())
# x... | p02914 |
#!/usr/bin/python3
import math
import sys
DEBUG = False
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, A):
allxor = 0
for a in A:
allxor ^= a
B = [0] * N
... | #!/usr/bin/python3
import math
import os
import sys
DEBUG = 'DEBUG' in os.environ
def inp():
return sys.stdin.readline().rstrip()
def dprint(*value, sep=' ', end='\n'):
if DEBUG:
print(*value, sep=sep, end=end)
def solve(N, A):
allxor = 0
for a in A:
allxor... | p02914 |
#input
N = int(eval(input()))
A = list(map(int, input().split()))
#output
# Python program to find
# maximum XOR subset
# Number of bits to
# represent int
INT_BITS = 64
# Function to return
# maximum XOR subset
# in set[]
def maxSubarrayXOR(set,n):
# Initialize index of
# chosen elements
inde... | #input
N = int(eval(input()))
A = list(map(int, input().split()))
#output
# Python program to find
# maximum XOR subset
# Number of bits to
# represent int
INT_BITS = 64
# Function to return
# maximum XOR subset
# in set[]
def maxSubarrayXOR(set,n):
# Initialize index of
# chosen elements
inde... | p02914 |
import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N):
... | import sys
import math
from collections import defaultdict
sys.setrecursionlimit(10**7)
def input():
return sys.stdin.readline()[:-1]
mod = 10**9 + 7
def I(): return int(eval(input()))
def II(): return list(map(int, input().split()))
def III(): return list(map(int, input().split()))
def Line(N):
... | p02914 |
def maxSubarrayXOR(lis, n, INT_BITS = 60):
idx = 0
for i in range(INT_BITS-1,-1,-1):
Mele = -1
bit_i = 1 << i
for j in range(idx, n):
if lis[j] & bit_i and lis[j] > Mele:
Midx, Mele = j, lis[j]
if Mele < 0: continue
lis[Midx], lis[idx]... | def maxSubarrayXOR(lis, n, INT_BITS = 60):
idx = 0
for i in range(INT_BITS-1,-1,-1):
Midx = -1
bit_i = 1 << i
for j in range(idx, n):
if lis[j] & bit_i:
Midx = j
break
else: continue
lis[Midx], lis[idx] = lis[idx], lis... | p02914 |
def gauss_jordan(A, is_extended):
"""掃き出し法でジョルダン標準形を求める"""
cnt_col = len(A[0])
cnt_row = len(A)
rank = 0
for col in range(cnt_col):
# 拡大係数行列の場合は最後の行は掃き出ししない
if is_extended and col == cnt_col - 1:
break
# ピボットを探す
pivot = -1
for row i... | def xor_gauss_jordan(A):
"""掃き出し法でジョルダン標準形を求める"""
cnt_row = len(A)
cnt_col = len(bin(max(A))[2::])
rank = 0
for col in range(cnt_col):
# ピボットを探す
pivot = -1
for row in range(rank, cnt_row):
if A[row] & 2**(cnt_col - col - 1):
pivot = row... | p02914 |
a,b=list(map(int,input().split()));print((a+b//2)) | x,y=list(map(int,input().split()))
print((x+y//2)) | p03219 |
import sys
input = sys.stdin.readline
x,y = list(map(int, input().split()))
print((x+y//2))
| x, y = list(map(int, input().split()))
print((x+y//2)) | p03219 |
def main():
from sys import stdin
r = stdin.readline()[:-1]
#r = stdin.readlines()
x, y = list(map(int, r.split()))
print((x+y//2))
if __name__ == '__main__':
main()
| def main():
x,y = list(map(int,input().split()))
print((x+y//2))
if __name__ == '__main__':
main()
| p03219 |
from sys import stderr, setrecursionlimit
from functools import reduce
from operator import add
setrecursionlimit(2147483647)
def f(): return [int(i) for i in input().split()]
def yes(n): print(("Yes" if n else "No"))
def debug(*x, sep=" ", end="\n"):
for item in x:
stderr.write(str(item))
... | print((sum([x[1]//2**x[0] for x in enumerate([int(i)for i in input().split()])]))) | p03219 |
X,Y= list(map(int,input().split()))
print((int(X+Y/2))) | # ABC 113
X,Y= list(map(int,input().split()))
print((int(X+Y/2))) | p03219 |
xy = list(map(int,input().split()))
# xのみを取り出す
x=xy[0]
# yのみを取り出す
y=xy[1]
print((int(x+y/2))) | a,b = list(map(int,input().split()))
print((int(a+(b/2)))) | p03219 |
x, y = list(map(int, input().split()))
print((int(x + y / 2))) | a,b=list(map(int,input().split()))
print((int(a+b/2))) | p03219 |
x, y = list(map(int, input().split()))
print((x + y // 2)) | def main():
X, Y = list(map(int, input().split()))
print((X + (Y >> 1)))
if __name__ == '__main__':
main()
| p03219 |
x,y=list(map(int,input().split()))
print((x+y//2)) | X, Y = list(map(int, input().split()))
print((X+Y//2)) | p03219 |
import itertools
import math
import fractions
import functools
import copy
x, y = list(map(int, input().split()))
print((x+y//2)) | def main():
# n = int(input())
x, y = list(map(int, input().split()))
# a = list(map(int, input().split()))
# s = input()
print((x+y//2))
if __name__ == '__main__':
main()
| p03219 |
x,y = list(map(int,input().split()))
print((x+y//2))
| a,b = list(map(int,input().split()))
print((a+b//2))
| p03219 |
X,Y = list(map(int,input().split()))
print((int(X+(Y/2)))) | x,y = list(map(int,input().split()))
print((x+y//2)) | p03219 |
a, b = list(map(int, input().split()))
print((a+b//2)) | print((eval(input().replace(" ","+")+"//2"))) | p03219 |
a,b=list(map(int,input().split()))
print((int(a+b/2)))
| a,b=list(map(int,input().split()))
print((a+b//2))
| p03219 |
N,M=list(map(int,input().split()))
a=[]
for i in range(N):
a.append(list(map(int,input().split())))
mod=998244353
B=[]
for i in range(M):
b=0
for j in range(N):
b+=a[j][i]*2**j
B.append(b)
base=[]
for i in range(M):
t=B[i]
for b in base:
t=min(t,t^b)
if t!... | N,M=list(map(int,input().split()));mod=998244353;base=[]
for i in range(N):
A=input().split();s=sum(int(A[j])*2**j for j in range(M))
for b in base:s=min(s,s^b)
if s!=0:base.append(s)
res=N-len(base);print(((pow(2,N+M-1,mod)-pow(2,M-1+res,mod))%mod)) | p03133 |
# from : https://atcoder.jp/contests/yahoo-procon2019-qual/submissions/4212377
H,W = list(map(int, input().split()))
A = [ [int(j) for j in input().split()] for _ in range(H)]
MOD = 998244353
piv = 0
# Gaussian Elimination to calculate rank of the matrix A
for w in range(W): # fix column,
r = -1
fo... | # from : https://atcoder.jp/contests/yahoo-procon2019-qual/submissions/4212377
H,W = list(map(int, input().split()))
A = [ [int(j) for j in input().split()] for _ in range(H)]
MOD = 998244353
piv = 0
# Gaussian Elimination to calculate rank of the matrix A
for w in range(W): # fix column,
r = -1
fo... | p03133 |
n=int(eval(input()))
l=list()
if n<=5:
print("Yes")
exit()
for i in range(2, n//2+1):
if n % i == 0:
if (n//i,i) not in l:
l.append((i,n//i))
flag=0
for i in l:
if i[0]<=9 and i[1]<=9:
flag=1
print("Yes")
exit()
if not flag:
print("No")
| n=int(eval(input()))
l=list()
flag=0
for i in range(1, 10):
if n % i == 0:
if (n//i)<=9:
flag+=1
if flag>0:
print("Yes")
else:
print("No")
| p02880 |
import sys
from pprint import pprint
def solve(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i*j:
print("Yes")
return
print("No")
if __name__ == '__main__':
n = int(sys.stdin.readline().strip())
solve(n) | import sys
N = int(sys.stdin.readline())
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
print("Yes")
sys.exit()
print("No") | p02880 |
N = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
print("Yes")
exit()
print("No") | N = int(eval(input()))
for x in range(1, 10):
for y in range(1, 10):
if x * y == N:
print("Yes")
exit()
print("No") | p02880 |
n = int(eval(input()))
nn_list = []
for i1 in range(1,10):
for i2 in range(1,10):
nn_list.append(i1 * i2)
if n in nn_list:
print('Yes')
else:
print('No')
| N = int(eval(input()))
kuku = []
for i in range (1,10):
for j in range(1,10):
kuku.append(i*j)
if N in kuku:
print('Yes')
else:
print('No') | p02880 |
a = int(eval(input()))
b = 0
for i in range(1, 10):
for j in range(1, 10):
if a == i*j:
b = 1
break
if b:
break
if b:
print("Yes")
else:
print("No") | N = int(eval(input()))
y = 0
for i in range(1, 10):
for j in range(1, 10):
if N == i*j:
y = 1
break
if y:
break
if y:
print("Yes")
else:
print("No") | p02880 |
import sys
#input = sys.stdin.readline
from collections import Counter
def main():
n = int(eval(input( )))
for i in range(1,10):
for j in range(1,10):
if n == i * j:
print('Yes')
exit()
else:
print('No')
if __name__ == '__main__':
... |
import sys
def main():
n = int(eval(input()))
for i1 in range(1, 10):
for i2 in range(1,10):
if n == i1 * i2:
print('Yes')
sys.exit()
else:
print('No')
if __name__ == '__main__':
main() | p02880 |
import sys
n = int(eval(input()))
for i in range(9):
if n/(i+1) in (1,2,3,4,5,6,7,8,9):
print('Yes')
sys.exit()
print('No') | n=int(eval(input()))
ans='No'
for i in range(1,10):
for j in range(1,10):
if i*j==n:
ans='Yes'
break
print(ans) | p02880 |
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
def input():
return sys.stdin.readline().strip()
def iinput():
return int(eval(input()))
def finput():
return float(eval(input()))
def tinput():
return input().split()
def rinput():
return list(map(... | possible = False
a = int(eval(input()))
for m in range(1, 10):
if a % m == 0 and a / m < 10:
print("Yes")
possible = True
break
if not possible:
print("No")
| p02880 |
n=int(eval(input()))
for i in range(10):
for j in range(10):
if i*j==n:
print('Yes')
exit()
print('No') | n=int(eval(input()))
for i in range(1,10):
for j in range(1,10):
if i*j==n:
print('Yes')
exit()
print('No') | p02880 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.st... | import sys
def I(): return int(sys.stdin.readline().rstrip())
N = I()
for i in range(1,10):
for j in range(1,10):
if N == i*j:
print('Yes')
exit()
print('No') | p02880 |
n=int(eval(input()))
for i in range(1,10):
for j in range(1,10):
if n==i*j:
print("Yes")
exit()
print("No")
| n=int(eval(input()))
for i in range(1,10):
for j in range(1,i+1):
if n==i*j:
print("Yes")
exit()
print("No") | p02880 |
n=int(eval(input()))
for i in range(1,10):
for j in range(1,i+1):
if n==i*j:
print("Yes")
exit()
print("No") | n=int(eval(input()))
d=set([i*j for i in range(1,10) for j in range(1,10)])
print(("Yes" if n in d else "No")) | p02880 |
N = int(eval(input()))
mylist = []
for i in range(1,10):
for j in range(1,10):
if (i*j) == N:
print("Yes")
exit(0)
print("No")
| N = int(eval(input()))
mylist = []
for i in range(1,10):
for j in range(1,10):
mylist.append(i*j)
if mylist.count(N):
print("Yes")
else:
print("No") | p02880 |
from sys import exit
N = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if N == i * j:
print('Yes')
exit()
print('No') | import sys
N = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if N == i * j:
print('Yes')
exit()
print('No') | p02880 |
n = int(eval(input()))
for i in range(9):
for j in range(9):
if (i+1)*(j+1) == n:
print('Yes')
exit()
print('No') | n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i*j == n:
print('Yes')
exit()
print('No') | p02880 |
def b81(N):
for i in range(1,10):
for j in range(1,10):
if i*j == N:
return "Yes"
return "No"
if __name__ == "__main__":
N = int(eval(input()))
print((b81(N))) | def b81_re(N):
if N>81:
return 'No'
for i in reversed(list(range(1,10))):
if N%i == 0:
if N/i<=9:
return 'Yes'
return 'No'
if __name__ == "__main__":
N = int(eval(input()))
print((b81_re(N))) | p02880 |
import sys
n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i * j == n:
print('Yes')
sys.exit(0)
print('No') | n = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if n == (i * j):
print('Yes')
exit(0)
print('No') | p02880 |
N = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i*j == N:
print('Yes')
break
else:
continue
break
else:
print('No')
| N = int(eval(input()))
for x in range(1, 10):
if N%x == 0:
y = N//x
if 1 <= y <= 9:
print('Yes')
break
else:
print('No')
| p02880 |
n = int(eval(input()))
def solve(n: int) -> str:
for l in range(1, 10):
for m in range(1, 10):
if n == l * m:
return "Yes"
return "No"
print((solve(n))) | n = int(eval(input()))
s = set([x for x in [x for x in range(1, 10)] if n % x == 0 and n / x < 10])
print(("No" if len(s) == 0 else "Yes")) | p02880 |
n=int(eval(input()))
for a in range(1,10):
for b in range(1,10):
if n==a*b:
print("Yes")
exit()
print("No")
| n=int(eval(input()))
for a in range(1,10):
for b in range(1,10):
if n==a*b:
print("Yes")
exit()
else:
print("No") | p02880 |
N = int(eval(input()))
answer = "No"
for i in range(1, 10):
for j in range(1, 10):
if(i * j == N):
answer = "Yes"
print(answer) | N = int(eval(input()))
answer = "No"
for i in range(1, 10):
should_break = False
for j in range(1, 10):
if(i * j == N):
answer = "Yes"
break
if(should_break):
break
print(answer) | p02880 |
N = int(eval(input()))
count =0
t = True
for i in range(1, 10):
if N % i == 0:
A = N/i
if 1 <= A <= 9:
while(t):
for a in range(1, 10):
if a != i :
if A % a == 0:
print('Yes')
... | a = int(eval(input()))
for i in range(1, 10):
for j in range(1, 10):
if i*j == a:
print("Yes")
exit()
print("No")
| p02880 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
s=set()
for i in range(1,10):
for j in range(1,10):
s.add(i*j)
n=int(eval(input()))
print(("Yes" if n in s else "No"))
resolve() | import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda:sys.stdin.readline().rstrip()
def resolve():
n=int(eval(input()))
for a in range(1,10):
q,r=divmod(n,a)
if(r==0 and 1<=q<=9):
print("Yes")
return
print("No")
resolve() | p02880 |
n = int(eval(input()))
flag = True
for i in range(10):
for j in range(10):
kuku = i * j
if n == kuku:
print("Yes")
flag = False
break
else:
continue # yes がみつからずにｊのループが終了したとき次のiループにcontinue
break # yesが見つかったらbreakでｊのループ抜け出す。そのあとこのbreak... | n = int(eval(input()))
flag = False
for i in range(1, 10):
for j in range(1, 10):
if i*j == n:
flag = True
if flag:
print("Yes")
else:
print("No")
| p02880 |
import sys
N=int(eval(input()))
for i in range(1,10):
if N/i==N//i and N/i<10:
print("Yes")
sys.exit()
print("No") | n=int(eval(input()))
a=[]
for i in range(1,10):
if n/i<10 and n%i==0:
a.append("Yes")
if "Yes" in a:
print("Yes")
else:
print("No") | p02880 |
n = int(eval(input()))
ans = 0
for i in range(1,10):
if n%i==0 and n//i<10:
ans = 1
print(('Yes' if ans else 'No')) | n=int(eval(input()))
a='No'
for i in range(1,10):
if n%i==0 and n//i<10: a='Yes'
print(a) | p02880 |
# import sys
#
# sys.setrecursionlimit(10 ** 7)
#
# input = sys.stdin.readline
# rstrip()
# int(input())
# map(int, input().split())
n = int(eval(input()))
st = {i * j for i in range(1, 10) for j in range(1, 10)}
if n in st:
print('Yes')
else:
print('No')
| def main():
N = int(eval(input()))
def check():
for i in range(1, 10):
for j in range(1, 10):
if i * j == N:
return True
return False
cond = check()
print(('Yes' if cond else 'No'))
if __name__ == '__main__':
main()... | p02880 |
N=int(eval(input()))
flag=False
for i in range(1,10):
m=N/i
if m.is_integer() and 1<=m<=9:
flag=True
break
print(("Yes" if flag else "No")) | N=int(eval(input()))
for i in range(1,10):
m=N/i
if m.is_integer() and 1<=m<=9:
print("Yes")
break
else:
print("No") | p02880 |
ans = "No"
N = int(eval(input()))
for i in range(1, 10):
temp = N / i
if 1 <= temp <= 9 and temp % 1 == 0:
ans = "Yes"
break
print(ans) | N = int(eval(input()))
ans = "No"
for i in range(1, 10):
if N // i < 10 and (N // i) * i == N:
ans = "Yes"
print(ans) | p02880 |
n = int(eval(input()))
lis = []
for i in range(10):
for j in range(i,10):
lis.append(i*j)
if n in lis: print('Yes')
else: print('No') | n = int(input())
qq = []
for i in range(1,10):
for j in range(1,10):
if i*j not in qq:
qq.append(i*j)
print('Yes') if n in qq else print('No')
| p02880 |
n = int(eval(input()))
for i in range(1,10):
if n % i == 0 and 1 <= n // i <= 9:
print('Yes')
exit()
print('No') | n = int(eval(input()))
for i in range(9,0, -1):
if n % i == 0 and 1 <= n // i <= 9:
print('Yes')
exit()
print('No') | p02880 |
import sys
import os
import math
ii = lambda: int(sys.stdin.buffer.readline().rstrip())
il = lambda: list(map(int, sys.stdin.buffer.readline().split()))
iln = lambda n: [int(sys.stdin.buffer.readline().rstrip()) for _ in range(n)]
iss = lambda: sys.stdin.buffer.readline().decode().rstrip()
isn = lambda n: [s... | N=int(eval(input()))
for i in range(1,10):
m=N/i
if m.is_integer() and 1<=m<=9:
print("Yes")
break
else:
print("No") | p02880 |
x = int(eval(input()))
count =0
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
count += 1
break
else:
pass
if count > 0:
print('Yes')
else:
print('No') | x = int(eval(input()))
count =0
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print('Yes')
exit()
else:
pass
print('No') | p02880 |
x = int(eval(input()))
count =0
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print('Yes')
exit()
else:
pass
print('No') | x = int(eval(input()))
for n in range(1, 10):
for k in range(1, 10):
a = n * k
if a == x:
print('Yes')
exit()
else:
pass
print('No') | p02880 |
n = int(eval(input()))
def judge(n):
for i in range(1, 10):
for j in range(1, 10):
if n == i * j:
print("Yes")
return
print("No")
judge(n) | n = int(eval(input()))
for i in range(1,10):
if n % i == 0 and n / i <= 9:
print("Yes")
quit()
print("No") | p02880 |
N=int(eval(input()))
cnt=0
if 1<=N<10:
cnt+=1
elif N>81:
pass
else:
for i in range(2,10):
if N%i==0 and (N/i)<10:
cnt+=1
if cnt==0:
print("No")
else:
print("Yes") | N = int(eval(input()))
cnt = 0
for i in range(1,10):
if N % i == 0 and 1<=N/i<=9:
cnt = 1
break
if cnt == 1:
print("Yes")
else:
print("No") | p02880 |
import sys
def solve():
sys.setrecursionlimit(2000)
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
for i in range(1, 10):
for j in range(1, 10):
if n == i * j:
print("Yes")
exit()
print("No")
if _... | import sys
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
for i in range(1, 10):
for j in range(1, 10):
if i * j == n:
print("Yes")
exit()
print("No")
if __name__ == '__main__':
solve... | p02880 |
n = int(eval(input()))
list = list(range(9, 1, -1))
ans = 0
flag = 1
if n > 1:
while n > 1:
for i in list:
if n % i == 0:
n = n / i
ans += 1
flag = 0
break
if flag == 1:
ans = 0
brea... | n = int(eval(input()))
list = list(range(9, 1, -1))
ans = 0
if n > 1:
while n > 1:
flag = 1
for i in list:
if n % i == 0:
n = n / i
ans += 1
flag = 0
break
if flag == 1:
ans = 0
... | p02880 |
num = int(eval(input()))
n = 1
while n < 10:
if num % n == 0 and num // n < 10:
print('Yes')
break
n += 1
if n == 10:
print('No') | c = int(eval(input()))
n = 0
for i in range(1,10):
if c /i < 10 and c %i ==0:
n += 1
ans = 'Yes' if n >= 1 else 'No'
print(ans) | p02880 |
N=int(eval(input()))
list=[]
for i in range(1,10):
for j in range(1,10):
list.append(i*j)
if N in list:
print("Yes")
else:
print("No") | n=int(eval(input()))
xlist=[]
for a in range(10):
for b in range(10):
xlist.append(a*b)
if n in xlist:
print("Yes")
else:
print("No") | p02880 |
N=int(eval(input()))
a=True
while a:
for i in range(1,10):
for j in range(1,10):
if N==i*j:
print("Yes")
break
if N==i*j:
break
if N==i*j:
break
print("No")
a=False | """
制約
1≦N≦100
Nは整数
"""
#入力
N = int(eval(input()))
#九九リストの作成
list = []
for i in range(1, 10):
for j in range(1, 10):
list.append(i * j) #リストに追加 list.append()
#リスト内にNが存在するかどうかで判別＆出力
if N in list:
print("Yes")
else:
print("No") | p02880 |
N = int(eval(input()))
a = [1, 2, 3, 4, 5, 6, 7, 8, 9]
b = [1, 2, 3, 4, 5, 6, 7, 8, 9]
C = [x * y for x in a for y in b ]
if N in C:
print("Yes")
else:
print("No") | N = int(eval(input()))
kuku = [x * y for x in range(1,10) for y in range(1, 10)]
if N in kuku:
print("Yes")
else:
print("No") | p02880 |
import sys
N = int(eval(input()))
a = 1
b = 1
if (N == 1)or(N == 81):
print("Yes")
elif (2 <= N <= 80):
for a in range(1,10):
for b in range(1,10):
if N == a*b:
print("Yes")
sys.exit()
else:
None
print("No")
s... | N = int(eval(input()))
ans = 0
for a in range(1,10):
for b in range(1,10):
if N == a*b:
ans = 1
if (ans == 1):
print("Yes")
else:
print("No") | p02880 |
N = int(eval(input()))
l = []
for i in range(1, 10):
for j in range(1, 10):
l.append(i * j)
if N in l:
print('Yes')
else:
print('No') | x = int(eval(input()))
ans = "No"
for i in range(1,10):
for j in range(1,10):
if i*j==x:
ans = "Yes"
print(ans) | p02880 |
n = int(eval(input()))
t = 0
for i in range(9):
for j in range(9):
if n == (i + 1) * (j + 1):
t += 1
if t == 0:
print('No')
else:
print('Yes') | n = int(eval(input()))
for i in range(1, 10):
if n % i == 0:
if n / i <= 9:
print("Yes")
break
else:
print("No")
| p02880 |
import sys
a = 1
for i in sys.stdin:
x = i.strip()
if x == "0":
break;
print(("Case {}: {}".format(a,x)))
a += 1 | import sys
a = 1
for i in sys.stdin:
x = i.strip()
if x == "0":
break;
print(("Case {0}: {1}".format(a,x)))
a += 1 | p02396 |
import sys
i = 1
for line in sys.stdin.readlines():
x = line.strip()
if x != "0":
print(("Case {}: {}".format(i, x)))
i += 1 | import sys
i = 1
for line in sys.stdin.readlines():
x = line.strip()
if x == "0":
break
print(("Case {}: {}".format(i, x)))
i += 1 | p02396 |
i = 1
while True :
x = eval(input())
if (x == 0) :
exit()
print("Case %d: %d" % (i, x))
i += 1 | i = 1
while True :
x = eval(input())
if (x == 0) :
break
print("Case %d: %d" % (i, x))
i += 1 | p02396 |
i=1
while True:
n=eval(input())
if int(n)==0:break
print(f'Case {i}: {n}')
i+=1 | a=[]
b=a.append
while True:
n=eval(input())
if int(n)==0:break
b(n)
for i in range(len(a)):print(f'Case {i+1}: {a[i]}') | p02396 |
i=1
while 1:
a=eval(input())
if int(a)==0:break
print(f'Case {i}: {a}')
i+=1 | import sys
i=1
for a in sys.stdin:
if a=='0\n':break
print(f'Case {i}: {a.strip()}')
i+=1 | p02396 |
for i,a in enumerate(iter(input,'0')):print(f'Case {i+1}: {a}')
| import sys
i=1
for i,a in enumerate(sys.stdin):
a=a.strip()
if a=='0':break
print(f'Case {i+1}: {a}')
| p02396 |
for i,a in enumerate(iter(input,'0'),1):print(f'Case {i}: {a}')
| import sys
for i,a in enumerate(sys.stdin,1):
if a=='0\n':break
print(f'Case {i}: {a}',end='')
| p02396 |
i = 1
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
print("Case %d: %d" %(i, n))
i += 1 | cases = []
n = 1
while n != 0:
n = int(input())
if n == 0:
continue
cases.append(n)
for i in range(len(cases)):
print("Case %d: %d" %(i + 1, cases[i])) | p02396 |
s = 1
while True:
t = int(eval(input()))
if t == 0:
break
else:
print(("Case "+str(s)+": "+str(t)))
s += 1 | t = 1
while True:
s = int(eval(input()))
if (s == 0):
break
else:
print(("Case " + str(t) + ": " + str(s)))
t += 1 | p02396 |
t = 1
while True:
s = int(eval(input()))
if (s == 0):
break
else:
print(("Case " + str(t) + ": " + str(s)))
t += 1 | i = 1
while True:
t = int(eval(input()))
if (t == 0):
break
else:
print(("Case" + " " + str(i) + ":" + " " +str(t)))
i = i + 1 | p02396 |
i = 1
while 1:
x = int(eval(input()))
if x == 0:
break
print(("Case " + str(i) + ": " + str(x)))
i = i + 1 | i = 0
while True:
x = int(eval(input()))
if x == 0: break
i = i + 1
print(("Case " + str(i) + ": " + str(x))) | p02396 |
# coding: utf-8
import sys
line = sys.stdin
count = 1
for x in line :
if int(x) == 0 :
break
print('Case {0}: {1}'.format(count, x), end='')
count += 1
| # coding: utf-8
import sys
line = sys.stdin
count = 1
for x in line :
if int(x) == 0 :
break
print(('Case {0}: {1}'.format(count, x.strip())))
count += 1 | p02396 |
i = 1
while 1:
x = eval(input())
if x == 0:
break
print('Case %d: %d' % (i, x))
i+=1 | i = 1
while 1:
x = input()
if x == '0':
break
print('Case %d: %s' % (i, x))
i+=1 | p02396 |
i = 0
while 1:
i+=1
v = input()
if v == '0':
break
print(('Case {}: {}'.format(i,v))) | i = 0
while 1:
i+=1
x = input()
if x == '0':
break
print(('Case {}: {}'.format(i,x))) | p02396 |
i=1
while True:
n=eval(input())
if not n:
break
print("Case %d: %d"%(i,n))
i+=1 | import sys
def resolve():
idx = 1
for num_s in sys.stdin:
num = int(num_s)
if num == 0:
break
print(("Case {}: {}".format(idx, int(num))))
idx += 1
resolve()
| p02396 |
import sys
i=1
while True:
x = int( sys.stdin.readline() )
if 0 != x:
print(( "Case {}: {}".format( i, x) ))
else:
break
i += 1 | import sys
i=1
while True:
x = sys.stdin.readline().rstrip()
if "0" != x:
print(( "Case {}: {}".format( i, x) ))
else:
break
i += 1 | p02396 |
c = 0
while True:
x = int(eval(input())); c += 1
if x == 0: break
print(("Case {}: {}".format(c, x)))
| # -*- coding: utf-8 -*-
c = 1
while True:
n = int(eval(input()))
if n == 0:
break
print(('Case {0}: {1}'.format(c, n)))
c += 1
| p02396 |
array = []
while True:
x= eval(input())
if x == 0:
break
array.append(x)
for i in range(len(array)):
print(('Case {0}: {1}'.format(i+1,array[i]))) | import sys
a = sys.stdin
i = 1
for line in a:
if(int(line) == 0):
break
print('Case {0}: {1}'.format(i,line),end="")
i += 1
| p02396 |
count = 0
for i in range(10000):
a = eval(input())
a = int(a)
if a > 0:
count += 1
print(('Case '+str(count)+': '+str(a)))
else:
break
| count=1
while True:
a=eval(input())
a=int(a)
if a==0:
break
print(("Case {}: {}".format(count,a)))
count+=1
| p02396 |
if __name__ == '__main__':
current_no = 1
while True:
input_num = int(eval(input()))
if input_num != 0:
print(('Case {0}: {1}'.format(current_no, input_num)))
current_no += 1
else:
break | # -*- coding: utf-8 -*-
"""
http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ITP1_3_B&lang=jp
"""
import sys
from sys import stdin
input = stdin.readline
def main(args):
count = 1
while True:
x = int(eval(input()))
if x == 0:
break
print(('Case {}: ... | p02396 |
c = 0
while True:
a = eval(input())
if a == 0: break
c += 1
print('Case %d: %d' %(c, a)) | c = 0
while True:
a = int(input())
if a == 0: break
c += 1
print('Case %d: %d' %(c, a)) | p02396 |
i = 1
a = eval(input())
while a != 0:
print("Case %d: %d" % (i, a))
i = i + 1
a = eval(input()) | lis = []
a = int(input())
while a != 0:
lis.append(a)
a = int(input())
for i,v in enumerate(lis):
print("Case %d: %d" % (i+1,v)) | p02396 |
lis = []
a = int(input())
while a != 0:
lis.append(a)
a = int(input())
for i,v in enumerate(lis):
print("Case %d: %d" % (i+1,v)) | lis = []
a = input()
while a != '0':
lis.append(a)
a = input()
for i,v in enumerate(lis):
print("Case %d: %s" % (i+1,v)) | p02396 |
A, B, C, X, Y = list(map(int,input().split()))
ans = 0
mi = min(X, Y); ma = max(X, Y); sub = abs(X - Y);
price = 0
if max(X, Y) == X:
price = A
else:
price = B
part_c = 2*C*mi + sub*price
print((min(2*C*ma, part_c, A*X + B*Y))) | A, B, C, X, Y = list(map(int,input().split()))
s1 = 2*C*max(X, Y)
s2 = 2*C*min(X, Y) + A*(X-min(X,Y)) + B*(Y-min(X,Y))
s3 = A*X + B*Y
print((min(s1,s2,s3))) | p03373 |
A, B, C, X, Y = list(map(int, input().split()))
min_sum = 9999999999
for a in range(X+1):
for b in range(Y+1):
c = max(X-a, Y-b)
sum = A*a + B*b + 2*C*c
if sum<min_sum:
min_sum=sum
print(min_sum) | a, b, c, x, y = list(map(int, input().split()))
res = a*x + b*y # 条件を満たす買い方のうちABピザの枚数(*2)を全探索する。ABピザを一切買わない場合を一旦答えにする（これを大きい値にして、for ループを0からにしてもよい）
for i in range(1, max(x, y)+1): # 全部ABピザでまかなう時は x,yの内多い方分買うことになる
ab = i*2 # ABピザを買う枚数奇数枚買うことはないので2倍
cand = ab*c + a*max(0, x-i) + b*max(0, y-i) # i枚分はABピザになるの... | p03373 |
import sys
A, B, C, X, Y = list(map(int, sys.stdin.readline().split(" ")))
ans = float("inf")
for i in range(X + 1):
for j in range(Y + 1):
k = max(X - i, Y - j) * 2
ans = min(ans, A * i + B * j + C * k)
print(ans) | import sys
A, B, C, X, Y = list(map(int, sys.stdin.readline().split(" ")))
ans = float("inf")
for i in range(max(X, Y) * 2 + 1):
j = X - i // 2
if j < 0:
j = 0
k = Y - i // 2
if k < 0:
k = 0
ans = min(ans, C * i + A * j + B * k)
print(ans) | p03373 |
# Problem: https://atcoder.jp/contests/arc096/tasks/arc096_a
# Python 1st Try
import sys
# from collections import defaultdict
# import heapq,copy
import pprint as pp
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def L... | # Problem: https://atcoder.jp/contests/arc096/tasks/arc096_a
# Python 2nd Try
import sys
# from collections import defaultdict
# import heapq,copy
import pprint as pp
# from collections import deque
def II(): return int(sys.stdin.readline())
def MI(): return list(map(int, sys.stdin.readline().split()))
def L... | p03373 |
a,b,c,x,y = list(map(int, input().split()))
ans = float('inf')
for i in range(10**5+1):
tmp = i*2*c + max(0, x-i)*a + max(0, y-i)*b
if ans > tmp:
ans = tmp
print(ans) | a,b,c,x,y = list(map(int, input().split()))
ans = float('inf')
for i in range(10**5+1):
tmp = i*2*c
if i>=x:
pass
else:
tmp += (x-i)*a
if i>=y:
pass
else:
tmp += (y-i)*b
if ans > tmp:
ans = tmp
print(ans) | p03373 |
A, B, C, X, Y = list(map(int, input().split()))
m_value = float('inf')
for ab in range(max(X, Y) + 1):
ab2 = 2 * ab
a = X - ab
b = Y - ab
tmp = C * ab2
if a > 0:
tmp += a * A
if b > 0:
tmp += b * B
m_value = min(m_value, tmp)
print(m_value)
| """
O(1)解法
以下の3つから一番安いものを選ぶ
1. AピザとBピザをそれぞれ必要数買う場合
2. ABピザを必要数の多いピザ基準で買う場合 (2倍必要になることを忘れない)
3. ABピザを必要数の少ないピザ基準で買い、不足分のピザを買い足す場合
"""
A, B, C, X, Y = list(map(int, input().split()))
# Aピザの必要数がBピザよりも多くなるように、必要数と値段を入れ替える
if X < Y:
X, Y = Y, X
A, B = B, A
p1 = A * X + B * Y # 1
p2 = 2 * C * X # 2
p3... | p03373 |
a,b,c,x,y=[int(i) for i in input().split()]
sum_list=[]
max_c=max(x,y)
#ABセットをi組頼む
for i in range(max_c+1):
#Cのみ
if i>=x and i>=y:
sum=2*c*i
#CとA
elif i<x and i>=y:
sum=2*c*i+a*(x-i)
#CとB
elif i>=x and i<y:
sum=2*c*i+b*(y-i)
... | a,b,c,x,y=list(map(int, input().split()))
#cのセット数の最大値
cmax=max(x,y)
t_list=[]
#cを何セット買うか
for i in range(cmax+1):
if x>=i and y>=i:
total=c*2*i+a*(x-i)+b*(y-i)
elif x>=i and y<i:
total=c*2*i+a*(x-i)
else:
total=c*2*i+b*(y-i)
t_list.a... | p03373 |
a,b,c,x,y = list(map(int, input().split()))
ans = float('inf')
for i in range(10**5+1):
minNum = c * i * 2 + max(0,x-i) * a + max(0,y-i) * b
if ans > minNum:
ans = minNum
print(ans) |
A, B, C, X, Y = list(map(int, input().split()))
ans = A*X+B*Y
# ABセットを全探索する
for i in range(1, max(X,Y)+1):
# i > Xであれば買い増す必要はないが、i < Xであれば必要なため
ans = min(ans, A*max(X-i,0)+B*max(Y-i,0)+C*2*i)
print(ans) | p03373 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.