input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
s = list(str(input().rstrip('\n')))
s1 = collections.deque(s)
s2 = collections.deque(s)
while True:
ln = len(s1)
while True:
s1 = ... | import sys
import collections
def solve():
input = sys.stdin.readline
mod = 10 ** 9 + 7
n = int(input().rstrip('\n'))
s = list(str(input().rstrip('\n')))
s = collections.deque(s)
ds = collections.deque(s)
while s:
while True:
ll = len(s)
s = co... | p03696 |
# ?´???°?????°?????¨?????????????????°??????
import sys
prim_no = {}
def is_prime(no):
if no == 2:
return True
if no % 2 == 0:
return False
if prim_no.get(no) is not None:
return prim_no.get(no)
for i in range(3, no // 2):
if no % i == 0:
... | # ?´???°?????°?????¨?????????????????°??????
import sys
import math
prim_no = {} # ????????°????´???°??§??????????????????????????????
def is_prime(no):
if no == 2:
return True
if no % 2 == 0:
return False
if prim_no.get(no) is not None:
ret... | p00009 |
# ?´???°?????°?????¨?????????????????°??????
import sys
import math
prim_no = {} # ????????°????´???°??§??????????????????????????????
def is_prime(no):
if no == 2:
return True
if no % 2 == 0:
return False
if prim_no.get(no) is not None:
ret... | # ?´???°?????°?????¨?????????????????°??????
import sys
import math
prim_no = {} # ????????°????´???°??§??????????????????????????????
def is_prime(no):
if no == 2:
return True
if no % 2 == 0:
return False
if prim_no.get(no) is not None:
ret... | p00009 |
try:
while True:
n = int(eval(input()))
datasets = list(range(2, n+1))
answers = set([])
while datasets:
i = datasets[0]
datasets = [data for data in datasets if data%i != 0]
answers.add(i)
print((len(answers)))
except:
pass | def prime_number(n):
cache = {2}
a = 2
while a <= n:
if n < 2:
cache = {}
break
if not a in cache:
if not [x for x in cache if a % x == 0]:
cache.add(a)
a+=1
print((len(cache)))
try:
while True:
n=... | p00009 |
import sys
p=[1]*999999
p[0]=p[1]=0
p[4::2]=[0]*len(p[4::2])
for i in range(3,1000,2):p[i*i::i]=[0]*len(p[i*i::i])
for n in sys.stdin:print(p[0:int(n)+1].count(1)) | max_n = 999999
prime_list = [1] * (max_n + 1)
# 0, 1は素数ではない
prime_list[0:2] = [0, 0]
#
for i in range(2, int(max_n**0.5) + 1):
if prime_list[i] == 1:
prime_list[i**2::i] = [0] * len(prime_list[i**2::i])
while True:
try:
n = int(eval(input()))
print((sum(prime_list[:n + ... | p00009 |
# -*- coding: utf-8 -*-
import sys
for line in sys.stdin:
input_number = int(line.strip())
if input_number == 1:
print(0)
continue
elif input_number == 2:
print(1)
continue
prime_numbers = [2]
candidate_number = 3
while candidate_number <= inpu... | # -*- coding: utf-8 -*-
import sys
import math
for line in sys.stdin:
input_number = int(line.strip())
if input_number == 1:
print(0)
continue
elif input_number == 2:
print(1)
continue
prime_numbers = [2]
candidate_number = 3
while candidate_n... | p00009 |
import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n < 2 or n & 1 == 0:
return False
d = (n-1) >> 1
while d & 1 == 0:
d >>= 1
for i in range(5):
a = rand(1,n-1)
t = d
y = pow(a,t,n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= ... | import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n < 2 or n & 1 == 0:
return False
d = (n-1) >> 1
while d & 1 == 0:
d >>= 1
for i in range(4):
a = rand(1,n-1)
t = d
y = pow(a,t,n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= ... | p00009 |
import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n < 2 or n & 1 == 0:
return False
d = (n-1) >> 1
while d & 1 == 0:
d >>= 1
for i in range(4):
a = rand(1,n-1)
t = d
y = pow(a,t,n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= ... | import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n < 2 or n & 1 == 0:
return False
d = (n-1) >> 1
while d & 1 == 0:
d >>= 1
for i in range(3):
a = rand(1,n-1)
t = d
y = pow(a,t,n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= ... | p00009 |
import sys,random
rand = random.randint
def prime(n):
if n == 2:
return True
if n < 2 or n & 1 == 0:
return False
d = (n-1) >> 1
while d & 1 == 0:
d >>= 1
for i in range(3):
a = rand(1,n-1)
t = d
y = pow(a,t,n)
while t != n-1 and y != 1 and y != n-1:
y = pow(y,2,n)
t <<= ... | import sys
a = [True] * 1000000
for i in range(2,1000000):
if(a[i-1]):
for j in range(i**2-1, 1000000, i):
a[j] = False
for s in sys.stdin:
print((a[1:int(s)].count(True))) | p00009 |
import math
ans = []
while True:
try:
n = int(input())
if n < 2:
ans.append(0)
continue
prime_list = list(range(3, n + 1, 2))
prime_list.insert(0, 2)
head = prime_list[0]
i = 0
while head < math.sqrt(n):
for j in range(len(prime_list) - 1, 0, -1):
if (prime_list[j] % head == ... | import math
ans = []
while True:
try:
n = int(input())
isPrime = [False, False]
for i in range(n - 1):
isPrime.append(True)
i = 2
while i < math.sqrt(n):
j = i * 2
while j < len(isPrime):
isPrime[j] = False
j += i
i += 1
ans.append(isPrime.count(True))
except EOFError... | p00009 |
import math
ans = []
while True:
try:
n = int(input())
isPrime = [False, False]
for i in range(n - 1):
isPrime.append(-1)
i = 2
while i < math.sqrt(n):
j = i
while j < len(isPrime):
isPrime[j] = False
j += i
isPrime[i] = True
i = isPrime.index(-1)
ans.append(isPrim... | import math
ans = []
while True:
try:
n = int(input())
isPrime = [-1] * (n + 1)
isPrime[0], isPrime[1] = False, False
i = 2
while i * i < n:
j = i
while j < len(isPrime):
isPrime[j] = False
j += i
isPrime[i] = True
i = isPrime.index(-1)
ans.append(isPrime.count(True) +... | p00009 |
import sys
m=10**6;a=[1]*m;a[0:2]=0,0
for i in range(2,1000):
if a[i]>0:
for j in range(i*2,m,i):a[j]=0
for i in range(m):a[i]+=a[i-1]
for e in sys.stdin:print((a[int(e)]))
| import sys
m=10**6;a=[1]*m;a[0:2]=0,0
for i in range(2,999):
if a[i]>0:
for j in range(i*2,m,i):a[j]=0
for i in range(m):a[i]+=a[i-1]
for e in sys.stdin:print((a[int(e)]))
| p00009 |
import sys
m=10**6;a=[0,0]+[1]*m
for i in range(2,999):
if a[i]:
for j in range(i*2,m,i):a[j]=0
for e in sys.stdin:print((sum(a[:int(e)+1])))
| import sys
m=10**6;a=[0,0]+[1]*m
for i in range(999):
if a[i]:
for j in range(i*2,m,i):a[j]=0
for e in sys.stdin:print((sum(a[:int(e)+1])))
| p00009 |
import sys
m=10**6;a=[0,0]+[1]*m
for i in range(999):
if a[i]:
for j in range(i*2,m,i):a[j]=0
for e in sys.stdin:print((sum(a[:int(e)+1])))
| import sys
m=10**6;a=[0,0]+[1]*m
for i in range(999):
if a[i]:a[i*2::i]=[0 for j in a[i*2::i]]
for e in sys.stdin:print((sum(a[:int(e)+1])))
| p00009 |
import sys
a=[0,0]+[1]*10**6
for i in range(999):
if a[i]:a[i*2::i]=[0 for j in[0]*len(a[i*2::i])]
for e in sys.stdin:print((sum(a[:int(e)+1])))
| import sys
a=[0,0]+[1]*10**6
for i in range(999):
if a[i]:a[i*2::i]=[0]*len(a[i*2::i])
for e in sys.stdin:print((sum(a[:int(e)+1])))
| p00009 |
import sys
a=[0,0,1]+[1,0]*499999
for i in range(3,999,2):
if a[i]:a[i*2::i]=[0]*len(a[i*2::i])
for e in sys.stdin:print((sum(a[:int(e)+1])))
| import sys
a=[0,0,1]+[1,0]*499999
for i in range(3,999,2):
if a[i]:a[i*i::i]=[0]*len(a[i*i::i])
for e in sys.stdin:print((sum(a[:int(e)+1])))
| p00009 |
import sys
m=166666;a=[[1]*m for _ in[0]*2]
for i in range(m):
if a[0][i]:
k=6*i+5
a[0][i+k::k]=[0]*len(a[0][i+k::k])
a[1][-2-i+k::k]=[0]*len(a[1][-2-i+k::k])
if a[1][i]:
k=6*i+7
a[0][-2-i+k::k]=[0]*len(a[0][-2-i+k::k])
a[1][i+k::k]=[0]*len(a[1][i+k::k])
for e in map(int,sys.stdin):
print(([e... | import sys
m=166666;s=[1]*m;t=[1]*m
for i in range(m):
if s[i]:
k=6*i+5
s[i+k::k]=[0]*len(s[i+k::k])
t[-2-i+k::k]=[0]*len(t[-2-i+k::k])
if t[i]:
k=6*i+7
s[-2-i+k::k]=[0]*len(s[-2-i+k::k])
t[i+k::k]=[0]*len(t[i+k::k])
for e in map(int,sys.stdin):
print(([e-1,sum(s[:(e+1)//6])+sum(t[:(e-1)//6])... | p00009 |
import sys
m=166666;s=[1]*m;t=[1]*m
for i in range(m):
for j in range(2):
if (s[i],t[i])[j]:
k=6*i+[5,7][j];n=[i+k,k-i-2]
s[n[j]::k]=[0]*len(s[n[j]::k])
t[n[1-j]::k]=[0]*len(t[n[1-j]::k])
for e in map(int,sys.stdin):
print(([e-1,sum(s[:(e+1)//6])+sum(t[:(e-1)//6])+2][e>3]))
| import sys
a=[1]*500000
for i in range(3,999,2):
if a[i//2]:a[(i*i)//2::i]=[0]*len(a[(i*i)//2::i])
for e in map(int,sys.stdin):print(([e-1,sum(a[:(e+1)//2])][e>3]))
| p00009 |
import sys
a=[1]*500000
for i in range(3,999,2):
if a[i//2]:a[(i*i)//2::i]=[0]*len(a[(i*i)//2::i])
[print([e-1,sum(a[:(e+1)//2])][e>3])for e in map(int,sys.stdin)]
| import sys
m=500000;a=[1]*m
for i in range(3,999,2):
if a[i//2]:a[i*i//2::i]=[0]*((m-1-i*i//2)//i+1)
for e in map(int,sys.stdin):print(([e-1,sum(a[:(e+1)//2])][e>3]))
| p00009 |
def sieve(n):
nums = [i+1 for i in range(2, n, 2)]
ans = [2]
while len(nums) != 0:
for i in range(nums[0]*2, nums[-1]+1, nums[0]):
if i in nums: nums.remove(i)
ans.append(nums.pop(0))
return len(ans)
while True:
try:
print(sieve(eval(input())))
except:
break | #!/usr/bin/python
def judge_prime(n):
if n == 2: return True
if n < 2: return False
return pow(2, n-1, n) == 1
while True:
try:
ans = 0
for i in range(eval(input())):
if judge_prime(i+1):
ans += 1
print(ans)
except:
break | p00009 |
from collections import deque
import bisect
from math import sqrt
import sys
primes = deque([2, 3, 5, 7, 11, 13, 17, 19])
append = primes.append
for i in range(21, 1000000, 2):
for j in range(3, int(sqrt(i))+1, 2):
if i%j == 0:
break
else:
append(i)
for l in sys.stdin:
... | import bisect
import sys
n = 1000000
primes = {i for i in range(3, n, 2)}
for i in range(3, 1000, 2):
s = {j for j in range(i*2, n, i)}
primes -= s
primes = [2] + sorted(primes)
for l in sys.stdin:
print((bisect.bisect(primes, int(l)))) | p00009 |
import sys
import math
def isPrime(n):
if n < 2:
return False
elif n == 2:
return True
if n % 2 == 0:
return False
for i in range(3,math.ceil(math.sqrt(n))+1):
if n % i == 0:
return False
return True
for line in sys.stdin:
n = in... | import sys
for i in sys.stdin:
n = int(i)
arr = [i for i in range(0,n+1)]
for i in range(2, len(arr)):
if arr[i] != 0:
j = 2
while i*j <= n:
if arr[i*j] != 0:
arr[i*j] = 0
j += 1
primNum = 0
for i in arr:... | p00009 |
# -*- coding: utf-8 -*-
import sys
def isprime(n):
for i in range(2, int(n**0.5)+1):
if n % i == 0: return False
return True
limit = 1000000
ansList = [0]*limit # 1 is not prime
cnt = 0
for i in range(2, limit):
if isprime(i): cnt += 1
ansList[i-1] = cnt
#for line in ["999999... | # -*- coding: utf-8 -*-
import sys
limit = 1000000
prime01List = [1]*limit
prime01List[0] = 0 # 1 is not prime
for i in range(2, int(limit**0.5)+1):
n = 2*i
while(n <= limit):
prime01List[n-1] = 0
n += i
ansList = [0]*limit
cnt = 0
for i in range(limit):
cnt += prime01... | p00009 |
p = [1]
n = [0,0]
c = 0
for i in range(1,1000000):
p.append(0)
for i in range(2,1000000):
if p[i]==1 :
n.append(c)
continue
c += 1
n.append(c)
for j in range(i*i,1000000,i):
if p[j]==0 : p[j]=1
while True:
try:
nn = int(input())
print(n[nn]... | M = 10**6
p = [0]*(M+60)
sM = M**0.5
for x in range(1, int(sM/2)+1):
v = 4*x*x + 1; y = 8
while v <= M:
if v % 12 != 9: # v % 12 in [1, 5]
p[v] ^= 1
v += y; y += 8
for x in range(1, int(sM/3**0.5)+1, 2):
v = 3*x*x + 4; y = 12
while v <= M:
if v % 12 == 7... | p00009 |
# coding: utf-8
# Here your code !
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
max_num = int(math.sqrt(i... | # coding: utf-8
# Here your code !
import math
def is_prime_num(in_num):
cnt = 0
if in_num == 2:
return True
elif in_num <= 1:
return False
elif in_num % 2 == 0:
return False
else:
if pow(2, in_num-1, in_num) == 1:
return True
els... | p00009 |
while True:
try:
Num = 1
n = int(eval(input()))
for i in range(2,n+1):
for j in range(2,i):
if i % j == 0:
break
if j == i-1:
Num +=1
print(Num)
except EOFError:
bre... | DP = [0,1,2]
while True:
try:
n = int(eval(input()))
if len(DP) < n:
for i in range(len(DP) + 1,n+1):
YN = 0
for j in range(2,i - 1):
if i % j == 0:
DP.append(DP[len(DP) - 1])
... | p00009 |
lis=[1 for i in range(int(1e6+1))]
lis[0]=lis[1]=0
for i in range(int(1e6)+1):
if lis[i]:
for j in range(i*2,int(1e6+1),i):
lis[j]=0
while True:
try:
n=int(eval(input()))
cnt=0
for i in range(n+1):
if lis[i]:
cnt+=1
... | lis=[True for i in range(int(1e6+1))]
lis[0]=lis[1]=False
end=int(1e6**0.5)
for i in range(end+1):
if lis[i]:
for j in range(i*2,int(1e6+1),i):
lis[j]=False
while True:
try:
n=int(eval(input()))
cnt=0
for i in range(n+1):
if lis[i]:cnt+=1
... | p00009 |
lis=[True for i in range(int(1e6+1))]
lis[0]=lis[1]=False
end=int(1e6**0.5)
for i in range(end+1):
if lis[i]:
for j in range(i*2,int(1e6+1),i):
lis[j]=False
while True:
try:
n=int(eval(input()))
cnt=0
for i in range(n+1):
if lis[i]:cnt+=1
... | def sieve(n):
p=[True for i in range(n+1)]
p[0]=p[1]=False
end=int(n**0.5)
for i in range(2,end+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=False
return p
def solve(n):
if n<2:return 0
cnt=1
for i in range(3,n+1,2):
if p[i]:... | p00009 |
def isprime(n):
p = 3
while p * p <= n:
if n % p == 0: return False
p += 2
return True
while True:
try:
n = int(eval(input()))
except:
break
count = int(n >= 2)
for p in range(3,n + 1,2):
if isprime(p): count += 1
print(count) | while True:
try:
n = int(eval(input()))
except:
break
a = [0 for i in range(n + 1)]
# sieve
i = 3
while i * i <= n:
for j in range(3 * i, n + 1, 2 * i): a[j] = 1
i += 2
count = int(n >= 2)
count += sum(a[i] == 0 for i in range(3, n + 1, 2... | p00009 |
try:
while True:
n = eval(input())
ans = [1] * (n + 1);
ans[0] = ans[1] = 0;
for i in range(2, n + 1):
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
print(sum(ans))
except EOFError:
pass | try:
while True:
j = 0
n = eval(input())
ans = [1] * (n + 1);
ans[0] = ans[1] = 0;
for i in range(2, n + 1):
if i * 2 > n:
break
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
print(sum(ans))
except EOFError:
pass | p00009 |
try:
while True:
j = 0
n = eval(input())
ans = [1] * (n + 1);
ans[0] = ans[1] = 0;
for i in range(2, n + 1):
if i * 2 > n:
break
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
print(sum(ans))
except EOFError:
pass | try:
while True:
j = 0
n = eval(input())
ans = [1] * (n + 1);
ans[0] = ans[1] = 0;
for i in range(3, n + 1, 2):
if i * 2 > n:
break
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
for k in range(2 * 2, n + 1, 2):
ans[k] = 0
print(sum(ans))
except EOFError:... | p00009 |
try:
while True:
j = 0
n = eval(input())
ans = [1] * (n + 1);
ans[0] = ans[1] = 0;
for i in range(3, n + 1, 2):
if i * 2 > n:
break
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
for k in range(2 * 2, n + 1, 2):
ans[k] = 0
print(sum(ans))
except EOFError:... | def prime_count(n):
j = 0
ans = [1] * (n + 1)
ans[0] = ans[1] = 0
for i in range(3, n + 1, 2):
if i * 2 > n:
break
if ans[i] != 0:
for j in range(2 * i, n + 1, i):
ans[j] = 0
for k in range(2 * 2, n + 1, 2):
ans[k] = 0
print(sum(ans))
try:
while True:
n = eval(input())
prime... | p00009 |
# Prime Number
import sys
count = 0
primes = [2, 3]
for n in range(5, 1000001, 2):
isprime = True
for i in range(1, len(primes)):
count += 1
if primes[i] * primes[i] > n:
break
count += 1
if n % primes[i] == 0:
isprime = False
break
if isprime:
primes.append(n)
datas = []... | # Prime Number
import sys
MAX_NUM = 1000000
ROOT_MAX_NUM = 1000
primes = [1] * MAX_NUM
primes[0] = primes[1] = 0
for i in range(2, ROOT_MAX_NUM):
if not primes[i]:
continue
for j in range(i+i, MAX_NUM, i):
primes[j] = 0
datas = []
for line in sys.stdin:
datas.append(int(line))
for... | p00009 |
import sys
import math
N = 1000000
primes = [1] * N
primes[0] = 0
primes[1] = 0
primes[4::2] = [0] * len(primes[4::2])
for i in range(3,int(math.sqrt(N)),2):
if primes[i]:
primes[i*i::i*2] = [0] * len(primes[i*i::i*2])
for i in sys.stdin:
n = int(i)
print((sum(primes[0:n+1]... | import sys
import math
N = 1000000
primes = [1] * (N//2)
primes[0] = 0
for i in range(3,int(math.sqrt(N)),2):
if primes[i//2]:
primes[(i*i)//2::i] = [0] * len(primes[(i*i)//2::i])
for i in sys.stdin:
n = int(i)
if n == 1:
print((0))
elif n == 2:
print((1))
... | p00009 |
import sys
import math
N = 1000000
primes = [1] * (N//2+1)
primes[0] = 1
for i in range(3,int(math.sqrt(N))+1,2):
if primes[i//2]:
primes[(i*i)//2::i] = [0] * len(primes[(i*i)//2::i])
primes[i//2] += primes[i//2-1]
for i in range(int(math.sqrt(N))+1,N+1,2):
primes[i//2] += primes[i//... | import sys
N = 1000000
primes = [1] * (N//2)
primes[0] = 0
for i in range(3,int(N**0.5),2):
if primes[i//2]:
primes[(i*i)//2::i] = [0] * len(primes[(i*i)//2::i])
for i in sys.stdin:
n = int(i)
if n < 3:
print((n-1))
else:
print((sum(primes[:(n+1)//2])+1)) | p00009 |
import sys
for line in sys.stdin:
n=int(line)
ans=0
plist = [1 for i in range(n+1)]
plist[0]=0
plist[1]=0
for x in range(len(plist)):
if plist[x] == 1:
ans+=1
i=2
while True:
pos0 = x*i
if pos0 < len(plist):... | import sys
for line in sys.stdin:
n=int(line)
plist = [1 for i in range(n+1)]
plist[0]=0
plist[1]=0
for x in range(int(n**0.5)+1):
if plist[x] == 1:
i=2
while True:
pos0 = x*i
if pos0 < len(plist):
plist[... | p00009 |
from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
return 0
if n == 2:
return 1
if n % 2 == 0:
return 0
for i in range(2,int(sqrt(n)+1)):
if n % i == 0:
return 0
cash[n] = 1
return 1
fr... | from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
cash[n] = 0
return 0
if n == 2:
cash[n] = 1
return 1
if n % 2 == 0:
cash[n] = 0
return 0
for i in range(2,int(sqrt(n)+1)):
if n % i =... | p00009 |
from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
cash[n] = 0
return 0
if n == 2:
cash[n] = 1
return 1
if n % 2 == 0:
cash[n] = 0
return 0
for i in range(2,int(sqrt(n)+1)):
if n % i =... | from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
cash[n] = 0
return 0
if n == 2:
cash[n] = 1
return 1
if n % 2 == 0:
cash[n] = 0
return 0
for i in range(3,int(sqrt(n)+1))[0::2]:
if n... | p00009 |
from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
cash[n] = 0
return 0
if n == 2:
cash[n] = 1
return 1
if n % 2 == 0:
cash[n] = 0
return 0
for i in range(3,int(sqrt(n)+1))[0::2]:
if n... | from math import sqrt
cash = {}
def isprime(n):
if n in cash:
return cash[n]
if n == 1:
cash[n] = 0
return 0
if n == 2:
cash[n] = 1
return 1
if n % 2 == 0:
cash[n] = 0
return 0
for i in range(3,int(sqrt(n)+1))[0::2]:
if n... | p00009 |
from math import sqrt
from sys import stdin
def isprime(n):
if n == 1:
return False
if n == 2:
return True
if n % 2 == 0:
return False
for i in range(3, int(sqrt(n))+1):
if n % i == 0:
return False
return True
for n in stdin:
n = int(n)... | from math import sqrt,floor
from sys import stdin
def cntPrime(n):
mx = sqrt(n) + 1
l = [0] + [1] * (n - 1)
c = 2
while c < mx:
for k in range(2, floor(n/c) + 1):
l[c * k -1] = 0
c = l[:c].index(1) + c
return sum(l)
for n in stdin:
n = int(n)
prin... | p00009 |
from math import sqrt,floor
from sys import stdin
def cntPrime(n):
mx = sqrt(n) + 1
if n % 2 == 0:
l = [0, 1] + [1, 0] * (int(n/2) - 1)
else:
l = [0, 1] + [1, 0] * (int(n/2) - 1) + [1]
c = 3
while c < mx:
for k in range(c, floor(n/c) + 1, 1):
l[c * k -1] ... | from math import sqrt,floor
from sys import stdin
def cntPrime(n):
mx = sqrt(n) + 1
if n % 2 == 0:
l = [0, 1] + [1, 0] * (int(n/2) - 1)
else:
l = [0, 1] + [1, 0] * (int(n/2) - 1) + [1]
c = 3
while c < mx:
for k in range(c, floor(n/c) + 1, 1):
l[c * k -1] ... | p00009 |
import sys
def prime_list(n):
limit = int(n ** 0.5) + 1
lis = list(range(1, n + 1, 2))
lis[0] = 2
while True:
if len(lis) == 0:
break
p = lis.pop(0)
yield p
if p <= limit:
lis = [x for x in lis if x % p != 0]
def primes_number(n... |
import sys
def prime_list(n):
limit = int(n ** 0.5) + 1
lis = list(range(1, n + 1, 2))
lis[0] = 2
while True:
if len(lis) == 0:
break
p = lis.pop(0)
yield p
if p <= limit:
lis = [x for x in lis if x % p != 0]
def primes_number... | p00009 |
while True:
try:
n = int(eval(input()))
count = 0
if n == 1:
print("0")
else:
a = [2*i for i in range(2, 1000000)]
b = [3*i for i in range(2, 1000000)]
c = [5*i for i in range(2, 1000000)]
d = [7*i for i in range(2... | primes = [0, 0] + [1]*999999
for i in range(2, 1001):
if primes[i]:
for j in range(i*i, 1000001, i):
primes[j] = 0
while True:
try:
n = int(eval(input())) + 1
print((sum([1 for i in range(n) if primes[i]])))
except:
break | p00009 |
primes = [0, 0] + [1] * 999999
for i in range(2, 1000):
if primes[i]:
for j in range(i*i, 1000000, i):
primes[j] = 0
answer = [0] * 1000000
for i in range(2, 1000000):
answer[i] += primes[i] + answer[i-1]
while True:
try:
n = int(eval(input()))
except:
... | import bisect
primes = [0, 0] + [1] * 999999
for i in range(2, 1000):
if primes[i]:
for j in range(i*i, 1000000, i):
primes[j] = 0
primes = [i for i, v in enumerate(primes) if v]
while True:
try:
n = int(eval(input()))
except:
break
print((bisect.bisec... | p00009 |
import sys
MAX = 999999
L = [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, 3... | import sys
MAX = 999999
L = [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, 3... | p00009 |
import sys
MAX = 999999
def is_prime(n):
if n == 2:return True
if n % 2 == 0:return False
for i in range(3,int(n**0.5)+1,2):
if n % i == 0:return False
return True
def prime_list(n):
result = []
if n >= 2:result.append(2)
for i in range(3,n+1,2):
if is_prime(i):result.append(i)
... | import sys
import time
MAX = 999999
def is_prime(n):
if n == 2:return True
if n % 2 == 0:return False
for i in range(3,int(n**0.5)+1,2):
if n % i == 0:return False
return True
def prime_list(n):
return ([2] if n > 1 else []) + [i for i in range(3,n+1,2) if is_prime(i)]
L = prime_list(in... | p00009 |
import sys
for line in sys.stdin:
i = 5
lis = [2,3]
while i <= int(line):
if i % 3 != 0:
j = 5
while j <= int(i**0.5):
if j % 3 != 0:
if i % j == 0:
break
j += 2
else:
lis.append(i)
i += 2
print(len(lis)) | import sys
for line in sys.stdin:
lis = []
num = int(line)
if num >= 2:
lis.append(2)
if num >= 3:
lis.append(3)
if num >= 5:
for i in range(5,num+1,2):
for item in lis:
if item > (i**0.5):
lis.append(i)
break
if i % item == 0:
break
else:
lis.append(i)
pr... | p00009 |
from math import sqrt
def prime(n):
if n == 2:
return True
elif n < 2 or n % 2 == 0:
return False
else:
i = 3
while i <= sqrt(n):
if n % i == 0:
return False
i += 2
return True
while True:
try:
n = int(e... | from math import sqrt
def prime(n):
if n == 2:
return True
elif n < 2 or n % 2 == 0:
return False
else:
i = 1
while p_list[i] <= sqrt(n):
if n % p_list[i] == 0:
return False
i += 1
return True
def p_count(n):
c = 0... | p00009 |
import math
r = 999999
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*(i+1)-1,r,i+1):
p[j] = 0
while True:
try:
n = int(input())
print(sum(p[:n]))
except:
break | import math
r = 999999
sqrt = int(math.sqrt(r))
p = [1 for i in range(r)]
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
try:
n = int(input())
print(sum(p[:n]))
except:
break | p00009 |
import math
r = 999999
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
try:
n = int(input())
print(p[:n].count(1))
except:
break | import math
r = 999999
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
try:
n = int(input())
print(sum(p[:n]))
except:
break | p00009 |
import math
r = 999999
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
while True:
try:
n = int(input())
print(sum(p[:n]))
except:
break | import math
n = []
while True:
try:
n.append(int(input()))
except:
break
r = max(n)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
for i in n:
print(sum(p[:i])) | p00009 |
import math
n = []
while True:
try:
n.append(int(input()))
except:
break
r = max(n)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
for j in range(2*i+1,r,i+1):
p[j] = 0
for i in n:
print(sum(p[:i])) | import math
n = []
while True:
try:
n.append(int(input()))
except:
break
r = max(n)+1
sqrt = int(math.sqrt(r))
p = [1]*r
p[0] = 0
for i in range(1,sqrt):
if p[i]:
p[2*i+1::i+1] = [0 for x in range(2*i+1,r,i+1)]
for i in n:
print(sum(p[:i])) | p00009 |
def isPrime(p):
if p == 2: return 1
if p < 2 or p&1 == 0: return 0
return 1 if pow(2,p-1,p) == 1 else 0
while True:
try:
n = int(input())
print(sum(isPrime(i) for i in range(1,n+1)))
except:
break | def isPrime(p):
if p == 2: return 1
if p < 2 or p&1 == 0: return 0
return 1 if pow(2,p-1,p) == 1 else 0
while True:
try:
n = int(input())
print(sum(isPrime(i) for i in range(3,n+1,2))+1)
except:
break | p00009 |
def isPrime(p):
if p == 2: return 1
if p < 2 or p&1 == 0: return 0
return 1 if pow(2,p-1,p) == 1 else 0
while True:
try:
n = int(input())
print(sum(isPrime(i) for i in range(5,n+1,2))+2)
except:
break | n = []
while True:
try:
n.append(int(input()))
except:
break
R = max(n)+1
p = [1]*R
p[0] = p[1] = 0
i = 2
while i*i <= R:
if p[i]:
p[2*i::i] = [0 for x in range(2*i,R,i)]
i += p[i+1:].index(1)+1
for i in n:
print(sum(p[:i+1])) | p00009 |
import sys
for line in sys.stdin:
count = 0
n = int(line)
if n>=2: count += 1
for i in range(3,n+1,2):
if pow(2,i-1,i)==1: count += 1
print(count) | import sys
for line in sys.stdin:
n = int(line)
flag = [True]*(n+1)
flag[0] = flag[1] = False
for i in range(2,int(n**0.5)+1):
if flag[i]:
for j in range(i**2, n+1, i):
flag[j] = False
print((flag.count(True))) | p00009 |
prime=[True]*1000000
np=[0]*1000000
for i in range(2,1000000):
if prime[i]:
for j in range(i*2,1000000,i):
prime[j]=False
np[i]=np[i-1]+prime[i]
while True:
try:
n=int(eval(input()))
except:
break
print((np[n])) | prime=[True]*1000000
np=[0]*1000000
for i in range(2,1000):
if prime[i]:
for j in range(i*2,1000000,i):
prime[j]=False
while True:
try:
n=int(eval(input()))
except:
break
print((sum(prime[2:n+1]))) | p00009 |
prime=[True]*1000000
np=[0]*1000000
for i in range(2,1000):
if prime[i]:
for j in range(i*2,1000000,i):
prime[j]=False
while True:
try:
n=int(eval(input()))
except:
break
print((sum(prime[2:n+1]))) | prime=[True]*1000000
for i in range(2,1000):
if prime[i]:
for j in range(i*2,1000000,i):
prime[j]=False
while True:
try:
n=int(eval(input()))
except:
break
print((sum(prime[2:n+1]))) | p00009 |
def sieve(n):
a = [1 for i in range(n + 1)]
for i in range(2, n + 1):
if a[i]:
for j in range(2 * i, n + 1, i):
a[j] = 0
return a[2:]
while True:
try:
n = int(input())
print(len([x for x in sieve(n) if x]))
except (EOFError):
... | def sieve(n):
a = [1] * (n + 1)
for i in range(2, n):
if i * i > n: break
if a[i]:
for j in range(2 * i, n + 1, i):
a[j] = 0
return a[2:]
while True:
try:
n = int(input())
print(len([x for x in sieve(n) if x]))
except (EOFErro... | p00009 |
import math as m
while True:
try:
n=int(eval(input()))
a=[0]*(n+1)
a[0],a[1]=1,1
for i in range(2,int(m.sqrt(n))+1):
for j in range(2,int(n/i)+1):
a[i*j]=1
print((a.count(0)))
except:
break | while True:
try:
n=int(eval(input()))
a=[True]*(n+1)
a[0]=a[1]=False
for i in range(2,int(n**0.5)+1):
if a[i]:
for j in range(i**2,n+1,i):
a[j]=False
print((a.count(True)))
except:
break | p00009 |
from bisect import bisect
n = 10000000
sn = int(n**0.5)+1
num = [False, False] + [True]*(n-1)
for i in range(2, int(n**0.5)+1):
if num[i]:
for j in range(i**2, n, i):
num[j] = False
prime = [i for i in range(2, n) if num[i]]
while True:
try:
print(bisect(prime, eval(input())))
exce... | from bisect import bisect
n = 1000000
sn = int(n**0.5)+1
num = [False, False] + [True]*(n-1)
for i in range(2, int(n**0.5)+1):
if num[i]:
for j in range(i**2, n, i):
num[j] = False
prime = [i for i in range(2, n) if num[i]]
while True:
try:
print(bisect(prime, eval(input())))
excep... | p00009 |
import sys
import math as mas
def sieve(n):
p=[True for i in range(n+1)]
p[0]=p[1]=False
end=int(n**0.5)
for i in range(2,end+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=False
return p
sosu=sieve(1000010)
for i in sys.stdin:
print((sum(sosu[t] for t in range(int(i)+1))))
# a,b=map(i... | import sys
import math as mas
def sieve(n):
p=[True for i in range(n+1)]
p[0]=p[1]=False
end=int(n**0.5)
for i in range(2,end+1):
if p[i]:
for j in range(i*i,n+1,i):
p[j]=False
return p
sosu=sieve(1000010)
for i in sys.stdin:
t=int(i)
if t<2:print((0))
elif t==2:print((1))
else:pr... | p00009 |
import sys
xx = 500000
f = [0, 1] * xx
i = 3
while i * i <= 2 * xx:
if f[i] == 1:
j = i * i
while j <= 2 * xx:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
... | import sys
f = [0, 1] * 500000
i = 3
while i <= 1000:
if f[i] == 1:
j = i * i
while j <= 1000000:
f[j] = 0
j += i + i
i += 2
f.pop(0)
f.pop(1)
for n in sys.stdin:
i = int(n)
if i < 2:
print((0))
else:
print((sum(... | p00009 |
import sys
f = [0, 1] * 500000
f.append(0)
f[1] = 0
f[2] = 1
i = 3
while i < 1000:
if f[i] == 1:
j = i * i
while j <= 1000000:
f[j] = 0
j += i + i
i += 2
for n in sys.stdin:
i = int(n)
print((sum(f[:i + 1]))) | import sys
f = [1, 0, 0, 0, 1, 0] * (1000000 // 6 + 1)
f = [0, 0, 1, 1] + f[3:-2]
i = 5
while i < 1000:
if f[i] == 1:
j = i * i
while j <= 1000000:
f[j] = 0
j += i + i
i += 2
for n in sys.stdin:
i = int(n)
print((sum(f[:i + 1]))) | p00009 |
def mk_table(n):
res = [1] * (n + 1)
res[:2] = [0, 0]
for i in range(2, n):
if i ** 2 > n:
break
if res[i] == 1:
j = 2
while i * j <= n:
res[i * j] = 0
j += 1
return res
tbl = mk_table(999999)
try:... | def mk_table(n):
res = [1] * (n + 1)
res[:2] = 0, 0
for i in range(2, n):
if i ** 2 > n:
break
if res[i] == 1:
for j in range(i*2, n + 1, i):
res[j] = 0
return res
tbl = mk_table(999999)
try:
while 1:
print((len([... | p00009 |
import sys
def count_prime(n):
global count, pool
if not pool:
return count
p = pool[0]
while p <= n:
pool = tuple(i for i in pool if i % pool[0])
count += 1
if not pool:
break
p = pool[0]
return count
inset = list(map(int, sys... | import sys
input_list = list(int(i) for i in sys.stdin)
max_n = min(1000000, max(input_list) + 1)
prime_list = list(i % 2 for i in range(max_n))
prime_list[1], prime_list[2] = 0, 1
i = 3
while i * i < max_n:
if prime_list[i]:
for j in range(i * 2, max_n, i):
prime_list[j] = 0
i... | p00009 |
# coding: utf-8
LIMIT = 999999
prime = [0, 1] + [0 if i % 2 == 0 else 1 for i in range(3, LIMIT + 1)]
for i in range(3, LIMIT + 1):
if prime[i - 1]:
for j in range(i ** 2, LIMIT + 1, i):
prime[j - 1] = 0
while True:
try:
n = int(eval(input()))
except EOFError:
... | # coding: utf-8
LIMIT = 999999
prime = [0, 1] + [0 if i % 2 == 0 else 1 for i in range(3, LIMIT + 1)]
for i in range(3, int(LIMIT ** 0.5) + 1):
if prime[i - 1]:
for j in range(i ** 2, LIMIT + 1, i):
prime[j - 1] = 0
while True:
try:
n = int(eval(input()))
except... | p00009 |
import sys
def fact(n):
ret = [1]
if n%2==0:
ret.append(2)
return ret
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
ret.append(i)
return ret
return ret
def isPrime(n):
if n<=1:
return False
if n==2:
return True
i... | import sys
results = {}
def fact(n):
if n in results:
return results[n]
ret = [1]
if n%2==0:
ret.append(2)
results[n]=ret
return ret
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
ret.append(i)
results[n]=ret
return... | p00009 |
import sys
results = {}
def fact(n):
if n in results:
return results[n]
ret = [1]
if n%2==0:
ret.append(2)
results[n]=ret
return ret
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
ret.append(i)
results[n]=ret
return... | import sys
results = {}
def fact(n):
if n in results:
return results[n]
ret = [1]
if n%2==0:
ret.append(2)
results[n]=ret
return ret
for i in range(3,int(n**0.5)+1,2):
if n%i==0:
ret.append(i)
results[n]=ret
return... | p00009 |
# AOJ 0009 Prime Number
# Python3 2018.6.9 bal4u
MAX = 1000000
SQRT = 1000 # sqrt(MAX)
prime = [True for i in range(MAX)]
def sieve():
for i in range(2, MAX, 2):
prime[i] = False
for i in range(3, SQRT, 2):
if prime[i] is True:
for j in range(i*i, MAX, i):
prime[j] = False
sieve()
cn... | # AOJ 0009 Prime Number
# Python3 2018.6.9 bal4u
MAX = 1000000
SQRT = 1000 # sqrt(MAX)
prime = [0] * MAX
def sieve():
for i in range(3, MAX, 2):
prime[i] = 1
for i in range(3, SQRT, 2):
if prime[i] == 1:
for j in range(i*i, MAX, i):
prime[j] = 0
sieve()
cnt = [0] * (MAX+1)
cnt[2] ... | p00009 |
import math
def get_primes(goal):
n_list = list(range(3,goal+1,2))
primes = [2]
sieve = [[n,1] for n in n_list]#Sieve of Eratosthenes
while sieve[0][0] < math.sqrt(goal+1):
target = sieve[0][0]
primes = primes + [target]
i = 0
while i < len(sieve):
sieve[i][1] = 0
i += target
while siev... | import math
def bin_search_count(list,cond):
if cond(list[0]) and cond(list[-1]):
return len(list)
if cond(list[0]) == False and cond(list[-1]) == False:
return 0
Imin = 0
Imax = len(list) - 1
Imid = int(Imin * 0.5 + Imax * 0.5)
return bin_search_count(list[:Imid + 1],cond) + bin_search_count(list[Im... | p00009 |
while True:
t = []
b = 0
try:
a = int(eval(input()))
for n in range(2,10000):
for x in range(2,n):
if n % x == 0:
break
else:
t.append(n)
for b in range(1000):
if t[b] > a:
print(len(t[0:b]))
break
except EOFError:
bre... |
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
#!/usr/bin/env python
import sys
list=1000000*[1]
list[0] = 0
list[1] = 0
for i in range(1,1000000):
if list[i] == 1:
for j in range(i*i,1000000,i):
list[j] = 0
for i in range(2,1000000):
list[i] += list[i-1]... | p00009 |
import sys
import math
M = 1000000
B = int(math.sqrt(M)+1)
N = M//6
N1 = N+1 if M % 6 == 5 else N
N2 = N+1 if M % 6 >= 1 else N
l = [1] * N1
m = [1] * N2
for i in range(5,B,6):
p = (i-5)//6
ini = (i*5-1)//6
if l[p] == 1:
l[p+i::i] = [0] * len(l[p+i::i])
m[ini-1::i] = [0] * len(... | import sys
import math
M = 1000000
B = int(math.sqrt(M)+1)//6+1
N = M//6
N1 = N+1 if M % 6 == 5 else N
N2 = N+1 if M % 6 >= 1 else N
l = [1] * N1
m = [1] * N2
i = 5
ini = 4
for p in range(B):
if l[p] == 1:
l[p+i::i] = [0] * len(l[p+i::i])
m[ini-1::i] = [0] * len(m[ini-1::i])
if m[... | p00009 |
def Eratosthenes(n):
N = [1 for i in range(0,n+1)]
i = 3
while i*i<=n:
if N[i]:
j = i*3
while j<=n:
N[j] = 0
j += i*2
i += 2
return N
while True:
N = Eratosthenes(999999)
try:
n = int(eval(input()))
except EOFError:
break
cnt = 0
if n>=2:
cnt = 1
for i in range(3,... |
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
def sieve(n):
p = [True for i in range(n + 1)]
p[0] = p[1] = False
end = int(n ** .5)
for i in range(2, end + 1):
if p[i]:
for j in range(i * i, n + 1, i):
p[j] = ... | p00009 |
def Eratosthenes(n):
N = [1 for i in range(0,n+1)]
i = 3
while i*i<=n:
if N[i]:
j = i*i
while j<=n:
N[j] = 0
j += i*2
i += 2
return N
while True:
N = Eratosthenes(999999)
try:
n = int(eval(input()))
except EOFError:
break
cnt = 0
if n>=2:
cnt = 1
for i in range(3,... | def Eratosthenes(n):
N = [1 for i in range(0,n+1)]
i = 3
while i*i<=n:
if N[i]:
j = i*i
while j<=n:
N[j] = 0
j += i*2
i += 2
return N
N = Eratosthenes(999999)
while True:
try:
n = int(eval(input()))
except EOFError:
break
cnt = 0
if n>=2:
cnt = 1
for i in range(3, ... | p00009 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
sorted(A)
DP = [-1] * (K+1)
for i in range(K+1):
if i < A[0]:
DP[i] = False
else:
for j in A:
if i - j <= 0:
DP[i] = False
if not DP[i-j]:
DP[i] = True
... | N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
A.sort()
m = min(A)
DP = [False] * (K+1)
for i in range(m, K+1):
for a in A:
if i - a >= 0 and DP[i-a] == False:
DP[i] = True
break
if DP[-1]:
print('First')
else:
print('Second') | p03170 |
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [False]*(K+1)
for i in range(K+1):
for ai in a:
if i-ai>=0:
dp[i] |= not dp[i-ai]
if dp[K]:
print('First')
else:
print('Second') | import sys
input = sys.stdin.readline
N, K = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [False]*(K+1)
for i in range(K+1):
for ai in a:
if i-ai>=0:
dp[i] |= not dp[i-ai]
if dp[K]:
print('First')
else:
print('Second') | p03170 |
# K - Stones
def main():
N, K, *A = list(map(int, open(0).read().split()))
dp = [0] * (K + 1)
for i in range(1, K + 1):
for a in A:
if i - a >= 0:
dp[i] |= dp[i - a] ^ 1
if dp[i]:
break
print(("First" if dp[-1] else "Second"))
... | # K - Stones
def main():
N, K, *A = list(map(int, open(0).read().split()))
dp = [False] * (K + 1)
for i in range(K):
if dp[i]:
continue
for a in A:
if i + a > K:
break
dp[i + a] = True
print(("First" if dp[-1] else "Second"))... | p03170 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from operator import xor
from functools import reduce
N,K,*A = list(map(int,read().split()))
a = reduce(xor,(1<<a for a in A))
dp = 0 # bitset
for n in range(K):
if not(dp&(1<<n)):
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K,*A = list(map(int,read().split()))
dp = [0]*(K+1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
if n+a>K:
break
dp[n+a]=1
... | p03170 |
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K,*A = list(map(int,read().split()))
dp = [0]*(K+1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
if n+a>K:
break
dp[n+a]=1
... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
N,K,*A = list(map(int,read().split()))
dp = [0]*(K+K+1) # bitset
for n in range(K):
if not dp[n]:
for a in A:
dp[n+a]=1
answer = 'First' if dp[K] else 'Second'
pri... | p03170 |
n, k = list(map(int, input().split()))
a = list(map(int, input().split()))
dp = [0] * (k+1)
for i in range(1, k+1):
for j in range(n):
if i - a[j] < 0:
break
if dp[i-a[j]] == 0:
dp[i] = 1
if dp[k] == 1:
print("First")
else:
print("Second") | n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [0] * (k+1)
for i in range(1, k+1):
for a in A:
if i - a < 0:
break
if dp[i-a] == 0:
dp[i] = 1
if dp[k] == 1:
print("First")
else:
print("Second") | p03170 |
# coding: utf-8
import sys
input = sys.stdin.readline
def f(N, A, K):
dp = [0] * (K + 1)
for i in range(K + 1):
for x in A:
if i < x:
break
if not dp[i - x]:
dp[i] = 1
break
return(dp[K])
ans = [ "Second", "Fi... | # coding: utf-8
import sys
input = sys.stdin.readline
def f2(N, A, K):
dp = [0] * (K + 1)
for i in range(K + 1):
if dp[i] == 0:
# 残りi個で負けなので、ai個足した状況は勝ちになる。
for x in A:
if i + x <= K:
dp[i + x] = 1
return(dp[K])
ans = [ "S... | p03170 |
def judge(i):
for a in a_s:
di = i - a
if di < 0:
return "Second"
if dp[di] == "Second":
return "First"
return "Second"
n, k = list(map(int, input().split()))
a_s = list(map(int, input().split()))
dp = [""] * (k + 1)
dp[0] = "Second"
for i in range... | n, k = list(map(int, input().split()))
a_s = list(map(int, input().split()))
dp = ["Second"] * (k + 1)
for i in range(k + 1):
if dp[i] == "Second":
for a in a_s:
ii = i + a
if ii <= k:
dp[ii] = "First"
print((dp[-1]))
| p03170 |
n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans=[-1]*(k+1)
ans[0]=False # lose
for i in range(k+1):
iswin = False
for num in a:
if (i-num >=0) and (not ans[i-num]):
iswin=True
ans[i]=iswin
if ans[-1]:
print("First")
else:
print("Seco... | n,k = list(map(int, input().split()))
a = list(map(int, input().split()))
ans=[False]*(k+1)
ans[0]=False
for i in range(k+1):
for num in a:
if (i-num >=0) and (not ans[i-num]):
ans[i]=True
if ans[-1]:
print("First")
else:
print("Second") | p03170 |
N,K = list(map(int,input().split()))
A = list(map(int,input().split()))
dp = [False]*(K+1)
for i in range(K+1):
for j in range(N):
if i-A[j]>=0 and dp[i-A[j]] == False:
dp[i] = True
if dp[K]:
print("First")
else:
print("Second") | n,k = list(map(int,input().split()))
arr = list(map(int,input().split()))
dp = [False]*(k+1)
for stones in range(k+1):
for x in arr:
if stones >= x and dp[stones-x] == False:
dp[stones] = True
if dp[k]:
print("First")
else:
print("Second")
| p03170 |
import sys
sys.setrecursionlimit(2147483647)
INF=float("inf")
MOD=10**9+7
input=lambda :sys.stdin.readline().rstrip()
def resolve():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[0]*(k+1)
for i in range(k):
if dp[i]: continue
for j in range(n):
... | import sys
sys.setrecursionlimit(2147483647)
INF = float("inf")
MOD = 10**9 + 7 # 998244353
input = lambda:sys.stdin.readline().rstrip()
def resolve():
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [False] * (k + 1)
for i in range(k + 1):
if dp[i]:
... | p03170 |
def solve(N, K, cards):
min_elem = cards[0]
TARO, JIRO = 0, 1
dp = [[-1 for _ in range(K + 1)] for _ in range(2)]
dp[TARO][0] = TARO
dp[JIRO][0] = JIRO
for i in range(min_elem):
dp[JIRO][i] = TARO
dp[TARO][i] = JIRO
for k in range(1, K + 1):
for turn in [TARO, JIRO]:
o... | def solve(N, K, cards):
min_elem = cards[0]
# dp[i] == True: Current player will win if i stones left
dp = [False for _ in range(K + 1)]
for i in range(min_elem):
dp[i] = False
for k in range(1, K + 1):
for c in cards:
if c > k:
break
if k - c >= 0 and dp[k - c] == Fa... | p03170 |
n, k = list(map(int, input().split( )))
a = list(map(int, input().split( )))
dp = [0]*(k+1)
for i in range(k+1):
win = 0
for j in a:
if i>=j and dp[i-j] == 0:
win = 1
break
dp[i] = win
#print(*dp)
if dp[k] == 1:
print("First")
else:
pri... | n, k = list(map(int, input().split()))
a = list(map(int, input().split( )))
dp = [0]*(k+1)
#0は先手負け、1が先手勝ち
for i in range(a[0],k+1):
for p in a:#負かす手があれば勝ち
if i-p >= 0 and dp[i-p] == 0:
dp[i] = 1
break
if dp[k] == 1:
print("First")
else:
print("Second")
| p03170 |
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
dp = [None] * (k + 1)
# dp[手番の石の数] := 手番の勝敗
# True(勝ち) / None(負け)
for my_remains in range(k + 1):
for my_take in a:
opponent_remains = my_remains - my_take # 相手が操作を行う石の数
if opponent_remains >= 0 and dp[opponent_... | n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
dp = [None] * (k + k + 1)
# dp[手番の石の数] := 手番の勝敗
# True(勝ち) / None(負け)
for opponent_remains in range(k): # 自分が石を取った残りなので、k未満
if dp[opponent_remains] is None: # 相手が負ける場合
for my_take in a: # 自分が取る石の数
my_remai... | p03170 |
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
dp = [None] * (k + k + 1)
# dp[手番の石の数] := 手番の勝敗
# True(勝ち) / None(負け)
for opponent_remains in range(k): # 自分が石を取った残りなので、k未満
if dp[opponent_remains] is None: # 相手が負ける場合
for my_take in a: # 自分が取る石の数
my_remai... | import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
a = tuple(map(int, input().split()))
dp = [None] * (k + k + 1)
# dp[手番の石の数] := 手番の勝敗
# True(勝ち) / None(負け)
for opponent_remains in range(k): # 自分が石を取った残りなので、k未満
if dp[opponent_remains] is None: # 相手が負ける場合
for my_... | p03170 |
n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
ans = [False]*(k+1)
for i in range(1,k+1):
ok = False
for j in a:
if i-j<0:
continue
if ans[i-j] == False:
ans[i] = True
print(('First' if ans[k] else 'Second')) | n,k=list(map(int,input().split()))
a=list(map(int,input().split()))
ans = [False]*(k+1)
for i in range(1,k+1):
ok = False
for j in a:
if i-j<0:
continue
if ans[i-j] == False:
ans[i] = True
break
print(('First' if ans[k] else 'Second')) | p03170 |
def resolve():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [False]*(K+1)
for i in range(K+1):
for j in range(N):
if i - A[j] >= 0:
dp[i] |= ~dp[i-A[j]]
if dp[K]:
print("First")
else:
print("S... |
def resolve():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [False]*(K+1)
for i in range(K+1):
for j in range(N):
if i - A[j] >= 0:
dp[i] |= not dp[i-A[j]]
if dp[K]:
print("First")
else:
... | p03170 |
"""
AtCoder Educational DP Contest
https://atcoder.jp/contests/dp/tasks/dp_k
K - Stones
"""
import collections
def solve(xs):
dp = collections.defaultdict(bool)
dp[0] = False
for j in range(1, K + 1):
iterable = ((j >= x) and (not dp[j - x]) for x in xs)
dp[j] = any(iterable... | """
AtCoder Educational DP Contest
https://atcoder.jp/contests/dp/tasks/dp_k
K - Stones
"""
import collections
def solve(xs):
dp = collections.defaultdict(bool)
dp[0] = False
for j in range(1, K + 1):
dp[j] = any((j >= x) and (not dp[j - x]) for x in xs)
return dp[K]
N, K = lis... | p03170 |
N, K, *A = list(map(int, open(0).read().split()))
dp = [False] * (K + 1)
for i in range(1, K + 1):
if dp[i]:
continue
for a in A:
if i - a >= 0:
dp[i] |= not dp[i - a]
if dp[K]:
print("First")
else:
print("Second") | N, K, *A = list(map(int, open(0).read().split()))
dp = [False] * (2 * K + 1)
for i in range(K):
if not dp[i]:
for a in A:
dp[i + a] = True
if dp[K]:
print("First")
else:
print("Second") | p03170 |
n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
tf = ["" for _ in range(k+1)]
tf[0] = False
for i in range(1,k+1):
j = 0
flag = 0
while j < n and i - a[j] >= 0:
if tf[i-a[j]] == False:
tf[i] = True
flag = 1
break
j += 1
if flag ==0:
tf[i] = Fal... | n,k = list(map(int,input().split()))
a = list(map(int,input().split()))
s = [False]*(k+1)
for i in range(k+1):
for aj in a:
if i - aj >=0:
if s[i-aj] == False:
s[i] = True
break
if s[k]==True:
print("First")
else:
print("Second") | p03170 |
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = ['First']*(K+1)
dp[0] = 'Second'
def solve(dp):
for i in range(1,K+1):
for j in range(N):
dp[i] = 'Second'
if dp[i-A[j]]=='Second':
dp[i] = 'First'
break
a... | def solve():
N, K = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = ['Second']*(K*2)
for i in range(K):
if dp[i]!='Second':
continue
for j in range(N):
dp[i+A[j]]='First'
ans = dp[K]
return ans
print((solve())) | p03170 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
sys.setrecursionlimit(10**7)
INF = 10**18
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
N,K = LI()
a = LI()
dp = [0 for _ in range(K+1)]
for i in range(K,-1,-1):
if dp[i]:... | import sys
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
N,K = LI()
a = LI()
dp = [0 for _ in range(K+1)]
for i in range(K,-1,-1):
if dp[i]: continue
for x in a:
if i-x >= 0: dp[i-x] = 1
if dp[0] == 1:
print('First')
else:
print('Second') | p03170 |
def solve():
k, a = read()
result = think(k, a)
write(result)
def read():
n, k = read_int(2)
a = read_int(n)
return k, a
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_float(n):
return list([float(x) for x in read_line().split('... | def solve():
k, a = read()
result = think(k, a)
write(result)
def read():
n, k = read_int(2)
a = read_int(n)
return k, a
def read_int(n):
return list([int(x) for x in read_line().split(' ')])[:n]
def read_float(n):
return list([float(x) for x in read_line().split('... | p03170 |
import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [0]*(k+1)
for i in range(k+1):
for a in A:
if i-a >= 0:
dp[i] |= ~dp[i-a]
result = dp[k]
if result:
print("First")
else:
print("Second") | import sys
input = sys.stdin.readline
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [0]*(k+1)
for i in range(k+1):
for a in A:
if i-a >= 0 and not dp[i-a]:
dp[i] = 1
break
result = dp[k]
if result:
print("First")
else:
print("Second") | p03170 |
n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
# dp[i] i個の石で手番の時の勝ち負け
dp = [0]*(k+1)
# 貰う
for i in range(1, k+1):
for j in range(n):
if i-A[j] < 0:
continue
dp[i] = max(dp[i], 1 if dp[i-A[j]] == 0 else 0)
print(('First' if dp[k] else 'Second'))
| n, k = list(map(int, input().split()))
A = list(map(int, input().split()))
dp = [0]*(k+1)
for i in range(1, k+1):
for j in range(n):
if i-A[j] < 0:
continue
dp[i] |= not dp[i-A[j]]
print(('First' if dp[k] else 'Second')) | p03170 |
import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[0]*(k+1) #0:i個だったら必ず負ける，正:勝つ
for i in range(min(A),k+1):
for a in A:
if i-a>=0 and dp[i-a]==0:
dp[i]=1
... | import sys
def input(): return sys.stdin.readline().rstrip()
def main():
n,k=list(map(int,input().split()))
A=list(map(int,input().split()))
dp=[False]*(k+1) #0:i個だったら必ず負ける，正:勝つ
for i in range(min(A),k+1):
for a in A:
if i-a>=0 and not dp[i-a]:
dp[i]=True
... | p03170 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.