input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def sieve(n):
is_prime =[True for i in range(n+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2,int(n**0.5)+1):
if is_prime[i]:
for j in range(i+i,n,i):
is_prime[j] = False
c = [0 for i in range(n+1)]
for i in range(3,n+1,2):
if i... | def sieve(n):
is_prime =[True for i in range(n+1)]
is_prime[0] = False
is_prime[1] = False
for i in range(2,int(n**0.5)+1):
if is_prime[i]:
for j in range(i+i,n,i):
is_prime[j] = False
c = [0 for i in range(n+1)]
for i in range(3,n+1,2):
if i... | p03476 |
Q = int(eval(input()))
qs = [tuple(map(int,input().split())) for i in range(Q)]
MAXN = 10**5+10
sieve = [0,0] + [1]*MAXN
p = 2
while p*p <= MAXN:
if sieve[p]:
for q in range(2*p,MAXN+1,p):
sieve[q] = 0
p += 1
cums = [0]
for i in range(1,MAXN):
valid = sieve[i] and sieve[(... | Q = int(input())
LR = [tuple(map(int,input().split())) for i in range(Q)]
MAXN = 10**5+10
sieve = [0,0] + [1]*MAXN
p = 2
while p*p <= MAXN:
if sieve[p]:
for q in range(2*p,MAXN+1,p):
sieve[q] = 0
p += 1
likes = [0] * MAXN
for i in range(3,MAXN,2):
if sieve[i] and sieve[(i... | p03476 |
from itertools import accumulate
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
def main():
Q = int(eval(input()))
N = 10 ** 5
num_list = [0] * (N + 5)
for i in range(1,N+1):
... | from itertools import accumulate
def is_prime(n):
if n == 1:
return False
for i in range(2, int(n ** 0.5) + 1):
if n % i == 0:
return False
return True
def main():
N = [0] * (10 ** 5 + 1)
for i in range(3, 10 ** 5 + 1, 2):
if is_prime(i) and is_pr... | p03476 |
primes = set([2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 173, 179, 181, 191, 193, 197, 199, 211, 223, 227, 229, 233, 239, 241, 251, 257, 263, 269, 271, 277, 281, 283, 293, 307, 311, 313, 317, 331, ... | import bisect
primes = [3, 5, 13, 37, 61, 73, 157, 193, 277, 313, 397, 421, 457, 541, 613, 661, 673, 733, 757, 877, 997, 1093, 1153, 1201, 1213, 1237, 1321, 1381, 1453, 1621, 1657, 1753, 1873, 1933, 1993, 2017, 2137, 2341, 2473, 2557, 2593, 2797, 2857, 2917, 3061, 3217, 3253, 3313, 3517, 3733, 4021, 4057, 4177, 4261... | p03476 |
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc084/tasks/abc084_d
TLE
"""
import sys
from sys import stdin
from math import ceil, floor
input = stdin.readline
def create_prime_list(limit):
""" エラトステネスの篩でlimitまでの素数リストを求める
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E... | # -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc084/tasks/abc084_d
"""
import sys
from sys import stdin
from math import ceil, floor
input = stdin.readline
def create_prime_list(limit):
""" エラトステネスの篩でlimitまでの素数リストを求める
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3%8... | p03476 |
# -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc084/tasks/abc084_d
AC
"""
import sys
from sys import stdin
from math import ceil, floor
input = stdin.readline
def create_prime_list(limit):
""" エラトステネスの篩でlimitまでの素数リストを求める
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3... | # -*- coding: utf-8 -*-
"""
https://beta.atcoder.jp/contests/abc084/tasks/abc084_d
AC
"""
import sys
from sys import stdin
from math import ceil, floor
input = stdin.readline
def create_prime_list(limit):
""" エラトステネスの篩でlimitまでの素数リストを求める
https://ja.wikipedia.org/wiki/%E3%82%A8%E3%83%A9%E3%83%88%E3... | p03476 |
import math
q=int(eval(input()))
a=[]
n=10**5
for i in range(q):
start,end=list(map(int,input().split()))
a.append(list(range(start,end+1,2)))
def sieve_of_eratosthenes(n):
prime=[]
limit=math.sqrt(n)
data=[i+1 for i in range(1,n)]
while True:
p=data[0]
if limit<=p... | import math
import itertools
def prime_boolean_table(n):
primes=[True]*(n+1)
primes[0]=False
primes[1]=False
limit=math.floor(math.sqrt(n)+1)
for i in range(2,limit+1):
if primes[i]:
for j in range(i*2,n+1,i):
primes[j]=False
return primes
n=1... | p03476 |
Q=int(eval(input()))
LR=[]
L,R=0,0
for i in range(Q):
l,r=list(map(int,input().split()))
L,R=max(L,l),max(R,r)
LR.append([l,r])
M=R+1
lst=[0 for i in range(M)]
sosuu=set([2])
count=0
for i in range(3,M,2):
flag=0
for m in sosuu:
if i%m==0:
flag=1
b... |
Q=int(eval(input()))
LR=[]
L,R=0,0
for i in range(Q):
l,r=list(map(int,input().split()))
L,R=max(L,l),max(R,r)
LR.append([l,r])
M=R+1
lst=[0 for i in range(M)]
sosuu=set([2])
count=0
for i in range(3,M//2+1,2):
flag=0
for m in sosuu:
if i%m==0:
flag=1
... | p03476 |
q=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(q)]
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
for j in range(2*i,n+1,i):
sieve[j]=0
ans=[0]*(n+1)
for i in range(3,n):
if sieve[i]==1 and sieve[(i+1)//2]==1:
ans[i]=ans[... | q=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(q)]
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
sieve[2*i::i]=[0 for _ in range(2*i,n+1,i)]
ans=[0]*(n+1)
for i in range(3,n):
if sieve[i]==1 and sieve[(i+1)//2]==1:
ans[i]=ans[i... | p03476 |
q=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(q)]
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
sieve[2*i::i]=[0 for _ in range(2*i,n+1,i)]
ans=[0]*(n+1)
for i in range(3,n):
if sieve[i]==1 and sieve[(i+1)//2]==1:
ans[i]=ans[i... | q=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(q)]
def main():
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
sieve[2*i::i]=[0 for _ in range(2*i,n+1,i)]
ans=[0]*(n+1)
for i in range(3,n):
if sieve[i]==1 and siev... | p03476 |
q=int(eval(input()))
lr=[tuple(map(int,input().split())) for _ in range(q)]
def main():
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
sieve[2*i::i]=[0 for _ in range(2*i,n+1,i)]
ans=[0]*(n+1)
for i in range(3,n):
if sieve[i]==1 and siev... | import sys
from itertools import accumulate
readline=sys.stdin.readline
read=sys.stdin.read
def main():
q,*lr=list(map(int,read().split()))
n=10**5
ansl=[]
sieve=[1]*(n+1)
sieve[0],sieve[1]=0,0
for i in range(2,n):
if sieve[i]:
sieve[2*i::i]=[0 for _ in range(2*i,n+1,i)]
ans=[0]... | p03476 |
q = int(input())
def is_prime(x):
if x == 1:
return False
d = 2
while d**2 <= x:
if x % d == 0:
return False
d += 1
else:
return True
primes = []
for x in range(2, 10**5+1):
if is_prime(x):
primes.append(x)
A = [0]*(1... | U = 10**5
is_prime = [1]*(U+1)
is_prime[0] = 0
is_prime[1] = 0
for p in range(2, int(U**.5)+1):
if is_prime[p]:
for q in range(2*p, U+1, p):
is_prime[q] = 0
primes = [p for p, tf in enumerate(is_prime) if tf]
A = [0]*(10**5+1)
for prime in primes:
if is_prime[(prime+1)//2]:
... | p03476 |
U = 10**5
is_prime = [1]*(U+1)
is_prime[0] = 0
is_prime[1] = 0
for p in range(2, int(U**.5)+1):
if is_prime[p]:
for q in range(2*p, U+1, p):
is_prime[q] = 0
primes = [p for p, tf in enumerate(is_prime) if tf]
A = [0]*(10**5+1)
for prime in primes:
if is_prime[(prime+1)//2]:
... | U = 10**5
is_prime = [1]*(U+1)
is_prime[0] = 0
is_prime[1] = 0
for p in range(2, int(U**.5)+1):
if is_prime[p]:
for q in range(2*p, U+1, p):
is_prime[q] = 0
A = [0]*(10**5+1)
for i in range(1, U+1, 2):
if is_prime[i] and is_prime[(i+1)//2]:
A[i] = 1
S = [0]*(10**5+1... | p03476 |
q = int(eval(input()))
a = [list(int(i) for i in input().split()) for i in range(q)]
MAX = 10**5
is_prime = [1]*MAX
for i in range(2, MAX):
if not is_prime[i]:
continue
for j in range(i*2, MAX, i):
is_prime[j] = 0
s = [0]*MAX
for i in range(3,MAX):
s[i] = s[i-1] + 1 if is_prime[i]... | def main():
q = int(eval(input()))
a = [list(int(i) for i in input().split()) for i in range(q)]
MAX = 10**5
is_prime = [1]*MAX
for i in range(2, MAX):
if not is_prime[i]:
continue
for j in range(i*2, MAX, i):
is_prime[j] = 0
s = [0]*MAX
for... | p03476 |
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError("n is int type.")
if n < 2:
raise ValueError("n is more than 2")
prime = [2]
limit = int(n ** 0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
... | import itertools
def get_sieve_of_eratosthenes(n):
prime = [2]
limit = int(n ** 0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
def... | p03476 |
import math
MAXN = 100001
isPrime = [True for x in range(0, MAXN)]
def findPrime():
isPrime[1] = False
for i in range(2, MAXN):
if isPrime[i]:
for j in range(i + i, int(math.sqrt(MAXN)) + 1, i):
isPrime[j] = False
findPrime()
Q = int(eval(input()))
for i ... | MAXN = 100001
isPrime = [True for x in range(0, MAXN)]
def findPrime():
isPrime[1] = False
for i in range(2, MAXN):
if isPrime[i]:
for j in range(i + i, MAXN, i):
isPrime[j] = False
findPrime()
cache = [0 for x in range(0, MAXN)]
pSum = 0
for i in range(1, ... | p03476 |
#自然数m以下の素数を返す
def prime_numbers(m):
primes = set()
n = 2
while n <= m:
if all(n % i != 0 for i in primes):
primes.add(n)
n += 1
return primes
q = int(eval(input()))
l = []
r = []
for i in range(q):
L,R = list(map(int,input().split()))
l.append(L)
... | #素数列挙
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime... | p03476 |
q = int(eval(input()))
p = [True] * 100010
s = [0] * 100010
p[0] = False
p[1] = False
i = 2
while i <= 100005:
if p[i]:
j = i * 2
while j <= 100005:
p[j] = False
j += i
i += 1
for i in range(100005):
if i & 1 and p[i] and p[(i + 1) // 2]:
... | from itertools import accumulate
q, *lr = list(map(int, open(0).read().split()))
p = [True] * 100010
p[0] = False
p[1] = False
i = 2
while i <= 100005:
if p[i]:
j = i * 2
while j <= 100005:
p[j] = False
j += i
i += 1
s = [0] * 100010
for i in range(3, ... | p03476 |
#nの素数判定
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
q = int(eval(input()))
lr = []
minimum = float('inf')
maximum = 0
for _ in range(q):
l, r = list(map(int, input().split()))
minimum =... |
q = int(eval(input()))
lr = [list(map(int, input().split())) for _ in range(q)]
#nの素数判定
def is_prime(n):
if n == 1:
return 0
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return 0
return 1
m = 0
for l, r in lr:
m = max(l, r, m)
prime_count = [0, 0]
for i i... | p03476 |
'''
https://atcoder.jp/contests/abc084/tasks/abc084_d
'''
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools i... | '''
https://atcoder.jp/contests/abc084/tasks/abc084_d
'''
def main():
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10000000)
from collections import Counter, deque
#from collections import defaultdict
from itertools import combinations, permutations
#from itertools i... | p03476 |
from math import ceil, sqrt
n = 10**5+200
hurui = [i for i in range(n+1)]
for i in range(2,ceil(sqrt(n))+1):
for j in range(2,ceil(sqrt(i))+1):
if i==2:
continue
if i%j == 0:
break
else:
for k in range(i+i,n,i):
if hurui[k] != k:
... | from math import ceil, sqrt
def eratosthenes(n):
hurui = [i for i in range(n + 1)]
for i in range(2, ceil(sqrt(n)) + 1):
for j in range(2, ceil(sqrt(i)) + 1):
if i == 2:
continue
if i % j == 0:
break
else:
for k in... | p03476 |
def check(i):
num=int(i**0.5)
if i==1:return 0
if i==2:return 1
for j in range(2,num+1):
if i%j==0:break
else:return 1
return 0
q=int(eval(input()))
lr=[list(map(int,input().split())) for i in range(q)]
L=[0]*(10**5+1)#0~100000
for i in range(10**5+1):
if i%2==0:
... | def check_prime(k):
'''
素数の時1、合成数の時0を返す
'''
if k == 1:return 0
num = int(k ** 0.5 // 1)
for i in range(2, num + 1):
if k % i == 0:return 0
return 1
q = int(eval(input()))
lr = []
l_min = 10 ** 9
r_max = 0
for i in range(q):
l, r = list(map(int,input().split()))
... | p03476 |
Q = int(eval(input()))
from functools import lru_cache
@lru_cache(maxsize=None)
def is_prime(n: int):
if n == 2:
return True
if n == 1 or n % 2 == 0:
return False
for p in range(3, int(n**0.5)+1, 2):
if n % p == 0:
return False
return True
like_2017s =... | Q = int(eval(input()))
import math
def sieve_of_erastosthenes(num):
input_list = [False if i % 2 == 0 or i % 3 == 0 or i % 5 == 0 else True for i in range(num)]
input_list[0] = input_list[1] = False
input_list[2] = input_list[3] = input_list[5] = True
sqrt = math.sqrt(num)
for serial in ran... | p03476 |
import math
import bisect
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
prime=set([2])
for i in range(3,100001):
if i%2!=0 and is_prime(i):
prime.add(i)
sim_prime=[]
for p in pri... | import math
import bisect
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n)) + 1):
if n % k == 0:
return False
return True
prime=set([2])
for i in range(3,100001):
if i%2!=0 and is_prime(i):
prime.add(i)
sim_prime=[]
for p in pri... | p03476 |
def gen_is_prime(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
# return [i for i in range(n + 1) if is_prime[i]]
return is_prime
if __name__ == "__main__":
... | from itertools import accumulate
def gen_primes(n: int) -> set:
if n < 2:
return set()
is_prime = [True] * n
for i in range(3, n, 2):
if is_prime[i]:
is_prime[i * i:: 2 * i] = [False] * ((n - i * i - 1) // (2 * i) + 1)
return {2} | {i for i in range(3, n, 2) if is... | p03476 |
from itertools import accumulate
def get_primes_til(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, int(n ** .5) + 1):
for j in range(2 * i, n + 1, i):
primes[j] = False
return primes
N_MAX = 10 ** 5
primes = get_primes_til(N_... | from itertools import accumulate
def get_prime_numbers_til(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1) / 2) + 1):
if p[i]:
for j in range(2 * i * (i + 1), m, 2 * i + 1):
p[j] = False
return... | p03476 |
from itertools import accumulate
def get_primes_til(n):
primes = [True] * (n + 1)
primes[0] = False
primes[1] = False
for i in range(2, int(n ** .5) + 1):
for j in range(2 * i, n + 1, i):
primes[j] = False
return {i for i in range(2, n + 1) if primes[i]}
N_MAX = ... | from itertools import accumulate
def get_primes_til(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n ** .5) + 1):
if is_prime[i]:
for j in range(2 * i, n + 1, i):
is_prime[j] = False
return {i for i in ra... | p03476 |
from itertools import accumulate
def get_primes_til(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n ** .5) + 1):
if is_prime[i]:
for j in range(2 * i, n + 1, i):
is_prime[j] = False
return {i for i in ra... | from itertools import accumulate
l = {79873, 3, 5, 45061, 90121, 13, 12301, 36877, 51217, 75793, 65557, 8221, 57373, 16417, 53281, 37, 36901, 38953, 51241, 22573, 18481, 36913, 20533, 63541, 88117, 41017, 47161, 61, 30781, 32833, 38977, 69697, 94273, 73, 6217, 4177, 34897, 55381, 2137, 10333, 22621, 14437, 82021, ... | p03476 |
# import sys
import math
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
# INF = sys.maxsize
# ===CODE===
q = int(eval(input()))
condition = 10 ** 5
data = []
for i in range(q):
l, r = list(map(int, input().split()))
data.appe... | # import sys
import math
# import copy
# import heapq
# from collections import deque
# import decimal
# sys.setrecursionlimit(100001)
# INF = sys.maxsize
# ===CODE===
q = int(eval(input()))
condition = 10 ** 5
data = []
for i in range(q):
l, r = list(map(int, input().split()))
data.appe... | p03476 |
import math
def is_prime(n):
if n == 1:
return False
if not isinstance(n,int):
return False
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return False
return True
Q=int(eval(input()))
L,R=[],[]
for i in range(Q):
l,r = list(map(int,inpu... | import math
def is_prime(n):
if n == 1:
return False
if not isinstance(n,int):
return False
for i in range(2, int(math.sqrt(n)) + 1):
if n % i == 0:
return False
return True
Q=int(eval(input()))
L,R=[],[]
for i in range(Q):
l,r = list(map(int,inpu... | p03476 |
def prime(n):
is_prime=[True]*(n+1)
is_prime[0],is_prime[1]=False,False
for i in range(2,int(n**0.5)+1):
if not is_prime[i]:continue
for j in range(i*2,n+1,i):
is_prime[j]=False
return [i for i in range(n+1) if is_prime[i]]
prime_number=prime(10**5)
number=[i for i... | """def prime(n):
is_prime=[True]*(n+1)
is_prime[0],is_prime[1]=False,False
for i in range(2,int(n**0.5)+1):
if not is_prime[i]:continue
for j in range(i*2,n+1,i):
is_prime[j]=False
return [i for i in range(n+1) if is_prime[i]]
prime_number=prime(10**5)
number=[i fo... | p03476 |
from itertools import accumulate
def prm(x):
if x == 1 or x == 4:
return False
for i in range(2,int(x**0.5+1)):
if x%i==0:
return False
else:
return True
def like2017(x):
if x == 2:
return False
if prm(x) and prm((x+1)//2):
return True... | from itertools import accumulate
import sys
input=sys.stdin.readline
def prm(x):
if x == 1 or x == 4:
return False
for i in range(2,int(x**0.5+1)):
if x%i==0:
return False
else:
return True
def like2017(x):
if x == 2:
return False
if prm(x) a... | p03476 |
import sys
input = sys.stdin.readline
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in range(n + 1) if is_prime[i]]
a = primes(100000)
... | import sys
input = sys.stdin.readline
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return is_prime
a = primes(100000)
resemble = []
for i in range(le... | p03476 |
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, n + 1):
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return is_prime
a = primes(100000)
resemble = []
for i in range(len(a)):
if a[i]:
if a[(i+1)//... | def prime_list(n):
# n以下の自然数で素数か否かのリストを作成
ans = [True for _ in range(n+1)]
ans[0] = False
ans[1] = False
for i in range(2,n+1):
if ans[i]:
for j in range(2*i,n+1,i):
ans[j] = False
return ans
prime = prime_list(10**5)
like = [0 for i in range(10**... | p03476 |
import math
q = int(eval(input()))
list_range = [list(map(int, input().split())) for _ in range(q)]
max_range = math.sqrt(10**5)
list_search = [i for i in range(2, 10**5 + 1)]
list_prime = []
while list_search[0] <= max_range:
list_prime.append(list_search[0])
temp = list_search[0]
list_search = [i for... | q = int(eval(input()))
list_range = [list(map(int, input().split())) for _ in range(q)]
list_flag_prime = [1 for i in range(10**5+1)]
list_flag_prime[0:2] = [0, 0]
for i in range(2, 10**5+1):
if list_flag_prime[i] == 1:
for j in range(2*i, 10**5+1, i):
list_flag_prime[j] = 0
list_subj = [0 for i... | p03476 |
def prime_table(n):
arr = [True]*(n+1)
arr[0], arr[1] = False, False
for i in range(2, N+1):
if not arr[i]: continue
j = 2*i
while j <= n:
arr[j] = False
j += i
return arr
N = 10**5
pt = prime_table(N)
cum = [0]*(N+1)
for i in range(1, N+1, 2)... | def prime_table(n):
prime = [True]*(n+1)
prime[0], prime[1] = False, False
i = 2
while i*i <= n:
if not prime[i]:
i += 1
continue
j = 2*i
while j <= n:
prime[j] = False
j += i
i += 1
return prime
N = 10**5
... | p03476 |
import bisect
def era(n):
data=[i for i in range(2,n+1)]
for d in data:
data=[x for x in data if(x==d or x%d != 0)]
return data
Q=int(eval(input()))
l=[]
r=[]
up=0
for i in range(Q):
a,b=list(map(int,input().split()))
up=max([up,a,b])
l.append(a)
r.append(b)
s=... | import math
import bisect
def era(n):
data=[i for i in range(2,n+1)]
for d in data:
data=[x for x in data if(x==d or x%d != 0)]
return data
def prime(n):
max=int(math.sqrt(n))
li=[i for i in range(2,n+1)]
primes=[]
while li[0]<=max:
primes.append(li[0])
... | p03476 |
def eratosthenes(n):
prime = [2]
if n == 2:
return prime
limit = int(n ** 0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
... | def eratosthenes(n):
prime = [2]
if n == 2:
return prime
limit = int(n ** 0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
... | p03476 |
f=[True]*(10**5+1)
like=[False]*(10**5+1)
f[0]=False
f[1]=False
import math
for i in range(2,len(f)):
fact=True
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
fact=False
break
if fact:
f[i]=True
if i*2-1<len(like):
like[i*2-1]=True
for p in range(i*2,len(f),... | f=[True]*(10**5+1)
like=[False]*(10**5+1)
f[0]=False
f[1]=False
import math
for i in range(2,len(f)):
if not f[i]:
continue
fact=True
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
fact=False
break
if fact:
f[i]=True
if i*2-1<len(like):
like[i*2-1]=True
... | p03476 |
f=[True]*(10**5+1)
like=[False]*(10**5+1)
f[0]=False
f[1]=False
import math
for i in range(2,len(f)):
if not f[i]:
continue
fact=True
for j in range(2,int(math.sqrt(i))+1):
if i%j==0:
fact=False
break
if fact:
f[i]=True
if i*2-1<len(like):
like[i*2-1]=True
... | Q=int(eval(input()))
fact=[True]*(10**5+1)
fact[0]=False
fact[1]=False
num=[0]*(10**5+1)
cur=0
for i in range(len(fact)):
if fact[i]:
for j in range(i*2,len(fact),i):
fact[j]=False
if fact[(i+1)//2]:
cur+=1
num[i]=cur
for i in range(Q):
l,r=list(map(int,input().split(... | p03476 |
p,q,r = [2],[],[]
k = 3
while k < 100000:
flag = True
for t in p:
if t*t > k:
break
if k%t == 0:
flag = False
if flag:
p.append(k)
k += 2
for t in p[1:]:
if (t+1)//2 in p:
q.append(t)
q.append(100000+3)
k = 0
for i in range(99999//2+1):
while q[k]<=2*i+1:
k... | N = 10**5
p = [0]*(N+1)
q = [0]*(N+1)
p[2] = 1
primes = [2]
for i in range(3,N+1):
f = 1
for t in primes:
if t*t > i:
break
if i%t == 0:
f = 0
break
if f == 1:
primes.append(i)
p[i] = 1
if p[(i+1)//2]:
q[i] = 1
m = 0
s = [0]*(N+1)
for i in range(... | p03476 |
# https://atcoder.jp/contests/abc084/tasks/abc084_d
from bisect import bisect_left, bisect_right
q = int(eval(input()))
queries = []
MAX = 0
for _ in range(q):
l, r = list(map(int, input().split()))
queries.append((l, r))
MAX = max([MAX, l, r])
def is_prime(x):
sqrt = x ** 0.5
i = 2
... | # https://atcoder.jp/contests/abc084/tasks/abc084_d
from bisect import bisect_left, bisect_right
q = int(eval(input()))
queries = []
MAX = 0
for _ in range(q):
l, r = list(map(int, input().split()))
queries.append((l, r))
MAX = max([MAX, l, r])
from datetime import datetime
s = datetime.now()
def... | p03476 |
import math
def get_sieve_of_eratosthenes(n):# エラトステネスのふるい(O(NloglogN)). ~nまでの素数をリストで返す.
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
wh... | import math
def get_sieve_of_eratosthenes(n):# エラトステネスのふるい(O(NloglogN)). ~nまでの素数をリストで返す.
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = []
limit = math.sqrt(n)
data = [i + 1 for i in range(1, n)]
wh... | p03476 |
import math
import bisect
Q=int(eval(input()))
querys = [list(map(int,input().split())) for x in range(Q)]
def siever(x):
nums = [a for a in range(2,x+1)]
primes = []
while nums[0] <= int(math.sqrt(x))+1:
tmp = nums.pop(0)
primes.append(tmp)
for num in nums:
if num%tmp == 0:
... | import math
Q=int(eval(input()))
querys = [list(map(int,input().split())) for x in range(Q)]
large = max(q[1] for q in querys)
like2017 = [0]*(large+1)
#siever
cands = [False if (5 < i and (i%2)*(i%3)*(i%5) == 0) or (i < 2) or (i == 4) else True for i in range(large+1)]
if 5 <= large:
for i in range(6,int(m... | p03476 |
def solve():
q = int(eval(input()))
l, r = [], []
for _ in range(q):
tmp_l, tmp_r = list(map(int, input().split(" ")))
l.append(tmp_l)
r.append(tmp_r)
p = [True for i in range(100000)]
p[0] = p[1] = False
for i in range(2, 100000):
if p[i]:
... | def prime_TorF(n):
p = [True for i in range(n)]
p[0] = p[1] = False
for i in range(2, 100000):
if p[i]:
for j in range(2 * i, 100000, i):
p[j] = False
return p
def solve():
q = int(eval(input()))
l, r = [], []
for _ in range(q):
t... | p03476 |
import math
q=int(eval(input()))
lr=[list(map(int, input().split())) for i in range(q)]
l,r=[],[]
for a in lr:
l.append(a[0])
r.append(a[1])
ss = [i for i in range(1,max(r)+1)]
for i in range(2,int(math.sqrt(max(r)))+1):
for j in range(2*i,max(r)+1,i):
ss[j-1]=0
for j in range(q):
... | q=int(eval(input()))
lr=[list(map(int, input().split())) for i in range(q)]
l,r=[],[]
for a in lr:
l.append(a[0])
r.append(a[1])
mr=max(r)
x = [True]*(mr+1)
x[0]=False
x[1]=False
for i in range(mr+1):
if x[i]:
for j in range(2*i, mr+1, i):
x[j] = False
c=[0]*(mr+1)
for i... | p03476 |
import bisect
def PN(N):
for i in range(2,int(N**0.5)+1):
if N%i==0:
return False
return True
N=[3]
for i in range(5,100001,2):
if PN(i) and PN((i+1)//2):
N.append(i)
Q=int(eval(input()))
for i in range(Q):
l,r=list(map(int,input().split()))
ln1=bisec... | def PrimeNumber(N):
f=[1]*(N+1)
f[0]=0
f[1]=0
for i in range(2,N+1):
if f[i]==0:
continue
j = 2
temp = i
while temp * j <= N:
f[temp*j]=0
j += 1
return f
PN=PrimeNumber(100000)
C=[0]*100001
C[1]=0
for i in ... | p03476 |
# -*- coding: utf-8 -*-
import sys
import random
def main():
Q = int(eval(input()))
maps = []
r_max = 0
for _ in range(Q):
l, r = list(map(int, input().split(" ")))
maps.append((l, r))
if r_max < r:
r_max = r
#marix = getPrimeNumList(r_max)
base = [0] * (r_max+1)
counts = 0
... | # -*- coding: utf-8 -*-
import sys
import random
def main():
Q = int(eval(input()))
maps = []
r_max = 0
for _ in range(Q):
l, r = list(map(int, input().split(" ")))
maps.append((l, r))
if r_max < r:
r_max = r
#marix = getPrimeNumList(r_max)
base = [0] * (r_max+1)
counts = 0
... | p03476 |
# -*- coding: utf-8 -*-
import sys
import copy
import collections
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import math
# NO, PAY-PAY
#import numpy as np
#import statistics
#from statistics import mean, median,var... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
import collections
import copy
import heapq
from collections import defaultdict
from heapq import heappop, heappush
import itertools
input = sys.stdin.readline
##### リストの 二分木検索 #####
# bisect_le... | p03476 |
def d_2017LikeNumber(Q, I): # Q:クエリの数、I:探索区間の左端と右端
def prime_list(M):
# 0以上M以下の素数のリスト
s = [True] * (M + 1) # i番目の要素はiが素数ならTrue、非素数ならFalse
s[0] = s[1] = False
for x in range(2, int(M**0.5) + 1):
if s[x]:
for i in range(x + x, len(s), x):
... | def d_2017_like_number():
Q = int(eval(input()))
I = [[int(i) for i in input().split()] for j in range(Q)]
def prime_table(n):
"""n 以下の整数がそれぞれ素数かどうかのリスト (エラトステネスの篩)"""
is_prime = [True] * (n + 1)
is_prime[0] = is_prime[1] = False # 0と1は素数でない
for j in range(2, int(n*... | p03476 |
from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | p03476 |
from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | p03476 |
from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | p03476 |
from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | p03476 |
from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [True] * m
for i in range(1, int((n ** 0.5 - 1... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 - 1) /... | p03476 |
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 ... | from sys import stdin, setrecursionlimit
from itertools import accumulate
setrecursionlimit(10 ** 9)
INF = 1 << 60
def input():
return stdin.readline().strip()
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 - 1) /... | p03476 |
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 ... | import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 ... | p03476 |
import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 ... | import sys
from itertools import accumulate
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
def prime_numbers(n):
if n < 2:
return []
m = (n + 1) // 2
p = [1] * m
for i in range(1, int((n ** 0.5 ... | p03476 |
import math
from itertools import accumulate
def is_prime(n):
if n == 1: return False
for k in range(2, int(math.sqrt(n))+1):
if n % k == 0: return False
return True
MAX = (10**5)+1
q = int(eval(input()))
A = [1 if is_prime(i)and is_prime((i + 1)//2) else 0 for i in range(MAX) ]
S = [0] + list(a... | from itertools import accumulate
def primes(n):
prime = ([False]*2) + ([True]*(n-2))
for i in range(2, n):
if prime[i]:
for j in range(i*2, n, i):
prime[j] = False
return prime
MAX = (10**5)+1
is_prime = primes(MAX)
q = int(eval(input()))
A = [1 if is_prime[i] and is_prime[(i + 1)... | p03476 |
q=int(eval(input()))
P2017=[]
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return [i for i in... | import sys
input=lambda: sys.stdin.readline().rstrip()
n=10**5
is_prime=[True]*(n+1)
is_prime[0]=False
is_prime[1]=False
for i in range(2,int(n**0.5)+1):
if not is_prime[i]:
continue
for j in range(i*2,n+1,i):
is_prime[j]=False
A=[0]*n
def f(x):
return is_prime[x] and is_prime[(x+1)//2]
fo... | p03476 |
Q = int(eval(input()))
def isPrime(p):
for i in range(2, int(p**0.5)+1):
if p % i == 0:
return False
return True
F = [1]*(10**5+1)
F[0], F[1] = 0, 0
for j in range(2, len(F)):
if isPrime(j) == True:
for k in range(j*2, len(F), j):
F[k] = 0
for e in r... | # D - 2017-like Number
def isPrime(p):
for i in range(2, int(p**0.5)+1):
if p % i == 0:
return False
return True
q=int(eval(input()))
f=[1]*(10**5+1)
f[0],f[1]=0,0
for i in range(2,len(f)):
if isPrime(i):
for j in range(i*2,len(f),i):
f[j]=0
c=[0]*(... | p03476 |
def isPrime(x):
for i in range(2,int(x**0.5)+1):
if x%i==0:
return False
return True
q=int(eval(input()))
f=[1]*(10**5+1)
f[0],f[1]=0,0
n=len(f)
for i in range(2,n):
if isPrime(i):
for j in range(i*2,n,i):
f[j]=0
c=[0]*(10**5+1)
for i in range(2,10**5+1):
if i%2==1:
i... | from itertools import accumulate
import sys
input = sys.stdin.buffer.readline
def sieve(n):
f = []
is_prime = [True]*(n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]:
continue
for j in range(i*2, n+1, i):
... | p03476 |
def is_prime(n):
if n == 1:
return False
for i in range(2,int(n**0.5)+1):
if n % i == 0:
return False
return True
Q = int(eval(input()))
L = []
R = []
for i in range(Q):
l, r = list(map(int, input().split()))
L.append(l)
R.append(r)
n2017 = set()
... | def is_prime(n):
if n == 1:
return False
for i in range(2, int(n**0.5)+1):
if n % i == 0:
return False
return True
Q = int(eval(input()))
LR = []
for i in range(Q):
l, r = list(map(int, input().split()))
LR.append((l, r))
c2017 = [0]
total = 0
for i in... | p03476 |
import math
def eratos(num):
isPrime = [True] * (num + 1)
isPrime[0] = isPrime[1] = False
for i in range(2, int(math.sqrt(num))):
for j in range(2 * i, num, i):
isPrime[j] = False
return isPrime
def isLike(isPrime):
n = len(isPrime)
array = [False] * (n - 1)... | thres = 10 ** 5
isPrime = [True] * (thres + 5)
isPrime[0] = isPrime[1] = False
idx = 2
while (idx * idx) <= thres:
if isPrime[idx] is True:
for k in range(idx + idx, thres, idx):
isPrime[k] = False
idx += 1
isLike = [False] * (thres + 5)
isLike[0] = False
for i in range(1, thr... | p03476 |
import math
import itertools
Q = int(eval(input()))
query = [list(map(int,input().split())) for i in range(Q)]
def is_prime(n):
if n <= 0:return None
if n == 1:return False
sup = math.floor(pow(n,1/2))
for i in range(2,sup+1):
if n % i == 0:
... | import sys,math,itertools
input = sys.stdin.readline
Q = int(eval(input()))
query = [list(map(int,input().split())) for i in range(Q)]
def is_prime(n):
if n <= 0:return None
if n == 1:return False
sup = math.floor(pow(n,1/2))
for i in range(2,sup+1):
if n % i =... | p03476 |
import sys,math,itertools
input = sys.stdin.readline
Q = int(eval(input()))
query = [list(map(int,input().split())) for i in range(Q)]
def is_prime(n):
if n <= 0:return None
if n == 1:return False
sup = math.floor(pow(n,1/2))
for i in range(2,sup+1):
if n % i =... | import sys
input = sys.stdin.readline
from itertools import accumulate
import math
def is_prime(n):
if n <= 0: return None
if n == 1: return False
sup = math.floor(pow(n,1/2))
for i in range(2,sup+1):
if n % i == 0:
return False
return True
Q = int(eval(input(... | p03476 |
import sys
input = sys.stdin.readline
from itertools import accumulate
import math
def is_prime(n):
if n <= 0: return None
if n == 1: return False
sup = math.floor(pow(n,1/2))
for i in range(2,sup+1):
if n % i == 0:
return False
return True
Q = int(eval(input(... | def sieve(N):
global table,prime
table = [True]*(N+1)
table[0] = False
table[1] = False
prime = []
for i in range(2,N+1):
if table[i]:
prime.append(i)
for j in range(2*i,N+1,i):
table[j] = False
def accmulate(array):
global cs
... | p03476 |
n = 10**5
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
is_simular_2017 = is_prime.copy()
for i in range(n + 1):
if is_prime[i] and (i ... | import bisect
n = 10**5
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
num = [0] * (n + 1)
cnt = 0
for i in range(n + 1):
if is_prim... | p03476 |
def erastotenes(n):
prime=[2]
limit=int(n**0.5)
data=[i+1 for i in range(2, n, 2)] #奇数のリストを作成
while True:
p=data[0]
if p>=limit:
return prime+data
prime.append(p)
data=[e for e in data if e%p!=0]
naturals=erastotenes(100000)
q=int(eval(in... | def get_isPrime(n): #1~nまでの数で、素数は1、それ以外は0となるようなリストを返す
isprime=[1]*(n+1)
isprime[0]=0
isprime[1]=0
for i in range(2, int(n**0.5)+1):
if not isprime[i]:
continue
for j in range(i*2, n+1, i):
isprime[j]=0
return isprime
max_n=100000
isprime=g... | p03476 |
def get_isPrime(n): #1~nまでの数で、素数は1、それ以外は0となるようなリストを返す
isprime=[1]*(n+1)
isprime[0]=0
isprime[1]=0
for i in range(2, int(n**0.5)+1):
if not isprime[i]:
continue
for j in range(i*2, n+1, i):
isprime[j]=0
return isprime
max_n=100000
isprime=g... | from itertools import chain, accumulate
def prime_set(N):
"""
Nまでの素数のsetを返す
"""
if N < 4:
return ({}, {}, {2}, {2, 3})[N]
Nsq = int(N ** 0.5 + 0.5) + 1
primes = {2, 3} | set(chain(range(5, N + 1, 6), range(7, N + 1, 6)))
for i in range(5, Nsq, 2):
if i in primes... | p03476 |
y, m, d = list(map(int, input().split('/')))
ans = 'Heisei'
if y >= 2019:
if m > 4:
ans = 'TBD'
print(ans) | print(('TBD' if int(input().split('/')[1]) > 4 else 'Heisei')) | p03109 |
s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019:
if s[1] <= 4:
if s[2] <= 30:
p = "Heisei"
print(p) | s = input().split("/")
for i in range(3):
s[i] = int(s[i])
p = "TBD"
if s[0] <= 2019 and s[1] <= 4 and s[2] <= 30:
p = "Heisei"
print(p)
| p03109 |
print(('TBD'if int(input().split('/')[1])>4 else 'Heisei')) | a,b,c=list(map(int,input().split('/')))
print(('Heisei'if b<5 else'TBD')) | p03109 |
print('Heisei') if int(input()[5:7])<=4 else print('TBD')
| print(('Heisei' if int(input()[5:7])<=4 else 'TBD')) | p03109 |
print((["Heisei","TBD"][int(input()[5:7])>4])) | print((["Heisei","TBD"][input()[5:7]>"04"])) | p03109 |
s = int(input().replace("/",""))
if s<= 20190430:
print("Heisei")
else:
print("TBD") | y, m, d = list(map(int, input().split("/")))
if y < 2019:
print("Heisei")
elif y == 2019 and m <= 4:
print("Heisei")
else:
print("TBD") | p03109 |
a,b,c=list(map(str,input().split('/')))
d=int(a+b+c)
if d<=20190430:
print('Heisei')
else:
print('TBD') | a,b,c=list(map(str,input().split('/')))
d=int(a+b+c)
if d>20190430:
print('TBD')
else:
print('Heisei') | p03109 |
import datetime
y,m,d=list(map(int,input().split('/')))
print(('Heisei' if datetime.datetime(y, m, d, 0, 0) <= datetime.datetime(2019, 4, 30, 0, 0) else 'TBD')) | print(('Heisei' if '20190430' >= ''.join(input().split('/')) else 'TBD'))
| p03109 |
y,m,d = input().split('/')
if int(y)<=2019 and (int(m)<=4 and int(d)<=30):
print("Heisei")
else:
print("TBD") | y,m,d = input().split('/')
if int(y)<=2019 and int(m)<=4 and int(d)<=30: print("Heisei")
else: print("TBD") | p03109 |
#n = int(input())
a,b,c=list(map(int,input().split("/"))) #横並び
#x=[int(input()) for i in range(3)] #縦に並んだのを配列に
#y=list(map(int,input().split())) #横に並んだのを配列に
if b<4 :print("Heisei")
elif b==4 and c<=30 :print("Heisei")
else :print("TBD")
#print('YNEOS'[1::2])
| a,b,c=list(map(int,input().split("/")))
if b<4 :print("Heisei")
elif b==4 and c<=30 :print("Heisei")
else :print("TBD")
| p03109 |
import datetime
if '2019-04-30' >= input().replace('/','-'):
print('Heisei')
else:
print('TBD') | if '2019-04-30' >= input().replace('/','-'):
print('Heisei')
else:
print('TBD') | p03109 |
s=input();print("Heisei") if s[5:7]<="04" else print("TBD")
| print("Heisei") if input()[5:7]<="04" else print("TBD")
| p03109 |
import datetime
y,m,d=list(map(int, input().split("/")))
print(("Heisei" if datetime.date(y, m, d)<=datetime.date(2019, 4, 30) else "TBD"))
| import datetime
*s, = list(map(int, input().split("/")))
ref = datetime.datetime(2019, 4, 30)
print(("Heisei" if datetime.datetime(s[0], s[1], s[2]) <= ref else "TBD"))
| p03109 |
import sys
rr = lambda: sys.stdin.readline().rstrip()
s = rr()
if int(s[5:7]) > 4:
print('TBD')
else:
print('Heisei') | import sys
rr = lambda: sys.stdin.readline().rstrip()
s = rr()
if s[5:7] > '04':
print('TBD')
else:
print('Heisei')
| p03109 |
d=int(input().replace("/",""))
print(("Heisei" if 20190430 - d >= 0 else "TBD")) | print(("Heisei" if 20190430 - int(input().replace("/","")) >= 0 else "TBD")) | p03109 |
H, N = list(map(int, input().split()))
A = []
for i in range(N):
a = list(map(int, input().split()))
A.append(a)
INF = float('INF')
MAX_J = (10 ** 4 + 1) * 2
# DP[i][j]: i番目までの魔法を使って、ダメージの総和をjにする魔力の最小値
DP = [INF] * MAX_J
DP[0] = 0
for i in range(N):
for j in range(MAX_J):
nj = min(... | H, N = list(map(int, input().split()))
A = []
for i in range(N):
a = list(map(int, input().split()))
A.append(a)
INF = float('INF')
# MAX_J = (10 ** 4 + 1) * 2
MAX_J = 10 ** 4 + 1
# DP[i][j]: i番目までの魔法を使って、ダメージの総和をjにする魔力の最小値
DP = [INF] * MAX_J
DP[0] = 0
for i in range(N):
for j in range(MAX... | p02787 |
H, N = list(map(int, input().split()))
A = []
for i in range(N):
a = list(map(int, input().split()))
A.append(a)
INF = float('INF')
# MAX_J = (10 ** 4 + 1) * 2
MAX_J = 10 ** 4 + 1
# DP[i][j]: i番目までの魔法を使って、ダメージの総和をjにする魔力の最小値
DP = [INF] * MAX_J
DP[0] = 0
for i in range(N):
for j in range(MAX... | """
https://atcoder.jp/contests/abc153/tasks/abc153_e
個数制限なしDP
一次元の配列を使うパターン。
"""
H, N = list(map(int, input().split()))
A = []
B = []
for i in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
INF = float('INF')
MAX_J = 10 ** 4 + 1
# DP[j]: ダメージの総和をjにする魔力の最小値
D... | p02787 |
h,n=list(map(int,input().split()))
MAX_NUM=9999999999
ab=[]
for _ in range(n):
ab.append(list(map(int,input().split())))
dp=[MAX_NUM for _ in range(h+1)]
dp[0]=0
for i in range(h):
if(dp[i]!=MAX_NUM):
for j in range(n):
a,b=ab[j]
ind = i+a if i+a<h else -1
... | h,n=list(map(int,input().split()))
ab=[]
for _ in range(n):
ab.append(list(map(int,input().split())))
max_a=max([a for a,b in ab])
dp=[0 for _ in range(h+max_a)]
for i in range(1,len(dp)):
dp[i]=min(dp[i-a]+b for a,b in ab)
print((min(dp[h:])))
#
# MAX_NUM=9999999999
# ab=[]
# for _ in range(n... | p02787 |
import math
import copy
def main():
H,N=list(map(int,input().split()))
#inf=float('inf')
dp=[0]+[1e8]*H
for i in range(N):
A,B=list(map(int,input().split()))
if A>=H:
dp[-1]=min(B,dp[-1])
else:
for j in range(A,H+1):
dp[j]... | import math
def main():
H,N=list(map(int,input().split()))
inf=float('inf')
dp=[0]+[inf]*H
for i in range(N):
A,B=list(map(int,input().split()))
if A>=H:
#dp[-1]=min(B,dp[-1])
if B < dp[-1]:
dp[-1]=B
else:
for ... | p02787 |
def main():
H, N = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for _ in range(N)]
INF = float("inf")
dp = [[INF for _ in range(H+1)] for _ in range(N+1)]
dp[0][0] = 0
for i in range(1, N+1):
for h in range(H+1):
aaa = h-ab[i-1][0... |
H,N = list(map(int, input().split()))
A = [0] * N
B = [0] * N
for i in range(N):
A[i], B[i] = list(map(int, input().split()))
INF = float("inf")
dp = [[INF for _ in range(H+1)] for _ in range(N+1)]
dp[0][0] = 0
# 個数制限なしナップザック
for i in range(N):
for j in range(H+1):
if A[i] > j:
... | p02787 |
h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
# 最強の魔法の特定
a_max = max(a for a, b in ab)
# 動的計画法用の配列の定義及び初期化
dp = [0]*(h + a_max)
for i in range(h + a_max):
if i > 0:
dp[i] = min(dp[i - a] + b for a, b in ab)
print((min(dp[h:]))) | h, n = list(map(int, input().split()))
ab = [list(map(int, input().split())) for i in range(n)]
# 最強の魔法の特定
a_max = max(a for a, b in ab)
# 動的計画法用の配列の定義及び初期化
dp = [0]*(h + a_max)
for i in range(1, h + a_max):
dp[i] = min(dp[i - a] + b for a, b in ab)
print((min(dp[h:]))) | p02787 |
# coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import defaultdict
# import math
# from itertools import product, accumulate, combinations, product
# import bise... | # coding: utf-8
import sys
# from operator import itemgetter
sysread = sys.stdin.readline
read = sys.stdin.read
sys.setrecursionlimit(10 ** 7)
from heapq import heappop, heappush
#from collections import defaultdict
# import math
# from itertools import product, accumulate, combinations, product
# import bise... | p02787 |
h,n=list(map(int,input().split()))
INF=10**15
a=[]
b=[]
for i in range(n):
A,B=list(map(int,input().split()))
a.append(A)
b.append(B)
dp=[INF]*20010
dp[0]=0
for i in range(20010):
for j in range(n):
if i>=a[j]:
dp[i]=min(dp[i],dp[i-a[j]]+b[j])
ans=min(dp[h:])
print(ans... | h,n=list(map(int,input().split()))
INF=10**12
a=[]
b=[]
for i in range(n):
A,B=list(map(int,input().split()))
a.append(A)
b.append(B)
dp=[INF]*20010
dp[0]=0
for i in range(20010):
for j in range(n):
if i>=a[j]:
dp[i]=min(dp[i],dp[i-a[j]]+b[j])
ans=min(dp[h:])
print(ans... | p02787 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**10
h, n = [int(item) for item in input().split()]
MAX_LEN = h + 10**4 + 1
dp = [INF] * MAX_LEN
dp[0] = 0
for i in range(n):
v, w = list(map(int, input().split()))
for j in range(h+1):
if dp[j] != INF and dp[j] + w < dp[... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9
def main():
h, n = [int(item) for item in input().split()]
MAX_LEN = h + 10**4 + 1
dp = [0] + [INF] * MAX_LEN
for _ in range(n):
v, w = list(map(int, input().split()))
for j in range(h+1):
... | p02787 |
#!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9
def main():
h, n = [int(item) for item in input().split()]
MAX_LEN = h + 10**4 + 1
dp = [0] + [INF] * MAX_LEN
for _ in range(n):
v, w = list(map(int, input().split()))
for j in range(h+1):
... | #!/usr/bin/env python3
import sys
input = sys.stdin.readline
INF = 10**9
def main():
h, n = [int(item) for item in input().split()]
MAX_LEN = h + 10**4 + 1
dp = [0] + [INF] * MAX_LEN
for _ in range(n):
v, w = list(map(int, input().split()))
for j in range(h+1):
... | p02787 |
H, N = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
inf = 10 ** 9 + 7
dp = [[inf] * (H + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(H + 1):
dp[i + 1][j] = min(dp[i + 1][j], dp[i][j])
dp[i + 1][min(j + X[i][0], H)] =... |
H, N = list(map(int, input().split()))
X = [list(map(int, input().split())) for _ in range(N)]
INF = 10 ** 9 + 7
dp = [[INF] * (H + 1) for _ in range(N + 1)]
dp[0][0] = 0
for i in range(N):
for j in range(H + 1):
dp[i + 1][j] = min(dp[i][j], dp[i + 1][j])
dp[i + 1][min(j + X[i][0], H... | p02787 |
import sys
input = sys.stdin.buffer.readline
from copy import deepcopy
from collections import deque
def main():
h, n = list(map(int, input().split()))
a = deque()
b = deque()
aa = a.append
ba = b.append
for _ in range(n):
numa, numb = list(map(int, input().split()))
... | def main():
h, n = list(map(int, input().split()))
ab = [tuple(map(int, input().split())) for _ in range(n)]
large_num = 10**9
dp = [large_num] * (h + 10**4 + 1)
dp[0] = 0
for abe in ab:
a = abe[0]
b = abe[1]
for i1 in range(h + 1):
if dp[i1 + a] >... | p02787 |
# E - Crested Ibis vs Monster
from collections import defaultdict
def main():
H, N, *AB = list(map(int, open(0).read().split()))
dp = defaultdict(lambda: 1 << 30) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for i in range(H):
if i not in dp:
c... | # E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 1) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for i in range(H):
if dp[i] == INF:
continue
for a, b in... | p02787 |
# E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for i in range(H):
if dp[i] == INF:
continue
for a, b in... | # E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for i in range(H):
if dp[i] == INF:
continue
for a, b in... | p02787 |
# E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for i in range(H):
for a, b in zip(*[iter(AB)] * 2):
dp[i + a] = ... | # E - Crested Ibis vs Monster
def main():
INF = 1 << 30
H, N, *AB = list(map(int, open(0).read().split()))
dp = [INF] * (H + 10001) # dp[i] := min magic points to decrease monster's health by i
dp[0] = 0
for a, b in zip(*[iter(AB)] * 2):
for i in range(H):
dp[i + a] = ... | p02787 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.