input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
# Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
vs_x = set()
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
EP.ap... | # Acceptance of input
import sys
file_input = sys.stdin
n = file_input.readline()
EP = []
l = -1000000001
u = 1000000001
vs_x = set()
h_num = 0
for line in file_input:
x1, y1, x2, y2 = (list(map(int, line.split())))
if x1 == x2:
if y1 < y2:
EP.append((y1, l, x1))
... | p02304 |
# -*- coding: utf-8 -*-
import collections
import math
import bisect
class Vector2(collections.namedtuple("Vector2", ["x", "y"])):
def __add__(self, other):
return Vector2(self.x + other.x, self.y + other.y)
def __sub__(self, other):
return Vector2(self.x - other.x, self.y - o... | # -*- coding: utf-8 -*-
import collections
import math
import bisect
class Vector2(collections.namedtuple("Vector2", ["x", "y"])):
def __add__(self, other):
return Vector2(self.x + other.x, self.y + other.y)
def __sub__(self, other):
return Vector2(self.x - other.x, self.y - o... | p02304 |
import bisect
def memoize(f):
cache = {}
def func(x):
if x not in cache:
ret = cache[x] = f(x)
return ret
return cache[x]
return func
@memoize
def get_bisect(y):
return bisect.bisect(vy, (y, float('-inf')))
n = int(eval(input()))
vx, v... | import bisect
n = int(eval(input()))
vx, vy = [], []
for _ in range(n):
x1, y1, x2, y2 = list(map(int, input().split()))
if x1 == x2:
if y1 > y2:
y1, y2 = y2, y1
vx.append((x1, y1, y2))
else:
if x1 > x2:
x1, x2 = x2, x1
vy.append((y1, x1,... | p02304 |
import bisect
n = int(eval(input()))
vx, vy = [], []
for _ in range(n):
x1, y1, x2, y2 = list(map(int, input().split()))
if x1 == x2:
if y1 > y2:
y1, y2 = y2, y1
vx.append((x1, y1, y2))
else:
if x1 > x2:
x1, x2 = x2, x1
vy.append((y1, x1,... | import bisect
def memoize(f):
cache = {}
def func(x):
if x not in cache:
cache[x] = f(x)
return cache[x]
return func
@memoize
def get_bisect(y):
return bisect.bisect(vy, (y,))
n = int(eval(input()))
vx, vy = [], []
for _ in range(n):
x1, y1, ... | p02304 |
#線分交差問題
import bisect
class BIT:
def __init__(self, n):
self.tree = [0]*(n+1)
self.n = n
def add(self, i, v):
while i <= self.n:
self.tree[i] += v
i += i & -i
def _sum(self, i):
ret = 0
while i:
... | #線分交差問題
import bisect
class BIT:
def __init__(self, n):
self.tree = [0]*(n+1)
self.n = n
def add(self, i, v):
while i <= self.n:
self.tree[i] += v
i += i & -i
def _sum(self, i):
ret = 0
while i:
... | p02304 |
from itertools import cycle
INITIALIZE = 32
while True:
input_count = int(eval(input()))
if input_count == 0:
break
get_list = [int(item) for item in input().split(" ")]
ohajiki = INITIALIZE
output = []
for get_count in cycle(get_list):
ohajiki -= (ohaji... | from itertools import cycle
INITIALIZE = 32
while True:
input_count = int(eval(input()))
if input_count == 0:
break
get_list = [int(item) for item in input().split(" ")]
ohajiki = INITIALIZE
output = []
for get_count in cycle(get_list):
ohajiki -= (ohaji... | p00164 |
def check(y,x):
if 0<=y<=h-1 and 0<=x<=w-1:
return True
return False
h,w=list(map(int,input().split()))
g=[list(map(int,input().split())) for _ in range(h)]
pos=[-1]*(h*w)
for i in range(h):
for j in range(w):
pos[g[i][j]-1]=[i,j]
dy=(1,0,-1,0)
dx=(0,1,0,-1)
stop=[set() for _... | def check(y,x):
if 0<=y<=h-1 and 0<=x<=w-1:
return True
return False
h,w=list(map(int,input().split()))
g=[list(map(int,input().split())) for _ in range(h)]
pos=[-1]*(h*w)
for i in range(h):
for j in range(w):
pos[g[i][j]-1]=[i,j]
dy=(1,0,-1,0)
dx=(0,1,0,-1)
stop=[set() for _... | p00557 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
N = I()
D = [0]*N
for i in range(N):
a,b = MI()
if a == b:
D[i] = 1
for i in range(N-2):
if D[i] == D[i+1] == D[i+2] == 1:
print('Yes')
... | p02547 |
def judge():
cnt = 0 # 今何連続でゾロ目が出ているか記録しておきます
for _ in range(N):
x, y = list(map(int, input().split()))
if x == y:
# ゾロ目ストリークが1増えました
cnt += 1
else:
# ゾロ目ストリークが切れました
cnt = 0
if cnt == 3:
# 3連続になった瞬間、return... | def judge():
count = 0
for _ in range(x):
d1, d2 = list(map(int, input().split()))
if d1 == d2:
count += 1
else:
count = 0
if count == 3:
return True
return False
x = int(eval(input()))
if judge():
print("Ye... | p02547 |
import sys
readline = sys.stdin.readline
MOD = 10 ** 9 + 7
INF = float('INF')
sys.setrecursionlimit(10 ** 5)
def main():
N = int(readline())
cur = 0
cnt = 0
for _ in range(N):
x, y = list(map(int, readline().split()))
if x == y:
cur += 1
else:
... | def judge():
cnt = 0 # 今何連続でゾロ目が出ているか記録しておきます
for _ in range(N):
x, y = list(map(int, input().split()))
if x == y:
# ゾロ目ストリークが1増えました
cnt += 1
else:
# ゾロ目ストリークが切れました
cnt = 0
if cnt == 3:
# 3連続になった瞬間、return... | p02547 |
n=int(eval(input()))
idx=[]
c=0
for i in range(n):
x,y=list(map(int,input().split()))
if x==y:
idx.append(c)
c+=1
if len(idx)<3:
print('No')
else:
flag=False
#print(idx)
for i in range(len(idx)-2):
if idx[i]-idx[i+1]==-1 and idx[i+1]-idx[i+2]==-1:
flag=True
break
dd={Fals... | import sys
def main():
n=int(eval(input()))
idx=[]
c=0
for i in range(n):
x,y=list(map(int,input().split()))
if x==y:
idx.append(c)
c+=1
if len(idx)<3:
print('No')
else:
flag=False
#print(idx)
for i in range(len(idx)-2):
if idx[i]-idx[i+1]==-1 and idx[i+1]-idx[i+2]==-... | p02547 |
n = int(eval(input()))
D = [[*list(map(int, input().split()))] for _ in range(n)]
# print(n)
# print(D)
# ans = True
c = 0
for x, y in D:
# print(x,y)
if x==y:c+=1
else: c = 0
if c == 3: break
print(('Yes' if c>=3 else 'No'))
| n = int(eval(input()))
c = 0
for _ in range(n):
x, y = list(map(int, input().split()))
if x == y:c += 1
else: c = 0
if c == 3: break
print(('No' if c < 3 else 'Yes'))
| p02547 |
import sys, os, math, bisect, itertools, collections, heapq, queue, copy, array
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
sys.setrecursionlimit(10000000)
ii = lambda: int(sys.stdin.buffer.readline().rstrip(... | import sys
import os
import math
import bisect
import itertools
import collections
import heapq
import queue
import array
# 時々使う
# from scipy.sparse.csgraph import csgraph_from_dense, floyd_warshall
# from decimal import Decimal
# from collections import defaultdict, deque
# 再帰の制限設定
sys.setrecursionli... | p02547 |
N = int(eval(input()))
D = [tuple(map(int, input().split())) for _ in range(N)]
for i in range(N - 2):
if all(d[0] == d[1] for d in D[i: i + 3]):
print('Yes')
exit()
else:
print('No')
| def input_array():
return list(map(int,input().split()))
n=int(eval(input()))
D=[input_array() for i in range(n)]
count=0
for d in D:
if d[0]==d[1]:
count+=1
else:
count=0
if count==3:
break
if count==3:
print("Yes")
else:
print("No") | p02547 |
n=int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
ans='No'
for i in range(n-2):
if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] and l[i+2][0]==l[i+2][1]:
ans='Yes'
break
print(ans) | n=int(eval(input()))
l = [list(map(int,input().split())) for i in range(n)]
ans='No'
for i in range(n-2):
if l[i][0]==l[i][1] and l[i+1][0]==l[i+1][1] and l[i+2][0]==l[i+2][1]:
ans='Yes'
print(ans) | p02547 |
# (10-x) ways: (0,x)-(9-x,9) -> (x, -x) <- This should never happens when D > 0
# (x) ways: (10-x,0)-(9,x-1) -> (x-10, 10 - x)
def solve(d, k, outer):
if k <= 1:
return 10**k if d == 0 else 0
# if d >= 10**k:
# return 0
t = (-d)%10 # 10-d%10 doesn't work when d = 10
d -= t*10**(... | def solve(d, K):
r = 1
for k in range(K,1,-2):
if d >= 10**k:
return 0
t = (-d)%10
d = abs((d-t*(10**(k-1)-1))//10)
r *= 10-t-(K==k)
return r*(10**(K%2)) if d == 0 else 0
D = int(eval(input()))
result = 0
l = len(str(D))
for k in range(l,2*l+1):
result += solve(D, k)
prin... | p03704 |
# coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
def f(i,d):
"""
i 桁の n で、r(n)-n = d
"""
n = i-1
m = 0
res = []
while n>m:
x = 10**n-10**m
if m:
res.append(tuple((x*k,v) for k,v in list(d2.items())))... | # coding: utf-8
# Your code here!
import sys
read = sys.stdin.read
readline = sys.stdin.readline
def f(i,d):
"""
i 桁の n で、r(n)-n = d
"""
n = i-1
m = 0
res = []
while n>m:
x = 10**n-10**m
if m:
res.append(tuple((x*k,v) for k,v in list(d2.items())))... | p03704 |
import itertools as ite
import math
import random
INF = 10 ** 18
MOD = 10 ** 9 + 7
def func(diff, cnt9, cnt0):
if cnt9 <= 0:
return (diff == 0)
num = int("9" * cnt9 + "0" * cnt0)
return sum(func(diff + i * num, cnt9 - 2, cnt0 + 1) * (9 - abs(i) + 1 - (cnt0 < 1)) for i in range(-9, 10) i... | import itertools as ite
import math
import random
INF = 10 ** 18
MOD = 10 ** 9 + 7
def func(diff, cnt9, cnt0):
if cnt9 <= 0:
return (diff == 0)
num = int("9" * cnt9 + "0" * cnt0)
return sum(func(diff + i * num, cnt9 - 2, cnt0 + 1) * (9 - abs(i) + 1 - (cnt0 < 1)) for i in range(-9, 10) i... | p03704 |
import itertools as ite
import math
import random
INF = 10 ** 18
MOD = 10 ** 9 + 7
def func(diff, cnt9, cnt0):
if cnt9 <= 0:
return (diff == 0)
num = int("9" * cnt9 + "0" * cnt0)
return sum(func(diff + i * num, cnt9 - 2, cnt0 + 1) * (9 - abs(i) + 1 - (cnt0 < 1)) for i in range(-9, 10) i... | def func(diff, cnt9, cnt0):
if cnt9 <= 0 : return diff == 0
num = int("9" * cnt9 + "0" * cnt0)
return sum(func(diff + i * num, cnt9 - 2, cnt0 + 1) * (9 - abs(i) + 1 - (cnt0 < 1)) for i in range(-9, 10) if abs(diff + i * num) < num)
D = eval(input())
print(sum(func(D, d, 0) * (10 - d % 2 * 9) for d in... | p03704 |
for i in range(int(eval(input()))):
c,a,n = list(map(int,input().split()))
cnt = 0
while True:
if c<1 or a<1 or n<1:
break
c -= 1
a -= 1
n -= 1
cnt += 1
while True:
if c<2 or a<1:
break
c -= 2
a -= 1
cnt += 1
while True:
if c<3:
break
c -= 3
cnt += 1
print(cnt... | for i in range(int(eval(input()))):
c,a,n = list(map(int,input().split()))
cnt1 = min(c,a,n)
c -= cnt1
a -= cnt1
cnt2 = min(c//2,a)
c -= cnt2*2
cnt3 = c//3
print((cnt1+cnt2+cnt3)) | p00276 |
h, w = list(map(int, input().split()))
mp = []
for _ in range(h):
lst = list(map(int, input().split()))
cum = []
acc = 0
for i in lst:
if not i:
acc += 1
else:
acc = 0
cum.append(acc)
mp.append(cum)
mp.append([-1] * w)
ans = 0
#print(*mp, sep="\n")
for i in range(w ... | h, w = list(map(int, input().split()))
mp = []
for _ in range(h):
lst = list(map(int, input().split()))
cum = []
acc = 0
for i in lst:
if not i:
acc += 1
else:
acc = 0
cum.append(acc)
mp.append(cum)
mp.append([-1] * w)
ans = 0
for i in range(w):
stack = []
fo... | p02327 |
from sys import stdin
from collections import deque
readline = stdin.readline
h, w = list(map(int, readline().split()))
w += 1
dp = [list(map(int, readline().split())) + [1] for _ in range(h)]
for i in range(h):
for j in range(w):
dp[i][j] ^= 1
for i in range(1, h):
for j in range(w):
... | from sys import stdin
from collections import deque
def judge(n,hs):
stack = deque()
ans = 0
for i, h in enumerate(hs):
j = -1
while stack and stack[-1][1] > h:
j, h2 = stack.pop()
ans = max(ans, (i - j) * h2)
if not stack or stack[-1][1] < h:
... | p02327 |
def max_rectangle(array):
max_area = 0
for i in range(1, max(array) + 1):
current_area = 0
for j in range(len(array)):
if array[j] >= i:
current_area += i
if current_area > max_area:
max_area = current_area
el... | def new_max_rectangle(array):
max_area = 0
for i in range(len(array)):
min_height = array[i]
width = 1
for j in range(i, len(array)):
if array[j] == 0:
width = 1
if j < i:
min_height = array[j + 1]
... | p02327 |
import sys
readline = sys.stdin.readline
from collections import Counter
MOD = 998244353
def fac(limit):
fac = [1]*limit
for i in range(2,limit):
fac[i] = i * fac[i-1]%MOD
faci = [None]*limit
faci[-1] = pow(fac[-1], MOD -2, MOD)
for i in range(-2, -limit-1, -1):
faci[i] ... | import sys
readline = sys.stdin.readline
from collections import Counter
MOD = 998244353
def fac(limit):
fac = [1]*limit
for i in range(2,limit):
fac[i] = i * fac[i-1]%MOD
faci = [None]*limit
faci[-1] = pow(fac[-1], MOD -2, MOD)
for i in range(-2, -limit-1, -1):
faci[i] ... | p02539 |
import sys
readline = sys.stdin.readline
from collections import Counter
MOD = 998244353
def fac(limit):
fac = [1]*limit
for i in range(2,limit):
fac[i] = i * fac[i-1]%MOD
faci = [None]*limit
faci[-1] = pow(fac[-1], MOD -2, MOD)
for i in range(-2, -limit-1, -1):
faci[i] ... | import sys
readline = sys.stdin.readline
from collections import Counter
MOD = 998244353
def fac(limit):
fac = [1]*limit
for i in range(2,limit):
fac[i] = i * fac[i-1]%MOD
faci = [None]*limit
faci[-1] = pow(fac[-1], MOD -2, MOD)
for i in range(-2, -limit-1, -1):
faci[i] ... | p02539 |
import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
prime = 998244353
root = 3
def _fmt(A, inverse = False):
N = len(A)
logN = (N - 1).bit_length()
base = pow(root, (prime - 1) // N * (1 - 2 * inverse) % (prime - 1), prime)
... | import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
prime = 998244353
root = 3
def _fmt(A, inverse = False):
N = len(A)
logN = (N - 1).bit_length()
base = pow(root, (prime - 1) // N * (1 - 2 * inverse) % (prime - 1), prime)
... | p02539 |
import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
prime = 998244353
root = 3
def _fmt(A, inverse = False):
N = len(A)
logN = (N - 1).bit_length()
base = pow(root, (prime - 1) // N * (1 - 2 * inverse) % (prime - 1), prime)
... | import sys
INF = 1 << 60
MOD = 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
prime = 998244353
root = 3
def _fmt(A, inverse = False):
N = len(A)
logN = (N - 1).bit_length()
base = pow(root, (prime - 1) // N * (1 - 2 * inverse) % (prime - 1), prime)
... | p02539 |
mod = 10 ** 9 + 7
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))
sum = 0
for i in range(n-1):
for j in range(m-1):
h = x[i+1] - x[i]
v = y[j+1] - y[j]
sum = (sum + h*v*(i+1)*(n-i-1)*(j+1)*(m-j-1)) % mod
print((sum % mod)) | mod = 10 ** 9 + 7
n,m = list(map(int,input().split()))
x = list(map(int,input().split()))
y = list(map(int,input().split()))
sum_h = 0
sum_v = 0
for i in range(n-1):
sum_h += (x[i+1] - x[i])*(i+1)*(n-i-1)
sum_h = sum_h % mod
for j in range(m-1):
sum_v += (y[j+1] - y[j])*(j+1)*(m-j-1)
sum_v = sum_... | p03764 |
from operator import mul
n, m = list(map(int, input().split()))
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))
dXs = [0] * (n - 1)
for i in range(n - 1):
dXs[i] = xs[i + 1] - xs[i]
dYs = [0] * (m - 1)
for j in range(m - 1):
dYs[j] = ys[j + 1] - ys[j]
fXs = [(i + 1) *... | from operator import mul
n, m = list(map(int, input().split()))
xs = list(map(int, input().split()))
ys = list(map(int, input().split()))
MOD = 10 ** 9 + 7
fX = sum(map(mul, xs, list(range(-n + 1, n + 1, 2)))) % MOD
fY = sum(map(mul, ys, list(range(-m + 1, m + 1, 2)))) % MOD
print(((fX * fY) % MOD))
| p03764 |
ai = lambda: list(map(int, input().split()))
n,m = ai()
x = ai()
y = ai()
mod = 10**9+7
ans = 0
sx,ssx,sy,ssy = [x[0]], [x[-1]], [y[0]], [y[-1]]
for i in range(1, n):
sx.append(sx[-1] + x[i])
ssx.append(ssx[-1] + x[-i-1])
for i in range(1, m):
sy.append(sy[-1] + y[i])
ssy.append(ssy[-1] ... | ai = lambda: list(map(int, input().split()))
n,m = ai()
x = ai()
y = ai()
mod = 10**9+7
from itertools import accumulate as acc
sx = list(acc(x))
ssx = list(acc(x[::-1]))
sy = list(acc(y))
ssy = list(acc(y[::-1]))
a = sum(ssx[i] - sx[i] for i in range(n)) % mod
b = sum(ssy[i] - sy[i] for i in ran... | p03764 |
mod=10**9+7
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
y=list(map(int,input().split()))
xl=0
yl=0
for i in range(n-1):
r=i+1
while r<n:
xl=(xl+x[r]-x[i])%mod
r+=1
for i in range(m-1):
u=i+1
while u<m:
yl=(yl+y[u]-y[i])%mod
u+=1
print((xl*yl%mod)) | mod=10**9+7
n,m=list(map(int,input().split()))
x=list(map(int,input().split()))
y=list(map(int,input().split()))
xl=0
xt=0
yl=0
yt=0
for i in range(n-1):
if i==0:
for j in range(1,n):
xt+=x[j]-x[i]
xl=xt
else:
xt-=(x[i]-x[i-1])*(n-i)
xl=(xl+xt)%mod
for i in range(m-1):
if i=... | p03764 |
MOD = 1000000007
def solve2(Xs, Ys):
cell_num = (len(Xs) - 1) * (len(Ys) - 1)
if len(Xs) < 2 or len(Ys) < 2:
return 0
area = (Xs[-1] - Xs[0]) * (Ys[-1] - Ys[0])
ans = area * cell_num
ans %= MOD
return ans
def solve(Xs, Ys):
if len(Xs) <= 3 and len(Ys) <= 3:
r... | #!/usr/bin/env python3
#
# まず1次元で考える
# | | | |
# a b c d
# とあるとき、長さの合計は
# (b-a) + (c-a) + (d-a) + (c-b) + (d-b) + (d-c)
# = 3d + c - b - 3a
# これは、各点の座標を、<自分より左にある点の数> - <自分より右にある点の数> でかけたものの和である
#
# もとめる面積は X座標、Y座標それぞれについて蒸気を計算した積
MOD = 1000000007
def len_sum(Xs):
size = len(Xs)
r... | p03764 |
import itertools
def main():
n, m = list(map(int, input().split()))
X = list(map(int, input().split()))
Y = list(map(int, input().split()))
s = 0
for x in itertools.combinations(X, 2):
for y in itertools.combinations(Y, 2):
x_len = x[0] - x[1]
y_len =... | import itertools
def main():
n, m = list(map(int, input().split()))
x = list(map(int, input().split()))
y = list(map(int, input().split()))
x_len = 0
y_len = 0
for i in range(n):
x_len += (2 * i - n + 1) * x[i] % (10 ** 9 + 7)
# print(x_len)
for j in ran... | p03764 |
a, b = list(map(int, input().split()))
print(((a-1) * (b-1))) | n, m = list(map(int, input().split()))
print(((n-1)*(m-1))) | p03635 |
a,b=list(map(int,input().split()))
x = a-1
y = b-1
print((x*y)) | a,b=list(map(int,input().split()))
print(((a-1)*(b-1))) | p03635 |
a=list(map(int,input().split()))
print(((a[0]-1)*(a[1]-1))) | a,b=list(map(int,input().split()))
print((a*b-a-b+1)) | p03635 |
a, b = list(map(int, input().split()))
print(((a-1)*(b-1))) | def main():
n,m = list(map(int,input().split()))
print(((n-1)*(m-1)))
if __name__ == '__main__':
main()
| p03635 |
a,b = list(map(int,input().split()))
print(((a-1)*(b-1)))
| #!/usr/bin/env python3
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
a,b = list(map(int,input().split()))
print(((a-1)*(b-1))) | p03635 |
n,m=list(map(int, input().split()))
print((int((n-1)*(m-1)))) | n,m=list(map(int, input().split()))
print(((n-1)*(m-1))) | p03635 |
n,m=list(map(int,input().split()))
print(((n-1)*(m-1))) | a,b=list(map(int,input().split()))
print((~-a*~-b)) | p03635 |
from collections import Counter,defaultdict,deque
from heapq import heappop,heappush,heapify
import sys,bisect,math,itertools,fractions,pprint
sys.setrecursionlimit(10**8)
mod = 10**9+7
INF = float('inf')
def inp(): return int(sys.stdin.readline())
def inpl(): return list(map(int, sys.stdin.readline().split()))
... | a,b = list(map(int,input().split()))
print(((a-1)*(b-1))) | p03635 |
N, M = list(map(int, input().split()))
ans=(N-1)*(M-1)
print(ans) | N, M = list(map(int, input().split()))
print(((N-1)*(M-1))) | p03635 |
a = input().split()
print(((int(a[0]) - 1) * (int(a[1]) - 1))) | a,b=list(map(int,input().split()))
print(((a-1)*(b-1))) | p03635 |
print((eval('('+input().replace(' ','-1)*(')+'-1)'))) | s=1
for i in input().split():s*=~-int(i)
print(s) | p03635 |
m,n = list(map(int,input().split()))
print(((m-1)*(n-1))) | n,m=list(map(int,input().split()))
print(((n-1)*(m-1))) | p03635 |
n, m = list(map(int, input().split()))
print(((n - 1) * (m - 1))) | a, b = list(map(int, input().split()))
print(((a - 1) * (b - 1))) | p03635 |
import itertools
while True:
N, K, S = list(map(int, input().split()))
if N == K == S == 0:
break
ans = 0
for l in itertools.combinations(list(range(1, N+1)), K):
if sum(l) == S:
ans += 1
print(ans) | import itertools
while True:
N, K, S = list(map(int, input().split()))
if N == K == S == 0:
break
print((sum(1 for l in itertools.combinations(list(range(1, N+1)), K) if sum(l) == S))) | p00914 |
def dfs(i,k,s):
if k == s == 0: return 1
if i > n or s < i*k+k-1: return 0
return dfs(i+1,k,s)+dfs(i+1,k-1,s-i)
while 1:
n,k,s = list(map(int,input().split()))
if n == 0: break
print(dfs(1,k,s)) | import itertools
while 1:
n,k,s = list(map(int,input().split()))
if n == 0: break
print(sum(sum(ele) == s for ele in itertools.combinations(list(range(1,n+1)),k))) | p00914 |
primes = [2]
for i in range(3, 200):
for prime in primes:
if i % prime == 0:
break
else:
primes.append(i)
n = int(eval(input()))
ans = 0
for i in range(1, n + 1, 2):
count = 0
for prime in primes:
if i % prime == 0:
i //= prime
count += 1
if i == 1 and coun... | n = int(eval(input()))
answers = [105, 135, 165, 189, 195]
for i, a in enumerate(answers):
if n < a:
print(i)
break
else:
print((5)) | p03281 |
from math import sqrt
N = int(eval(input()))
ans = 0
for i in range(7, N+1):
if i%2==0:
continue
c = 0
for j in range(1, int(sqrt(i))+1):
if i%j==0:
if i//j==j:
c+=1
else:
c+=2
if c==8:
ans += 1
print(ans) | from math import sqrt
N = int(eval(input()))
ans = 0
for i in range(7, N+1):
if i%2==0:
continue
c = 0
for j in range(1, int(sqrt(i))+1):
if i%j==0:
c+=2
if c==8:
ans += 1
print(ans) | p03281 |
import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
# 約数の片割れをリストに
divisors.append(i)
... | import sys
def input(): return sys.stdin.readline().strip()
def resolve():
n=int(eval(input()))
if 1<=n<105:
print((0))
elif n<135:
print((1))
elif n<165:
print((2))
elif n<189:
print((3))
elif n<195:
print((4))
else:
print((5)... | p03281 |
import collections
def solve():
N = int(eval(input()))
def GetDivider(num):
cnt = 0
for i in range(1, num+1):
if num % i == 0:
cnt += 1
return cnt
ans = 0
for i in range(1, N+1):
if GetDivider(i) == 8:
... | N = int(eval(input()))
def GetDivider(num):
cnt = 0
for i in range(1, num+1):
if num % i == 0:
cnt += 1
return cnt
ans = 0
for i in range(1, N+1):
if GetDivider(i) == 8:
if i % 2 != 0:
ans += 1
print(ans)
| p03281 |
n = int(eval(input()))
counter = 0
for i in range(1, n+1):
if i%2!=0 and len([j for j in range(1,i+1) if i%j==0])==8:
counter += 1
print(counter) | n = int(eval(input()))
ans = 0
for i in range(1, n+1, 2):
counter = 0
for j in range(1, i+1):
if i%j==0:
counter += 1
if counter > 8:
break
if counter == 8:
ans += 1
print(ans) | p03281 |
n = int(eval(input()))
l=[]
count=0
for h in range(n):
for i in range(h+1):
if (h+1)%(i+1)==0 and (h+1)%2!=0:
l.append(h+1)
if len(l)==8:
count+=1
if len(l)!=8:
l.clear()
print(count) | n = int(eval(input()))
cnt=0
ans=0
for i in range(1,n+1,2):
for j in range(1,i+1):
if i%j==0:
cnt+=1
if cnt==8:
ans+=1
cnt=0
else:
cnt=0
print(ans) | p03281 |
# 02 AtCoder Beginner Contest 106 B - 105
import sys
import math
N = int(eval(input()))
def divisor(n):
ans = 0
for i in range(1, n + 1, 2): # 偶数は回答に含めないため、約数が 2の倍数となる数字は存在しない
if n % i == 0:
ans += 1
# if i != int(math.sqrt(n)):
# ans += 1
... | # 02 AtCoder Beginner Contest 106 B - 105
import sys
import math
N = int(eval(input()))
def divisor(n):
ans = 0
for i in range(1, int(math.sqrt(n + 1)), 2): # 偶数は回答に含めないため、約数が 2の倍数となる数字は存在しない
if n % i == 0:
ans += 1
if i != int(math.sqrt(n + 1)):
... | p03281 |
n = int(eval(input()))
dp = [1]*(n + 1)
ans = 0
# エラストテネスの箒
for i in range(2, n + 1):
div = 1
while i * div <= n:
dp[i * div] += 1
div += 1
# dp[1]から１個飛ばしで表示
print((dp[1::2].count(8))) | n = int(eval(input()))
cnt = 0
lista = [0] * (n + 1)
# 奇数のみ
for i in range(1, n + 1, 2):
# 3 * 1, 3 * 3, 3 * 5...
for j in range(i, n + 1, 2 * i):
lista[j] += 1
for i in range(n + 1):
if lista[i] == 8:
cnt += 1
print(cnt)
| p03281 |
#ABC105-B
n = int(eval(input()))
divisor_list = []
ans = 0
for i in range(1,n+1):
divisor_list = []
#odd,even判定
if(i % 2 != 0):
#約数をdivisor_listに追加していく
for j in range(1,i+1):
if (i % j == 0):
divisor_list.append(j)
if(len(divisor_list) == 8... | #ABC105-B
n = int(eval(input()))
divisor_list = []
divisor_length = 0
ans = 0
for i in range(1,n+1):
divisor_list = []
divisor_length = 0
#odd,even判定
if(i % 2 != 0):
#約数をdivisor_listに追加していく
for j in range(1,i+1):
if (i % j == 0):
divisor_length +=... | p03281 |
n = int(eval(input()))
ans = 0
for i in range(1,n+1,2):
divisor = 0
for ii in range(1,i+1):
if i % ii == 0:
divisor += 1
if divisor == 8:
ans += 1
print(ans)
| # https://qiita.com/LorseKudos/items/9eb560494862c8b4eb56
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = in... | p03281 |
N=int(eval(input()))
ans=0
for i in range(1,N+1):
count=0
for j in range(1,N+1,2):
if i%j == 0:
count +=1
if count == 8:
ans +=1
print(ans) | def divisor(x):
i=1
table = []
while i * i <= x:
if x%i == 0:
table.append(i)
table.append(x//i)
i += 1
table = list(set(table))
return table
n=int(eval(input()))
ans=0
for i in range(1,n+1,2):
cnt = len(divisor(i))
if cnt == 8:
ans += 1
print(ans) | p03281 |
n=int(eval(input()))
def yakusu(num):
list_a=[]
for i in range(1,num//2+1):
if num % i == 0:
list_a.append(i)
list_a.append(num)
return list_a
ans=0
for i in range(1,n+1):
if len(yakusu(i)) == 8 and i % 2 == 1:
ans += 1
print(ans)
| n = int(eval(input()))
ans = 0
def get_yakusu_num(n):
m = int(n ** (1/2))
rep_list = []
for i in range(1, m + 2):
if n % i == 0:
p = n // i
rep_list.append(i)
rep_list.append(p)
return len(set(rep_list))
for i in range(1, n + 1):
if get_yak... | p03281 |
import math
n = int(eval(input()))
ans = 0
if n < 105:
print((0))
else:
for i in range(105, n +1, 2):
div = []
for j in range(1, int(math.sqrt(i**2) + 1)):
if i % j == 0:
div.append(j)
if j != i // j:
div.append(i //j)... | n = int(eval(input()))
def make_divisor(n):
divisors = []
if n % 2 == 0:
return 0
for i in range(1, int(n ** 0.5) + 1, 2):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n // i)
return len(divisors)
ans = 0
fo... | p03281 |
# https://atcoder.jp/contests/abc106/tasks/abc106_b
import fractions
N = int(eval(input()))
def is_8(num):
if num < 1:
return False
elif num == 1:
return False
else:
divisor_list = []
divisor_list.append(1)
for i in range(2, num // 2 + 1):
... | # https://atcoder.jp/contests/abc106/tasks/abc106_b
import math
N = int(eval(input()))
def is_8(num):
if num < 1:
return False
elif num == 1:
return False
else:
divisor_list = set()
divisor_list.add(1)
# root nまで見れば問題ない
for i in range(2, int(... | p03281 |
n = int(eval(input())) + 1
ans = 0
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
for val in range(n):
... | def divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
if i%2 !=... | p03281 |
n = int(eval(input()))
ans = 0
for i in range(1, n+1 ,2):
divisor_count = 0
for j in range(1, i+1):
if i%j == 0:
divisor_count +=1
if divisor_count == 8:
ans += 1
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n + 1 ,2):
divisor_count = 0
for j in range(1, i + 1):
if i % j == 0:
divisor_count += 1
if divisor_count == 8:
ans += 1
print(ans)
| p03281 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
N = int(eval(input()))
# print(len(make_divisors(N)))
answer = 0
... | N = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
ans = 0
for i in range(1, N+1, 2):
# ... | p03281 |
# 引数nが持つ正の約数の数を調べる
def divisor_count(n:int) -> int:
count = 0
for x in range(1, n+1):
if n % x == 0:
count += 1
return count
def solve(n: int) -> int:
# [1..N]内で奇数かつ約数をちょうど8個持つ数字の数
result = 0
for x in range(1, n+1):
if x&1 and divisor_count(x) == 8:
result += 1
retur... | # 引数nが持つ正の約数の数を調べる
def divisor_count(n:int) -> int:
count = 0
for x in range(1, n+1):
if n % x == 0:
count += 1
return count
def solve(n: int) -> int:
# [1..N]内で奇数かつ約数をちょうど8個持つ数字の数
result = 0
for x in range(1, n+1, 2):
if divisor_count(x) == 8:
result += 1
return res... | p03281 |
N = int(eval(input()))
if N < 105:
print((0))
elif N < 135:
print((1))
elif N < 165:
print((2))
elif N < 189:
print((3))
elif N < 195:
print((4))
else:
print((5))
| N = int(eval(input()))
A = [105, 135, 165, 189, 195]
print((sum([1 for a in A if a <= N])))
| p03281 |
n = int(eval(input()))
ans = 0
for i in range(1,n+1):
tmp = 0
for j in range(1,i+1):
if i%2 == 0:
continue
if i%j == 0:
tmp += 1
if tmp == 8:
ans += 1
print(ans) | n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if i%2 == 0:
continue
cnt = 0
for j in range(1, i+1):
if i%j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | p03281 |
n = int(eval(input()))
p = 0
for i in range(n + 1)[1::2]:
c = 0
j = i
k = i
while j > 0:
if k % j == 0:
c += 1
j -= 1
if c >= 8:
p += 1
print(p) | n = int(eval(input()))
ans = 0
for i in range(1,n+1)[::2]:
p = 0
for j in range(1,i+1):
if i % j == 0:
p += 1
if p == 8:
ans += 1
print(ans) | p03281 |
n = int(eval(input()))
ans = 0
L = [0]*200
for i in range(1,n+1,2):
tmp = 1
cnt = 0
while tmp <= i:
if i % tmp == 0:
cnt += 1
tmp += 1
L[i] = cnt
print((L.count(8))) | n = int(eval(input()))
L = [0]*200
for i in range(1,n+1,2):
tmp = 1
cnt = 0
while tmp <= i:
if i % tmp == 0:
cnt += 1
tmp += 1
L[i] = cnt
print((L.count(8))) | p03281 |
n = int(eval(input()))
L = [0]*200
for i in range(1,n+1,2):
tmp = 1
cnt = 0
while tmp <= i:
if i % tmp == 0:
cnt += 1
tmp += 1
L[i] = cnt
print((L.count(8))) | n = int(eval(input()))
ans = 0
for i in range(1,n+1,2):
cnt = 0
for j in range(1,i+1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | p03281 |
n=int(eval(input()))
x=0
for j in range(1,n+1):
if j%2==0:
continue
m=0
for i in range(1,j+1):
if j%i==0:
m+=1
if m==8:
x+=1
print(x)
| def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n=int(eval(input()))
if n<105:
print((0))
exit()
ans=1
for... | p03281 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n=int(eval(input()))
if n<105:
print((0))
exit()
ans=1
for... | n=int(eval(input()))
if n<105:
print((0))
exit()
ans=0
for i in range(105,n+1,2):
c=0
for j in range(1,i+1):
if i%j==0:
c+=1
if c==8:
ans+=1
print(ans) | p03281 |
n = int(eval(input()))
if 104 >= n:
print((0))
exit()
ans = 0
for i in range(105,n+1,2):
l1 = [0]*(i+1)
count = 1
for j in range(2,i+1):
if i % j == 0:
while i % j == 0:
l1[j] += 1
i //= j
for k in l1:
count *= (k+1)
... | n = int(eval(input()))
ans = 0
for i in range(1,n+1,2):
count = 0
for j in range(1,i+1):
if i%j==0:
count += 1
if count == 8:
ans += 1
print(ans)
| p03281 |
n = int(eval(input()))
nSum = 0
for i in range(n):
cnt = 0
for j in range(i + 1):
if (i + 1) % (j + 1) == 0:
cnt += 1
if cnt == 8 and (i + 1) % 2 != 0:
nSum += 1
print(nSum)
| n = int(eval(input()))
nSum = 0
for i in range(n):
cnt = 0
if (i + 1) % 2 != 0:
for j in range(i + 1):
if (i + 1) % (j + 1) == 0:
cnt += 1
if cnt == 8:
nSum += 1
print(nSum)
| p03281 |
n = int(eval(input()))
nSum = 0
for i in range(n):
cnt = 0
if (i + 1) % 2 != 0:
for j in range(i + 1):
if (i + 1) % (j + 1) == 0:
cnt += 1
if cnt == 8:
nSum += 1
print(nSum)
| n = int(eval(input()))
a = [105, 135, 165, 189, 195]
for i in range(5):
a[i] = 1 if n >= a[i] else 0
print((sum(a)))
| p03281 |
import sys
from itertools import combinations
import math
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int, sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I(... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def S(): return sys.stdin.readline().rstrip()
def LS(): return list(sys.stdin.readline().rstrip().split())
n = I()
ans = 0
if n < 105:
print((0))
exit
else:
for ... | p03281 |
# -*- coding: utf-8 -*-
# 標準入力を取得
N = int(eval(input()))
# 求解処理
ans = 0
for n in range(1, N + 1, 2):
divisors_count = 0
for i in range(1, n + 1):
if n % i == 0:
divisors_count += 1
if divisors_count == 8:
ans += 1
# 結果出力
print(ans)
| # -*- coding: utf-8 -*-
def get_input() -> int:
"""
標準入力を取得する.
Returns:\n
int: 標準入力
"""
N = int(eval(input()))
return N
def main(N: int) -> None:
"""
メイン処理.
Args:\n
N (int): 1以上200以下の整数
"""
# 求解処理
ans = 0
for n in range(1, ... | p03281 |
n = int(eval(input()))
int_list = []
for i in range(1,n+1,2):
num = 0
for j in range(1, i + 1):
if i % j == 0:
num += 1
if num == 8:
int_list.append(i)
print((len(int_list))) | import sys
n = int(eval(input()))
if n <= 3:
print((3))
sys.exit()
def check(a):
sqrt = round(a ** 0.5 + 0.5)
factors = {1, a}
for i in range(2, sqrt + 1):
if not a % i:
if not i in factors:
factors.add(i)
j = a // i
if not j i... | p03281 |
N=int(eval(input()))
count = 0
count2 = 0
for i in range(1,N+1):
#print(i,"i")
for j in range(1,N+1):
#print(j,"k")
if i % j == 0 :
count += 1
#print(count,"count")
if count == 8 and i%2 != 0:
count2 += 1
ans = count2
count = 0
print(ans)... | N=int(eval(input()))
cnt = 0
ans = 0
for i in range(1,N+1):
if i % 2 != 0:
for j in range(1,i+1):
if i%j == 0:
cnt += 1
#print(j)
if cnt == 8:
ans += 1
cnt = 0
print(ans)
| p03281 |
import sys
read = sys.stdin.buffer.read
input = sys.stdin.buffer.readline
inputs = sys.stdin.buffer.readlines
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
# import numpy as np
def main():
n=int(eval(input()))
ans=0
if n>=105:
ans+=1
if n>=135:
ans+=1
if n>=165:
an... | import sys
input = sys.stdin.buffer.readline
#input = sys.stdin.readline
def II(): return int(eval(input()))
def MI(): return list(map(int,input().split()))
def LI(): return list(map(int,input().split()))
# mod=10**9+7
# rstrip().decode('utf-8')
# map(int,input().split())
def main():
n=II()
li=[105,1... | p03281 |
N = int(eval(input()))
if N <=104:
print((0))
elif N <= 106:
print((1))
else:
if N%2 != 0:
num = list(range(105, N+1))
kotae = list(range(1, N+2, 2))
else:
num = list(range(105, N))
kotae = list(range(1, N, 2))
num = num[::2]
ans = [... | N = int(eval(input()))
odd = list(range(1, N+1, 2))
ans = 0
for ki in odd:
count = 0
for waru in range(1,ki+1):
if ki % waru == 0:
count += 1
if count == 8:
ans += 1
print(ans) | p03281 |
n = int(eval(input()))
if 1 <= n < 105:
print("0")
elif 105 <= n < 135:
print("1")
elif 135 <= n < 165:
print("2")
elif 165 <= n < 189:
print("3")
elif 189 <= n < 195:
print("4")
elif 195 <= n <= 200:
print("5") | n = int(eval(input()))
if 1 <= n < 105:
print((0))
elif 105 <= n < 135:
print((1))
elif 135 <= n < 165:
print((2))
elif 165 <= n < 189:
print((3))
elif 189 <= n < 195:
print((4))
else:
print((5))
| p03281 |
c = int(eval(input()))
b = 0
for i in range(1, c + 1, 2):
a = 0
for j in range(1, c + 1):
if i % j == 0:
a += 1
if a == 8:
b += 1
print(b)
| a = int(eval(input()))
c = 0
for i in range(a + 1):
if i % 2 == 1:
b = 0
for j in range(1, i + 1):
if i % j == 0:
b += 1
if b == 8:
c += 1
print(c)
| p03281 |
def d(K):
res=0
for i in range(1,K+1):
if K%i==0:
res+=1
return res
N=int(eval(input()))
ans=0
for i in range(1,N+1):
if i%2==0:
continue
if d(i)==8:
ans+=1
print(ans)
| N=int(eval(input()));L=[105,135,165,189,195];a=0
for i in L:a+=1 if i<=N else 0
print(a) | p03281 |
N = int(eval(input()))
cd = [0] * N
for i in range(1, N+1):
for j in range(i, N+1):
if j % i == 0:
cd[j-1] += 1
print((cd[::2].count(8)))
| N = int(eval(input()))
cd = [0] * (N // 2 + 1)
for i in range(1, N+1, 2):
for j in range(i, N+1, 2):
if j % i == 0:
cd[j // 2] += 1
print((cd.count(8)))
| p03281 |
n=int(eval(input()))
p=0
for i in range(105,n+1,2):
c=0
for j in range(1,i+1):
if i%j==0:
c+=1
if c==8:
p+=1
print(p) | n=int(eval(input()))
print((sum(i<=n for i in [105,135,165,189,195]))) | p03281 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1, 2):
cnt = 0
for j in range(1, N + 1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n = int(eval(input()))
def num_divisors_table(n):
table = [0] * (n + 1)
for i in range(1, n + 1):
for j in range(i, n + 1, i):
table[j] += 1
return table
table = num_divisors_table(n)
ans = 0
for ... | p03281 |
from math import sqrt
N=int(eval(input()))
ans=0
for i in range(1,N+1,2):
d=[]
for j in range(1,int(sqrt(i))+1):
if i%j==0:
d.append(j)
d.append(N//j)
d=list(set(d))
if len(d)==8:
ans+=1
print(ans) | N=int(eval(input()))
ans=0
for i in range(1,N+1,2):
cnt=2
for j in range(3,int(i**0.5)+1,2):
if i%j==0:
cnt+=2
if cnt==8:
ans+=1
print(ans) | p03281 |
def compute_divisors(num):
divisors = set()
for i in range(1, int(num**.5) + 1):
if num % i == 0:
divisors.add(i)
divisors.add(num // i)
return divisors
print((sum(len(compute_divisors(i))==8 for i in range(1,int(eval(input()))+1, 2)))) | n=int(eval(input()));print((sum(x<=n-100for x in[5,35,65,89,95]))) | p03281 |
n=int(eval(input()))
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[... | n=int(eval(input()))
def count_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return len(lower_divisors + upper_divi... | p03281 |
N = int(eval(input()))
count = 0
for i in range(N):
divisor_count = 0
for j in range(i + 1):
# 偶数は対象外
if (j + 1) % 2 == 0:
continue
if (i + 1) % (j + 1) == 0:
divisor_count += 1
if divisor_count == 8:
count += 1
print(count)
| N = int(eval(input()))
ok_count = 0
for i in range(1, N + 1, 2):
# 約数を8個もつものの数
count = 0
for j in range(1, i + 1):
# print("{}".format(j))
if i % j == 0:
count += 1
if count == 8:
ok_count += 1
print(ok_count)
| p03281 |
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n = int(eval(input()))
ans = 0
for i in range(1, n+1,2):
if le... | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
divisors.sort()
return divisors
n = int(eval(input()))
ans = 0
for i in range(1, n+1):
if len(... | p03281 |
N = int(eval(input()))
ans = 0
count = 0
for i in range(2, N+1):
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8 and i % 2 == 1:
ans += 1
count = 0
print(ans) | N = int(eval(input()))
ans = 0
count = 0
#1の約数の数は絶対1、面倒なので2~Nのカウントにした。+1忘れないように
for i in range(2, N+1):
for j in range(1, i+1):
if i % j == 0:
count += 1
if count == 8 and i % 2 == 1:
ans += 1
count = 0
print(ans) | p03281 |
N = int(eval(input()))
ans = 0
for i in range(1, N + 1):
res = 0
for q in range(1, N + 1):
if i % 2 != 0:
if i % q == 0:
res += 1
if res == 8:
ans += 1
print(ans) | N = int(eval(input()))
ans = 0
for n in range(1, N+1):
cnt = 0
if n % 2 == 1:
for i in range(1, N+1):
if n % i == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans) | p03281 |
n=int(eval(input()))
c=0
for i in range(1,n+1):
if not i%2:continue
t=0
for j in range(1,i+1):
if not i%j:t+=1
if t==8:c+=1
print(c) | n=int(eval(input()));print((sum(x<n-99for x in[5,35,65,89,95]))) | p03281 |
n=int(eval(input()))
a=[3,5,7,9,11,13,17,19]
count=0
for i in range(len(a)):
for j in range(i+1,len(a)):
for k in range(j+1,len(a)):
if a[i]*a[j]*a[k]<=n:
count+=1
print(count) | n=int(eval(input()))
ans=0
for i in range(1,n+1):
cnt=0
if i%2==0:continue
for j in range(1,i+1):
if i%j==0:cnt+=1
if cnt==8:
ans+=1
print(ans) | p03281 |
n = int(eval(input()))
ans = 0
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, i+1, 2):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
| n = int(eval(input()))
ans = 0
for i in range(1, n+1, 2):
cnt = 0
for j in range(1, n+1):
if i % j == 0:
cnt += 1
if cnt == 8:
ans += 1
print(ans)
| p03281 |
n = int(eval(input()))
c = []
for i in range(1,n+1):
k = []
for j in range(1,i+1):
if i % j == 0:
k.append(j)
if len(k) == 8:
if i % 2 != 0:
c.append(i)
print((len(c))) | def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return len(divisors)
n = int(eval(input()))
ans = 0
for i in range(1,n+1,2):
if make_divisors(i) == 8:
... | p03281 |
def is8DivisorNumbers(n: int) -> bool:
cnt = 0
for i in range(1, n+1):
if n%i == 0:
cnt += 1
return True if cnt == 8 else False
n = int(eval(input()))
odds = [i for i in range(1, n+1, 2)]
ans = 0
for odd in odds:
if is8DivisorNumbers(odd):
ans += 1
print(a... | n = int(eval(input()))
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
return divisors
ans = 0
for i in range(1, n+1, 2):
if len(make_divisors(i)... | p03281 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.