input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
from sys import stdin
input = stdin.readline
I = lambda :list(map(int,input().split()))
n,=I()
l = sorted(I())
g=[0]*(10**6+1)
an=0;p=l[-1]
if l[0]==1:
print((1 if n==1 else int(l[1]!=1)));exit()
for i in range(n):
x=l[i];f=1
for j in range(1,int(x**0.5)+1):
if x%j==0:
if g[j] or g[x//j]:... | n,a=int(eval(input())),sorted(list(map(int,input().split())))
m,s=a[-1],[0]*(a[-1]+1)
for i in a:
s[i]+=1
for i in set(a):
if s[i]:
for j in range(i*2,m+1,i):s[j]=0
print((s.count(1))) | p02642 |
def main():
n=int(eval(input()))
a=list(map(int, input().split()))
a.sort()
arr=[0]*(10**6+1)
flag=[True]*(10**6+1)
ans=0
for i in range(n):
if flag[a[i]]:
arr[a[i]]+=1
for j in range(a[i]*2,10**6+1,a[i]):
flag[j]=False
print((a... | import sys
input = sys.stdin.readline
n=int(eval(input()))
a=list(map(int, input().split()))
a.sort()
m=max(a)
arr=[0]*(m+1)
flag=[True]*(m+1)
ans=0
for i in range(n):
if flag[a[i]]:
arr[a[i]]+=1
if not arr[a[i]]==1:
continue
for j in range(a[i]*2,m+1,a[i]):
... | p02642 |
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort(reverse=True)
max_a=A[0]
dp=[True]*(max_a+1)
ans=0
for i in range(N):
a=A.pop()
#print(a)
if dp[a]==True:
if a not in A:
ans+=1
k=a
while k<=max_a:
dp[k]=False
k+=a
print(ans) | N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
max_a=A[-1]
dp=[True]*(max_a+1)
ans=0
for i in range(N):
a=A[i]
#print(a)
if dp[a]==True:
if i==N-1:
ans+=1
elif a!=A[i+1]:
ans+=1
k=a
while k<=max_a:
dp[k]=False
k+=a
print(ans) | p02642 |
from collections import Counter
def solve(i,j,a):
k=False
sc=0
for v in [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,31... | n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)
cnt=[0 for _ in range(m+1)]
ans=0
for i in a:
if cnt[i]>=1:
cnt[i]+=1
continue
for j in range(2*i,m+1,i):
cnt[j]+=1
cnt[i]=1
for i in range(n):
if cnt[a[i]]==1:
ans+=1
print(ans) | p02642 |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):r... |
def s0():return eval(input())
def s1():return input().split()
def s2(n):return [eval(input()) for x in range(n)]
def s3(n):return [input().split() for _ in range(n)]
def s4(n):return [[x for x in s] for s in s2(n)]
def n0():return int(eval(input()))
def n1():return [int(x) for x in input().split()]
def n2(n):r... | p02642 |
from collections import deque
import math
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
Amax=max(A)
dp=[0]*Amax
tmp=-1
res=0
for i in range(len(A)):
a=A.pop(0)
if a==tmp:
continue
if dp[a-1]==0:
... | from collections import deque
import math
def main():
N=int(eval(input()))
A=list(map(int,input().split()))
A.sort(reverse=True)
Amax=max(A)
dp=[0]*Amax
tmp=-1
res=0
for i in range(len(A)):
a=A.pop()
if a==tmp:
continue
if dp[a-... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
is_prime = [True] * (10**6 + 1)
pre_a = 0
for a in A:
if a == pre_a:
is_prime[a] = False
j = 2 * a
while j <= 10**6:
is_prime[j] = False
j += a
pre_a = a
ans = 0
for a in A:
if is_pri... | N = int(eval(input()))
A = list(map(int, input().split()))
S = set(A)
M = max(A)
A.sort()
pre_a = 0
for a in A:
if a == pre_a:
S.discard(a)
if a in S:
j = a * 2
while j <= M:
S.discard(j)
j += a
pre_a = a
print((len(S))) | p02642 |
# エラトステネスの篩を使う！O(nloglogn)
N = int(eval(input()))
A = list(map(int,input().split()))
listA = [0] * (10**6+10)
ans = 0
for i in A:
for j in range(i,10**6+10,i):
if listA[j] != 0:
listA[j] = 2
continue
else:
listA[j] += 1
for i in A:
if listA[i]... | # エラトステネスの篩を使う！O(nloglogn)
N = int(eval(input()))
A = list(map(int,input().split()))
listA = [0] * (10**6+10)
ans = 0
for i in A:
if listA[i] != 0:
listA[i] = 2
continue
for j in range(i,10**6+10,i):
listA[j] += 1
for i in A:
if listA[i] == 1:
ans += ... | p02642 |
n=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
import math
ans=0
for i in range(n):
check=True
for k in range(i):
if A[k]/2>(A[i]):
break
if A[i]%A[k]==0:
check=False
break
if i!=n-1:
if A[i]==A[i+1]:
ch... | n=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
box=[True]*(A[-1]+1)
for i in range(len(A)):
if i<n-1 and A[i]==A[i+1]:
box[A[i]]=False
k=2
while A[i]*k<len(box):
box[A[i]*k]=False
k+=1
ans=0
for i in A:
if box[i]:
ans+=1
print(ans) | p02642 |
from sys import stdin
N = int(stdin.readline().strip())
A = [int(x) for x in stdin.readline().strip().split(" ")]
sum_num = 0
for i in range(len(A)):
tmp = [A[i]] * N
tmp = [x % y for (x, y) in zip(tmp, A)]
tmp[i] = 1
if 0 not in tmp:
sum_num += 1
print(sum_num)
| from sys import stdin
N = int(eval(input()))
A = sorted(int(x) for x in input().split())
max_num = A[-1] + 1
count = [0] * max_num
for i in A:
if count[i] != 0:
count[i] = 2
continue
else:
for j in range(i, max_num, i):
count[j] += 1
sum_num = sum(count[i] ... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
dp = [True] * (A[-1]+1)
for i,num in enumerate(A):
if i < N-1 and A[i+1] == num:
dp[num] = False
for j in range(2*num, A[-1]+1, num):
dp[j] = False
print((len([i for i in A if dp[i]]))) | N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
dp = [True] * (A[-1]+1)
for i,num in enumerate(A):
if i < N-1 and A[i+1] == num:
dp[num] = False
else:
for j in range(2*num, A[-1]+1, num):
dp[j] = False
print((len([i for i in A if dp[i]]))) | p02642 |
n = int(eval(input()))
a = sorted(list(map(int,input().split())))
if n == 1:
print((1))
exit()
ans = 0
div = []
for i in range(n):
if 0 < i and a[i] == a[i-1]:
if i < n-1 and a[i] != a[i+1]:
div += [a[i]]
continue
if i < n-1 and a[i] == a[i+1]:
contin... | n = int(eval(input()))
a = sorted(list(map(int,input().split())))
m = a[-1]
b = [True]*(m+1)
for i in range(n):
if i > 0 and a[i] == a[i-1]:
continue
for j in range(2, m//a[i]+1):
b[j*a[i]] = False
ans = 0
for i in range(n):
if 0 < i and a[i] == a[i-1]:
continue
if i... | p02642 |
import sys
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
dic = defaultdict(int)
a.sort()
ans = 0
for i in range(n):
x = a[i]
if i < n-1 and a[i] == ... | import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**8)
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
ans = 0
N = max(a)+1
tab = [1 for _ in range(N)]
for i in range(n):
x = a[i]
if i < n-1 and a[i] == a[i+1]:
... | p02642 |
n = int(eval(input()))
a_list = list(map(int, input().split()))
ans_len = 10**6+10
is_ans = [0]*(ans_len)
for a in a_list:
if is_ans[a] == 0:
b = 2*a
while b < ans_len:
is_ans[b] += 1
b += a
ans = 0
for a in a_list:
if a_list.count(a) == 1:
ans +=... | n = int(eval(input()))
a_list = list(map(int, input().split()))
ans_len = 10**6+10
is_ans = [0]*(ans_len)
for a in a_list:
is_ans[a] += 1
if is_ans[a] == 1:
b = 2*a
while b < ans_len:
is_ans[b] += 2
b += a
ans = 0
for a in a_list:
# print(a, is_ans[a]... | p02642 |
n,*a=list(map(int,open(0).read().split()))
a.sort()
b=[0]*(10**6+1)
for i in a:
b[i]+=1
for j in range(2*i,10**6+1,i):
b[j]+=2
print((b.count(1))) | n,*a=list(map(int,open(0).read().split()))
a.sort()
b=[0]*(10**6+1)
for i in a:
b[i]+=1
if b[i]==1:
for j in range(2*i,10**6+1,i):
b[j]+=100
print((b.count(1))) | p02642 |
from collections import Counter
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
count=0
b=Counter(a)
count_list=[0]*(10**6)
for i in a:
if b[i]==1:
if count_list[i-1]==0:
count+=1
j=1
while i*j<=10**6:
count_list[i*j-1]+=1
j+=1
else:
j=2
wh... | from collections import Counter
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
a_max=a[-1]
count=0
b=Counter(a)
count_list=[0]*(a_max)
for i in a:
if b[i]==1:
if count_list[i-1]==0:
count+=1
j=1
while i*j<=a_max:
count_list[i*j-1]+=1
j+=1
else:
... | p02642 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
from bisect import bisect_left
def divisors(n):
ret = set()
for i in range(1, int(n ** 0.5) + 1):
d, m = divmod(n, i)
if m == 0:
ret.add(i)
ret.add(d)
return ret
def main()... | #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
from bisect import bisect_left
def divisors(n):
ret = set()
for i in range(1, int(n ** 0.5) + 1):
d, m = divmod(n, i)
if m == 0:
ret.add(i)
ret.add(d)
return ret
def main()... | p02642 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
from bisect import bisect_left
def divisors(n):
ret = set()
for i in range(1, int(n ** 0.5) + 1):
d, m = divmod(n, i)
if m == 0:
ret.add(i)
ret.add(d)
return ret
def main()... | #!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
from bisect import bisect_left
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
# 愚直に行うとO(N^2)となる
# エラトステネスの篩を真似ると、NlogNで済む
# 同じ数字が存在している場合は、注意する
table = [False]*(A[-... | p02642 |
#!/usr/bin/env python3
import sys
import math
sys.setrecursionlimit(10**8)
def eratosthenes_sieve(n):
table = [0] * (n + 1)
prime_list = []
for i in range(2, n + 1):
if table[i] == 0:
prime_list.append(i)
for j in range(i + i, n + 1, i):
table... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**8)
def input(): return sys.stdin.readline().strip()
def INT(): return int(eval(input()))
def MAP(): return list(map(int, input().split()))
def LIST(): return list(map(int, input().split()))
def ZIP(n): return [LIST() for _ in range(n)]
INF = float(... | p02642 |
n = int(eval(input()))
a = sorted(map(int,input().split()))
ans = 0
while len(a) > 1:
a0 = a[0]
i_s = []
for i in range(1,len(a)):
if a[i]%a0 == 0:
i_s.append(i)
if a0 != a[1]:
for i in range(len(i_s))[::-1]:
a.pop(i_s[i])
a.pop(0)
... | n = int(eval(input()))
a = sorted(map(int,input().split()))
ans = 0
baisu = [0]*(a[n-1]+1)
an = a[n-1]
for i in range(n):
a0 = a[i]
a1 = a0
while a1 <= an:
baisu[a1] += 1
a1 += a0
for i in range(n):
if baisu[a[i]] == 1:
ans += 1
print(ans) | p02642 |
# -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap():... | # -*- coding: utf-8 -*-
import sys
import math
from bisect import bisect_left
from bisect import bisect_right
from collections import defaultdict
from heapq import heappop, heappush
import itertools
from decimal import *
input = sys.stdin.readline
def inputInt(): return int(eval(input()))
def inputMap():... | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
MAX = 1000005
cnt = [0] * MAX
for x in a:
if cnt[x] > 2:
continue
#cnt配列の各倍数のところに+1
for i in range(x, MAX, x):
cnt[i] += 1
ans = 0
for x in a:
if cnt[x] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
MAX = 1000005
cnt = [0] * MAX
for x in a:
if cnt[x] != 0:
cnt[x] = 2
continue
#cnt配列の各倍数のところに+1
for i in range(x, MAX, x):
cnt[i] += 1
ans = 0
for x in a:
if cnt[x] == 1:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
total = 0
flag = 0
for i in range(n):
if i != n-1:
if a[i] == a[i + 1]:
continue
for j in range(i):
if i == j:
continue
if int(a[i]/a[j]) == a[i]/a[j]:
flag = 1
break
if flag == 0... | n = int(eval(input()))
a = list(map(int, input().split()))
max_a = max(a)
l = [0] * max_a
for i in range(n):
j = 1
while a[i] * j - 1 < max_a:
l[a[i] * j - 1] += 1
j += 1
count = 0
for i in range(n):
if l[a[i] - 1] == 1:
count += 1
print(count) | p02642 |
ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
import math
MAX=10**6+1
n=ni()
a=nl()
s = [0]*(MAX)
for ai in a:
if s[ai]==2:
continue
for i in range(ai,MAX,ai):
s[i]+=1
cnt=0
for ai in a:
if s[ai]==1:
... | ni = lambda: int(eval(input()))
nm = lambda: list(map(int, input().split()))
nl = lambda: list(map(int, input().split()))
import math
MAX=10**6+1
n=ni()
a=nl()
s = [0]*(MAX)
for ai in a:
if s[ai]!=0:
s[ai]=2
continue
for i in range(ai,MAX,ai):
s[i]+=1
cnt=0
for ai in a:
if ... | p02642 |
N = int(eval(input()))
A = list(map(int, input().split()))
count = 0
for i in range(N):
is_ans = True
for j in range(N):
if i != j:
if A[i] % A[j] == 0:
is_ans = False
break
if is_ans:
count += 1
print(count)
| N = int(eval(input()))
A = list(map(int, input().split()))
def solve2(N, A):
A.sort()
amax = A[-1]
dp = [True] * (amax + 1)
cnt = [0] * (amax + 1)
for a in A:
cnt[a] += 1
for i in range(amax):
x = i + 1
if cnt[x] > 1:
dp[x] = False
... | p02642 |
n = int(eval(input()))
a = [int(i) for i in input().split()]
l = [0] * (max(a)+1)
# for i in a:
# c = 1
# while True:
# if i*c >= max(a):
# break
# l[i*c - 1] += 1
# c += 1
for i in a:
for j in range(i,max(a)+1, i):
l[j] += 1
ans... | n = int(eval(input()))
A = list(map(int,input().split()))
maxA = max(A)
ans = 0
flag = [0]*(maxA+1)
# print(flag)
for a in A:
for ax in range(a,maxA+1,a):
flag[ax] +=1
# print(flag)
for a in set(A):
if flag[a] == 1:
ans += 1
print(ans) | p02642 |
number = int(eval(input()))
# values = [i+2 for i in range(2*10**5)]
values = list(map(int, input().split()))
maxV = 10**6+1
dp = [0]*(maxV)
for a in values:
i = 1
if dp[a] > 1:
continue
while i * a < maxV:
i_a = i * a
dp[i_a] = dp[i_a] + 1
i += 1
count = 0... | number = int(eval(input()))
# values = [i+2 for i in range(2*10**5)]
values = list(map(int, input().split()))
maxV = 10**6+1
dp = [0]*(maxV)
for a in values:
i = 1
if dp[a] > 0:
dp[a] = dp[a] + 1
continue
while i * a < maxV:
i_a = i * a
dp[i_a] = dp[i_a] + 1
... | p02642 |
import collections
def divisor(n):
d = []
for i in range(1, int(n ** 0.5) + 1):
if n % i == 0:
d.append(i)
if i ** 2 == n:
continue
d.append(n // i)
return d
n = int(eval(input()))
A = list(map(int, input().split()))
set_A = set(A)
... | n = int(eval(input()))
A = list(map(int, input().split()))
MAX_N = max(A)+1
cnt = [0] * MAX_N
for a in A:
for i in range(a, MAX_N, a):
if cnt[i] <= 2: cnt[i] += 1
ans = 0
for a in A:
if cnt[a] == 1: ans += 1
print(ans) | p02642 |
n = int(eval(input()))
A = list(map(int, input().split()))
MAX_N = max(A)+1
cnt = [0] * MAX_N
for a in A:
for i in range(a, MAX_N, a):
if cnt[i] <= 2: cnt[i] += 1
ans = 0
for a in A:
if cnt[a] == 1: ans += 1
print(ans) | def main():
## IMPORT MODULE
#import sys
#sys.setrecursionlimit(100000)
#input=lambda :sys.stdin.readline().rstrip()
#f_inf=float("inf")
#MOD=10**9+7
if 'get_ipython' in globals():
## SAMPLE INPUT
n = 5
A = [24, 11, 8, 3, 16]
else:
##INPUT
n = int(eval(input(... | p02642 |
n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0]*(10**6+1)
for i in arr:
for j in range(i, len(dp), i):
if j in arr:
dp[j] += 1
print((dp.count(1))) | n = int(eval(input()))
arr = list(map(int, input().split()))
dp = [0]*(10**6+1)
for i in sorted(arr):
dp[i] += 1
if dp[i] == 1:
for j in range(2*i, len(dp), i):
dp[j] += 2
print((dp.count(1))) | p02642 |
import math
def sieve(n, done):
for i in range(n, 10**6+1, n):
done[i] = 1
n = int(eval(input()))
a = sorted(map(int, input().split()))
ans = 0
done = [0] * (10 ** 6 + 1)
for i in range(n):
num = a[i]
if i < n-1 and a[i] == a[i+1]:
sieve(num, done)
continue
... | import math
def sieve(n, done):
for i in range(n, 10**6+1, n):
done[i] = 1
n = int(eval(input()))
a = sorted(map(int, input().split()))
ans = 0
done = [0] * (10 ** 6 + 1)
for i in range(n):
num = a[i]
if i < n-1 and a[i] == a[i+1]:
if i > 0 and a[i] == a[i-1]:
c... | p02642 |
# distutils: language=c++
# cython: language_level=3, boundscheck=False, wraparound=False
# cython: cdivision=True
def INT(): return int(eval(input()))
def MAPINT(): return list(map(int, input().split()))
def LMAPINT(): return list(map(int, input().split()))
def STR(): return eval(input())
def MAPSTR(): return... | def main():
n = int(eval(input()))
a = list(map(int, input().split()))
ans = [0] * (max(a) + 1)
length = max(a) + 1
for x in a:
if ans[x] == 0:
for j in range(x, length, x):
ans[j] += 1
else:
ans[x] += 1
print((len(list([x for x in a if ans[x] == 1]))))
if _... | p02642 |
N = int(eval(input()))
As = sorted(list(map(int, input().split())))
As_set = set(As)
i = 0
while i < N - 1:
j = i + 1
while j < N:
if As[j] % As[i] == 0:
if As[j] in As_set:
As_set.remove(As[j])
As.pop(j)
N -= 1
else:
j += 1
i += 1
print((len(As_set))... | N = int(eval(input()))
A_list = list(map(int, input().split()))
M = max(A_list)+1
cnt = [0 for _ in range(M)]
for i in A_list:
if cnt[i] != 0:
cnt[i] = 2
continue
for j in range(i, M, i): cnt[j] += 1
ans = 0
for k in A_list:
if cnt[k] == 1: ans += 1
print(ans)
| p02642 |
# ABC170
n = eval(input())
a = list(map(int, input().split()))
a.sort()
maxa = max(a)
dp = [True for _ in range(maxa+1)]
ans = 0
for ai in a:
if dp[ai]:
for i in range(0, maxa+1, ai):
dp[i] = False
if a.count(ai) == 1:
ans += 1
print(ans)
| # ABC170
n = int(eval(input()))
a = list(map(int, input().split()))
a.sort()
a_max = max(a)
dp = [True for _ in range(a_max+1)]
ans = 0
for i in range(n):
if dp[a[i]]:
for j in range(0, a_max+1, a[i]):
dp[j] = False
if i > 0:
if a[i] == a[i-1]:
... | p02642 |
from bisect import bisect, bisect_left
N = int(eval(input()))
A = list(map(int, input().split()))
A_ = sorted(list(set(A)))
A = sorted(A)
ans = 0
i = 0
while i < len(A_):
a = A_[i]
j = bisect_left(A_, a*2)
while j < len(A_):
if A_[j] % a == 0:
A_.pop(j)
else:
j += 1
if bisect(... | N = int(eval(input()))
A = list(map(int, input().split()))
M = max(A)
memo = [0]*(M+1)
i = 0
while i < N:
a = A[i]
memo[a] += 1
x = a+a
while x <= M:
memo[x] += 2
x += a
i += 1
print((sum([1 if m == 1 else 0 for m in memo])))
| p02642 |
def main():
_ = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
B = []
sames = set()
for a in A:
isDividable = False
for b in B:
if a == b:
sames.add(b)
if a % b == 0:
isDividable = True
... | # import collections
def main():
_ = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
# sames = 0
# C = collections.Counter(A)
# for v in C.values():
# if v > 1:
# sames += 1
a_max = A[-1]
dp = [0] * (a_max + 1)
# dp = [True] *... | p02642 |
from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
f = [True] * (10 ** 6 + 1)
for k, v in list(p.items()):
... | from sys import stdin
def main():
from collections import defaultdict
input = stdin.readline
n = int(eval(input()))
a = sorted(list(map(int, input().split())))
p = defaultdict(int)
for x in a:
p[x] += 1
q = a[-1] + 1
f = [True] * (q)
for k, v in list(p.items())... | p02642 |
import collections
def main():
N = int(eval(input()))
A=list(map(int, input().split()))
C = collections.Counter(A)
B = list(set(A))
B.sort()
lenb = len(B)
Boo = [True]*lenb
s,_ = sieve((10**6)+5)
if C[1]>1:
print((0))
return
if C[1]==1:
... | import collections
def main():
N = int(eval(input()))
A=list(map(int, input().split()))
C = collections.Counter(A)
B = list(set(A))
B.sort()
lenb = len(B)
Boo = [True]*lenb
ZENBU = [False]*(10**6+4)
if C[1]>1:
print((0))
return
if C[1]==1:
... | p02642 |
a = int(eval(input()))
A = list(map(int, input().split()))
d_num = a
for i in range(a):
for j in range(a):
if(j == i): continue
if(A[i]%A[j] == 0):
d_num -= 1
break
print(d_num)
| n = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
ndiv_sum = 0
max_num = A[-1]
no_div = [True] * (max_num+1)
for i in range(len(A)-1):
if no_div[A[i]]:
for j in range(A[i], max_num+1, A[i]):
no_div[j] = False
if A[i]!=A[i+1]:
ndiv_sum += 1
if n... | p02642 |
n = int(eval(input()))
a = [int(x) for x in input().split()]
ans = 0
for i in range(n):
good = True
for j in range(n):
if j != i:
if a[i] % a[j] == 0:
good = False
break
if good:
ans += 1
print(ans) | n = int(eval(input()))
a = [int(x) for x in input().split()]
mx = max(a)
mark = [0 for _ in range(mx+1)]
for i in range(n):
for x in range(a[i], mx+1, a[i]):
mark[x] += 1
ans = 0
for i in range(n):
if mark[a[i]] == 1:
ans += 1
print(ans) | p02642 |
n = int(eval(input()))
a = list(map(int, input().split()))
l = [0]*(max(a) + 1)
ans = 0
for i in a:
for j in range(i, max(a) + 1, i):
l[j] += 1
for i in a:
if l[i] == 1:
ans += 1
print(ans) | n = int(eval(input()))
a = list(map(int, input().split()))
ln = max(a) + 1
l = [0]*ln
ans = 0
for i in a:
for j in range(i, ln, i):
l[j] += 1
for i in a:
if l[i] == 1:
ans += 1
print(ans) | p02642 |
MAX = int(1e6)+2
n = int(eval(input()))
lis = list(map(int,input().split()))
lis2 = [0]*MAX
# lis.sort()
# m = max(lis)
ans = 0
for num in lis:
lis2[num] += 1
for num in lis:
for i in range(num*2, MAX, num):
if lis2[i] > 0:
lis2[i] += 1
print((len([i for i in lis if lis2... | # MAX = int(1e6)+2
n = int(eval(input()))
lis = list(map(int,input().split()))
lis.sort()
MAX = lis[-1]
lis2 = [0]*(MAX+1)
# lis.sort()
# m = max(lis)
ans = 0
for num in lis:
for i in range(num, MAX+1, num):
lis2[i] += 1
for j in set(lis):
if lis2[j] == 1:
ans += 1
pri... | p02642 |
from collections import Counter
from itertools import chain
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(list(range(5, N + 1, 6)), list(range(7, N + 1, 6))))
for i in range(5,... | from collections import Counter
U = 10 ** 6 + 1
N = int(eval(input()))
A = list(map(int, input().split()))
C = Counter(A)
dp = [0] * U
ans = 0
for k in sorted(C.keys()):
if dp[k]:
continue
if C[k] == 1:
ans += 1
for i in range(k, U, k):
dp[i] = 1
print(ans) | p02642 |
n = int(eval(input()))
arr = list(map(int, input().split()))
arr.sort()
seen = set()
maxN = 1e6
count = 0
for i in range(1, n):
if arr[i] == arr[i-1]:
seen.add(arr[i])
for num in arr:
if num not in seen:
count += 1
curr = num
while curr <= maxN:
seen.add(curr)
... | from collections import defaultdict
n = int(eval(input()))
arr = list(map(int, input().split()))
arr.sort()
count = 0
ap = defaultdict(int)
for i in range(1, n):
if arr[i] == arr[i-1]:
ap[arr[i]] = 1
for i in range(n):
if not ap[arr[i]]:
count += 1
if i == 0 or arr[i] !... | p02642 |
import bisect
def make_divisors(n):
lower_divisors, upper_divisors = set(), set()
tmp = 1
while tmp * tmp <= n:
if n % tmp == 0:
lower_divisors.add(tmp)
if tmp != n // tmp:
upper_divisors.add(n // tmp)
tmp += 1
return lower_divisors |... | n = int(eval(input()))
*A, = list(map(int, input().split()))
maxA = max(A)
# C[a] = A内のaの個数
C = {a: 0 for a in range(1, maxA + 1)}
for a in A:
C[a] += 1
# D[a]=1: Aにaより小さいaの約数が存在する
D = {a: 0 for a in range(1, maxA + 1)}
for a in A:
if C[a] > 0:
tmp = 2
while a * tmp <= maxA:
... | p02642 |
n = int(eval(input()))
*A, = list(map(int, input().split()))
maxA = max(A)
# C[a] = A内のaの個数
C = {a: 0 for a in range(1, maxA + 1)}
for a in A:
C[a] += 1
# D[a]=1: Aにaより小さいaの約数が存在する
D = {a: 0 for a in range(1, maxA + 1)}
for a in A:
if C[a] > 0:
tmp = 2
while a * tmp <= maxA:
... | n = int(eval(input()))
*A, = list(map(int, input().split()))
maxA = max(A)
# C[a] = A内のaの個数
C = {a: 0 for a in A}
for a in A:
C[a] += 1
# D[a]=1: Aにaより小さいaの約数が存在する
D = {a: 0 for a in A}
for a in A:
if C[a] > 0:
tmp = 2
while a * tmp <= maxA:
D[a * tmp] = 1
t... | p02642 |
n=int(eval(input()))
A=list(map(int,input().split()))
A.sort()
num=[False for _ in range(max(A)+1)]
check=[False for _ in range(max(A)+1)]
for a in A:
if num[a]:
check[a]=True
else:
num[a]=True
for a in A:
if a>int(max(A)**1/2):
break
for k in range(2,max(A)//a... | N=int(eval(input()))
A=list(map(int,input().split()))
D=set()
S=set()
for i in range(N):
if A[i] in S:
D.add(A[i])
else:
S.add(A[i])
M=max(S)
X=[1 for i in range(M+1)]
for a in S:
if a in D:
X[a]=0
for i in range(2*a,M+1,a):
X[i]=0
ans=0
for i in range(N)... | p02642 |
#!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
ma = a[-1]
dup = [0 for _ in range(ma+1)]
div = [0 for _ in range(ma+1)]
for i in range(n):
dup[a[i]] += 1
#print('dup =', dup)
for i in range(n):
for j in range(a[i], ma+1, a[i]):
div[j] +... | #!/usr/bin/env python
n = int(eval(input()))
a = list(map(int, input().split()))
a = sorted(a)
ma = a[-1]
div = [0 for _ in range(ma+1)]
for i in range(n):
for j in range(a[i], ma+1, a[i]):
div[j] += 1
ans = 0
for i in range(n):
if div[a[i]] == 1:
ans += 1
print(ans) | p02642 |
#!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
from math import factorial
from collections import Counter
def solve(N: int, S: str):
counter = dict(Counter(S))
values = list(counter.values())
LEN = len(counter)
answer = 0
for i in range(1,2**LEN):
b = fo... | #!/usr/bin/env python3
import sys
MOD = 1000000007 # type: int
from collections import Counter
from itertools import product
def solve(N: int, S: str):
counter = dict(Counter(S))
values = list(counter.values())
LEN = len(values)
answer = values[0]+1
if LEN >= 2:
for i in range(... | p03095 |
from collections import Counter
from itertools import product
N = int(eval(input()))
S = input().strip()
dic = Counter(S)
c = dic.most_common()
mod = 10**9 + 7
ans = 0
d = []
append = d.append
for x in c:
if x[1] == 1:
break
else:
append(x[1])
b = len(c)-len(d)
ls =list(pro... | from collections import Counter
from itertools import product
N = int(eval(input()))
S = input().strip()
dic = Counter(S)
c = dic.most_common()
mod = 10**9 + 7
ans = 0
d = []
for x in c:
if x[1] == 1:
break
else:
d.append(x[1])
b = len(c)-len(d)
ls =list(product([0, 1], r... | p03095 |
from collections import Counter
from itertools import product
N = int(eval(input()))
S = input().strip()
dic = Counter(S)
c = dic.most_common()
mod = 10**9 + 7
ans = 0
d = []
for x in c:
if x[1] == 1:
break
else:
d.append(x[1])
b = len(c)-len(d)
ls =list(product([0, 1], r... | from collections import Counter
from itertools import product
N = int(eval(input()))
S = input().strip()
dic = Counter(S)
mod = 10**9 + 7
ans = 1
for x in dic:
ans = ans*(dic[x]+1)%mod
print((ans-1)) | p03095 |
import sys
input=sys.stdin.readline
ans = 0
# 文字列 s2 の末尾までを走査して、
# s1 にまだ表れていない文字があれば連結して、
# 連結後の s1 と、s2 から走査済みの文字を除いたものを返す
def func(s1, s2):
global ans
if s2 == "":
return None
for i,c in enumerate(s2):
if c not in s1:
ans += 1
t1 = s1 + c
... | import sys
input=sys.stdin.readline
N = int(eval(input()))
S = input().strip()
h = {}
for c in S:
if c in h:
h[c] += 1
else:
h[c] = 1
ans = 1
for v in list(h.values()):
ans *= v+1
ans -= 1
print((ans%(10**9+7)))
| p03095 |
# AGC031A - Colorful Subsequence
from functools import reduce
def main():
_ = int(eval(input()))
S = input().rstrip()
MOD = 10 ** 9 + 7
C = [S.count(i) + 1 for i in set(S)]
ans = reduce(lambda x, y: (x * y) % MOD, C)
print((ans - 1))
if __name__ == "__main__":
main() | # AGC031A - Colorful Subsequence
def main():
_ = int(eval(input()))
S = input().rstrip()
MOD = 10 ** 9 + 7
ans = 1
for i in set(S):
ans *= S.count(i) + 1
print((ans % MOD - 1))
if __name__ == "__main__":
main() | p03095 |
# _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
SSorted = sorted(S)
# SSorted = aabbc
stringCounterBox = Counter(SSorted)
# [(a,2),(b,2),(c,1)]
maxStrLength = len... | # _*_ coding:utf-8 _*_
# Atcoder_Grand_Contest031-A
# TODO https://atcoder.jp/contests/agc031/tasks/agc031_a
from collections import Counter
def solveProblem(S):
# Sはサンプル3の[abcab]を取って説明
# SSorted = sorted(S)
# SSorted = aabbc
# Counterクラスを使うと整列もしれくれるのでソートは不要と判断
stringCounterBox = Counter(S)
# [(a,2)... | p03095 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03095 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03095 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
import sys
from collections import Counter, defaultdict, deque
from decimal import ROUND_CEILING, ROUND_HALF_UP, Decimal
from functools import lru_cache, reduce
from itertools import combinations, combinations_with_replacement, produc... | p03095 |
import sys,itertools
input = sys.stdin.readline
N = int(input().strip())
S = input().strip()
le = [S.count(s) for s in set(S)]
cnt = 0
for i in range(len(le)):
for s in itertools.combinations(le,i+1):
t=1
for tt in s:
t*=tt
cnt+=t
print((cnt%((10**9)+7))) | import sys,itertools
input = sys.stdin.readline
N = int(input().strip())
S = input().strip()
le = [S.count(s)+1 for s in set(S)]
cnt=1
for i in le:
cnt*=i
print(((cnt-1)%((10**9)+7))) | p03095 |
import sys
from string import ascii_lowercase
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
N = read_int()[0]
S = read_str()
res = 1
count = [0 for _ in range(26)]
alpha = ascii_lowercase
for i in range(N):
if S[i] in S[:... | import sys
from string import ascii_lowercase
stdin = sys.stdin
read_int = lambda : list(map(int,stdin.readline().split()))
read_str = lambda : stdin.readline().rstrip()
N = read_int()[0]
S = read_str()
res = 1
count = [0 for _ in range(26)]
alpha = ascii_lowercase
for i in range(N):
st = alpha.fin... | p03095 |
import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | import sys
stdin = sys.stdin
sys.setrecursionlimit(10**5)
def li(): return list(map(int, stdin.readline().split()))
def li_(): return [int(x)-1 for x in stdin.readline().split()]
def lf(): return list(map(float, stdin.readline().split()))
def ls(): return stdin.readline().split()
def ns(): return stdin.re... | p03095 |
from itertools import combinations
p = 10**9+7
N = int(eval(input()))
S = input().strip()
C = {}
for i in range(N):
if S[i] not in C:
C[S[i]]=0
C[S[i]] += 1
D = list(C.items())
n = len(D)
cnt = 0
for i in range(1,n+1):
for x in combinations(list(range(n)),i):
prod = 1
... | p = 10**9+7
N = int(eval(input()))
S = input().strip()
C = {chr(i):[] for i in range(97,123)}
for i in range(N):
C[S[i]].append(i)
cnt = 1
for j in range(97,123):
cnt = (cnt*(1+len(C[chr(j)])))%p
print(((cnt-1)%p)) | p03095 |
import itertools
from operator import mul
from functools import reduce
def comb(r,n):
r = min(n-r,r)
if r == 0: return 1
over = reduce(mul, list(range(n, n - r, -1)))
under = reduce(mul, list(range(1,r + 1)))
return over // under
mod = 10**9 + 7
n = int(input())
s = input()
ans = 0
q ... | mod = 10**9 + 7
n = int(input())
s = input()
q = []
for a in "abcdefghijklmnopqrstuvwxyz":
q.append( s.count(a) )
ans = 1
for a in q:
ans *= (a+1)
ans %= mod
print(ans-1) | p03095 |
def slove():
import sys
import collections
input = sys.stdin.readline
n = int(input().rstrip('\n'))
s = collections.Counter(str(input().rstrip('\n')))
t = 1
for k, v in list(s.items()):
t = (t * (v + 1)) % (10 ** 9 + 7)
print((t - 1))
if __name__ == '__main__':
... | import sys
import collections
def solve():
readline = sys.stdin.buffer.readline
mod = 10 ** 9 + 7
n = int(readline())
s = str(readline().rstrip().decode('utf-8'))
s = collections.Counter(s)
t = 1
for k, v in list(s.items()):
t *= (v + 1)
t %= mod
print((t ... | p03095 |
import sys
from collections import Counter
from itertools import product
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N = int(eval(input()))
S = input().rstrip()
c = Counter(S)
values = list(c.values())
ans = -1
for comb in product(list(range(2)), repeat=len(values))... | import sys
from collections import Counter
input = sys.stdin.readline
P = 10 ** 9 + 7
def main():
N = int(eval(input()))
S = input().rstrip()
c = Counter(S)
ans = 1
for v in list(c.values()):
ans = (ans * (v + 1)) % P
ans = (ans - 1) % P
print(ans)
if __nam... | p03095 |
n = int(eval(input()))
dp = [0]
for i in range(1, n+1):
q = []
q.append(1+dp[i-1])
a = 1
while True:
a *= 6
if a > i:
break
q.append(1+dp[i-a])
b = 1
while True:
b *= 9
if b > i:
break
q.append(1+dp[i-b... | n = int(eval(input()))
ans = pow(10, 10)
for i in range(n+1):
cnt = 0
j = n - i
while i > 0:
cnt += i % 6
i //= 6
while j > 0:
cnt += j % 9
j //= 9
ans = min(ans, cnt)
print(ans) | p03329 |
# 貪欲的だが「6^i円で払う分」と「9^i円で払う分」にNを分割してN+1通り全探索．
def how_many_times_withdraw(withdraw, base, limit):
result = 0
while withdraw >= base:
result += withdraw // (base ** limit)
withdraw = withdraw % (base ** limit)
limit -= 1
return result + withdraw
def main():
N = int... | def make_list(a, n):
res = [1]
i = 1
while pow(a, i) <= n:
res.append(pow(a, i))
i += 1
return res[::-1]
def find_withdraw_times(n, w):
res = 0
for ww in w:
res += n // ww
n %= ww
return res
def main():
n = int(eval(input()))
ans... | p03329 |
import sys
import math
N = int(sys.stdin.readline().rstrip())
# def create_money(i):
# money = []
# tmp = 1
# for _ in range(math.floor(math.log(N, i))):
# tmp *= i
# money.append(tmp)
# return money
# money = [1]
# money += create_money(6)
# money += create_money(9... | import sys
import math
N = int(sys.stdin.readline().rstrip())
# def create_money(i):
# money = []
# tmp = 1
# for _ in range(math.floor(math.log(N, i))):
# tmp *= i
# money.append(tmp)
# return money
# money = [1]
# money += create_money(6)
# money += create_money(9... | p03329 |
n = int(eval(input()))
dp = [float("Inf")]*(n+1)
for i in range(n+1):
if i < 6:dp[i] = i
power = 1
while i >= 6 ** power:
dp[i] = min(dp[i],dp[i-6**power]+1)
power += 1
power = 1
while i >= 9 ** power:
dp[i] = min(dp[i],dp[i-9**power]+1)
power += 1
print((... | n = int(eval(input()))
dp = [float("Inf")]*(n+1)
for i in range(n+1):
if i < 6:dp[i] = i
power = 1
while i >= 6 ** power:
if dp[i] > dp[i-6**power]+1:dp[i] = dp[i-6**power] + 1
power += 1
power = 1
while i >= 9 ** power:
if dp[i] > dp[i-9**power]+1:dp[i] = dp[i-9**p... | p03329 |
l9 = []
l9.append(1)
tmp = 1
while tmp <= 10**5:
tmp *= 9
l9.append(tmp)
l6 = []
l6.append(1)
tmp = 1
while tmp <= 10**5:
tmp *= 6
l6.append(tmp)
import bisect
n = int(eval(input()))
ans = 10**6
for i in range(0, n+1):
a = i
b = n - i
p = 0
while a > 0:
idx = bisect.bi... | import bisect
N = int(eval(input()))
ans = N
sixs = [1]
i = 6
while i <= N:
sixs.append(i)
i *= 6
nines = [1]
i = 9
while i <= N:
nines.append(i)
i *= 9
for i in range(N+1):
#iの分だけ6**xで構成
cnt = 0
a = i
b = N-i
while a > 0:
idx = bisect.bisect_right(sixs... | p03329 |
import bisect
N = int(eval(input()))
ans = N
sixs = [1]
i = 6
while i <= N:
sixs.append(i)
i *= 6
nines = [1]
i = 9
while i <= N:
nines.append(i)
i *= 9
for i in range(N+1):
#iの分だけ6**xで構成
cnt = 0
a = i
b = N-i
while a > 0:
idx = bisect.bisect_right(sixs... | from bisect import bisect_right
def main():
N = int(eval(input()))
sixs = [1]
i = 6
while i <= N:
sixs.append(i)
i *= 6
nines = [1]
i = 9
while i <= N:
nines.append(i)
i *= 9
"""
i円分を6**xxx で、 残りを９**yyyと１*zzzで構成する。これらを全通り試す
... | p03329 |
n = int(eval(input()))
dp = [float('Inf')] * (100000 + 1)
dp[0] = 0
for i in range(1, n + 1):
dp[i] = dp[i - 1] + 1
cnt = 1
for j in range(0, 7):
cnt *= 6
if i - cnt >= 0:
dp[i] = min(dp[i], dp[i - cnt] + 1)
cnt = 1
for j in range(0, 6):
cnt *= 9
... | n = int(eval(input()))
dp = [float('Inf')] * (n + 1)
dp[0] = 0
for i in range(1, n + 1):
j = 1
while j <= i:
dp[i] = min(dp[i], dp[i - j] + 1)
j *= 6
j = 1
while j <= i:
dp[i] = min(dp[i], dp[i - j] + 1)
j *= 9
print((dp[n])) | p03329 |
from collections import deque
def main():
N = int(eval(input()))
divs = [59049, 46656, 7776, 6561, 1296, 729, 216, 81, 36, 9, 6, 1]
dp = [0]*(10**6+1)
def f(x):
if x == 0:
return 0
if x < 0:
return 10**6
if dp[x]:
return dp[x]
... | def main():
N = int(eval(input()))
amounts = [1]
lim = 10**6
mul6 = 6
while mul6 < lim:
amounts.append(mul6)
mul6 *= 6
mul9 = 9
while mul9 < lim:
amounts.append(mul9)
mul9 *= 9
dp = [lim] * (N+1)
dp[0] = 0
for i in range(N):
... | p03329 |
n = int(eval(input()))
#引き出せる金額の列挙
Withdr = [1] + [6**i for i in range(1, 7)] + [9**i for i in range(1,6)]
INF = 100010
dp = [INF]*159050
dp[0] = 0
#全てを順に計算
for j in range(n + 1):
#あるnに対し複数の計算方法があるため、それらの中で一番少ないものをdpに格納する
for WithdrOrder in Withdr:
#dp[j + WithdrOrder]は今までに計算した最小値とdp[j]から1... | N=int(eval(input()))
ans=N
for i in range(N+1):
element_cnt=0
t=i
'''Nを6の累乗で処理する部分(i)と9の累乗で処理する部分(j)に分ける
ある数(i)を6で割った余りは6のゼロ乗の要素がいくつ含まれるかを示す
ある数の6の商をさらに6で割った余りは、ある数に6の1乗がいくつ含まれるかを示す
ある数の6の商の6の商をさらに6で割った余りは、ある数に6の2乗がいくつ含まれるかを示す
したがって、ある数を6で割って余りと商を順に処理すれば6の累乗の要素がどれだけあるかがわかる。
最終的... | p03329 |
N = int(eval(input()))
A=[]
A.append(1)
for i in range(1,7):
A.append(6**i)
for i in range(1,6):
A.append(9**i)
A.sort()
dp=[10*5+5]*(N+1)
dp[0]=0
for i in range(1,N+1):
for s in range(len(A)):
if i-A[s]>=0:
dp[i]=min(dp[i-A[s]]+1,dp[i])
print((dp[N]))
| N = int(eval(input()))
def shin(n,q):
s = n
a = 0
while(s>0):
t=s%q
a +=t
s=(s-t)//q
return a
ans = N
for i in range(N+1):
c=shin(i,6)+shin(N-i,9)
ans = min(ans,c)
print(ans) | p03329 |
def solve():
n = int(eval(input()))
dp = [[False]*(n+1)]
dp[0][0] = True
way = [1] + [6**i for i in range(1,9) if 6**i <= n] + [9**i for i in range(1,7) if 9**i <= n]
while True:
newline = [False] * (n+1)
for w in way:
for i in range(0, n+1):
if i... | def solve():
n = int(eval(input()))
dp = [True] + [False]*(n+1)
way = [1] + [6**i for i in range(1,9) if 6**i <= n] + [9**i for i in range(1,7) if 9**i <= n]
loop_counter = 0
while True:
loop_counter += 1
newdp = [False] * (n+1)
for w in way:
for i in ran... | p03329 |
# ABC099C - Strange Bank
# DP ver.
def main():
n = int(eval(input()))
dp = [i for i in range(n + 1)] # initialize with using only ¥1
cand = [6 ** i for i in range(1, 7) if 6 ** i <= n]
cand += [9 ** i for i in range(1, 6) if 9 ** i <= n]
for i in range(n + 1):
for j in cand:
... | # ABC099C - Strange Bank
# DP ver.
def main():
n = int(eval(input()))
dp = [i for i in range(n + 1)] # initialize with using only ¥1
cand = [6 ** i for i in range(1, 7) if 6 ** i <= n]
cand += [9 ** i for i in range(1, 6) if 9 ** i <= n]
for i in range(n + 1):
for j in cand:
... | p03329 |
import sys
input = sys.stdin.readline
def main():
N = int(eval(input()))
dp = [0] * (10 ** 5 + 1)
dp[1] = 1
x = [1]
x.extend([6 ** x for x in range(1, 8)])
x.extend([9 ** x for x in range(1, 6)])
for i in range(2, 10 ** 5 + 1):
tmp = []
for v in x:
... | N = int(eval(input()))
dp = [0] * 100001
dp[1] = 1
for i in range(2, N + 1):
dp[i] = dp[i - 1] + 1
j = 1
while 6 ** j <= i:
dp[i] = min(dp[i], dp[i - (6 ** j)] + 1)
j += 1
j = 1
while 9 ** j <= i:
dp[i] = min(dp[i], dp[i - (9 ** j)] + 1)
j += 1
pr... | p03329 |
ans = [0] * 100100
ans[0] = 0
n = int(eval(input()))
#n = 127
for i in range(1,n+1):
cand1 = ans[i-1]
cand2 = 100001
cand3 = 100001
x = 6
while (x<=i):
cand2 = min(ans[i-x], cand2)
x=6*x
y = 9
while (y<=i):
cand3 = min(ans[i-y], cand3)
y=9*y
... | # -*- coding: utf-8 -*-
"""
Created on Mon Aug 6 17:34:40 2018
@author: Yuki
"""
ans = [0] * 100100
ans[0] = 0
n = int(eval(input()))
#n = 127
for i in range(1,n+1):
cand1 = ans[i-1]
cand2 = 100001
cand3 = 100001
x = 6
while (x<=i):
#cand2 = min(ans[i-x], cand2)
... | p03329 |
import math
n = int(eval(input()))
#n = 127
inf = float('inf')
dp = [inf]*(n+100000)
dp[0]=0
#print(dp)
#print(len(dp))
def motome(target):
tmp = []
for i in range(10):
if 9**i <= n:
tmp.append(9**i)
if 6**i <= n:
tmp.append(6**i)
#print(tmp)
... | n = int(eval(input()))
inf = float('inf')
dp = [inf]*(n+1)
dp[0] = 0
a = 1
b = 6
c = 9
for i in range(1,n+1):
if i>=b*6:
b*=6
if i>=c*9:
c*=9
if i<6:
dp[i] = i
elif i<9:
dp[i] = min(dp[i],dp[i-b]+1)
else:
dp[i] = min(dp[i],dp[i-b]+1,dp[i-c]+1)... | p03329 |
# 配るDP
N=int(eval(input()))
dp = [100000] * 200005;
g = [1]
a = 6
while a <= 100000:
g.append(a)
a *= 6
a = 9
while a <= 100000:
g.append(a)
a *= 9
g.sort(reverse=True)
dp[0] = 0
for i in range(N):
for j in g:
dp[i+j] = min( dp[i+j], dp[i]+1 )
print((dp[N]))
| # BFS
from collections import deque
N=int(eval(input()))
dp = [-1] * 200005;
q = deque()
g = [1]
a = 6
while a <= 100000:
g.append(a)
a *= 6
a = 9
while a <= 100000:
g.append(a)
a *= 9
g.sort(reverse=True)
dp[0] = 0
q.append(0)
while len(q) > 0:
v = q.popleft()
if v == N: break
... | p03329 |
N = int(eval(input()))
ans = 10**13
Y = [9**i for i in range(1, 10)] + [6**i for i in range(1, 10)]
Y = sorted(Y, reverse=True)
for i in range(N+1):
tmp = 0
n = N-i
for j in range(10, -1, -1):
if i // 9**j > 0:
tmp += i // 9**j
i %= 9**j
for j in range(10, -1, ... | # dp answer
N = int(eval(input()))
dp = [N for i in range(N+1)]
dp[0] = 0
Y = [1] + [6**i for i in range(1, 10) if 6**i <= N] + [9**i for i in range(1, 10) if 9**i <= N]
Y = sorted(Y)
for i in range(1, N+1):
for y in Y:
if i-y < 0:
break
dp[i] = min(dp[i], dp[i-y]+1)
print((dp... | p03329 |
import math
N = int(eval(input()))
dp=[100000]*(100000+1)
dp[0]=0
dp[1:5]=list(range(1,6))
dp[6:9]=list(range(1,4))
for n in range(9,N+1):
k9=0
k6=0
while n//(9**k9)>=9:
k9+=1
while n//(6**k6)>=6:
k6+=1
dp[n]=min(dp[n],dp[n-6**k6]+1,dp[n-9**k9]+1,dp[n-1]+1)
print((dp[N])) | import math
N = int(eval(input()))
dp=[100000]*(100000+1)
dp[0]=0
dp[1:5]=list(range(1,6))
dp[6:9]=list(range(1,4))
k9=0
k6=0
for n in range(9,N+1):
while n//(9**k9)>=9:
k9+=1
while n//(6**k6)>=6:
k6+=1
dp[n]=min(dp[n],dp[n-6**k6]+1,dp[n-9**k9]+1,dp[n-1]+1)
print((dp[N]))
| p03329 |
n=int(eval(input()))
import math
ansa=[0]
ansb=[0]
ans=[]
cnt=0
x=0
y=0
for i in range(1,n+1):
while 9**(x+1)<=i:
x+=1
for j in range(x,-1,-1):
z=(math.floor(i/(9**j))%9)
i-=(9**j)*z
cnt+=z
ansa.append(cnt)
cnt=0
for i in range(1,n+1):
whil... | n=int(eval(input()))
li6=[46656,7776,1296,216,36,6,1]
li9=[59049,6561,729,81,9,1]
dp6=[0]*(n+1)
dp9=[0]*(n+1)
dp6[1]=1
dp9[1]=1
ans=[]
for i in range(2,n+1):
for j in range(7):
if i>=li6[j]:
k=i-li6[j]
break
dp6[i]=1+dp6[k]
for i in range(2,n+1):
for j in rang... | p03329 |
num = [i for i in range(0,100001)]
for j in range(1,100001):
num[j] = j//6 + num[j%6]
for j in range(1,100001):
num[j] = min(num[j],j//9+num[j%9])
for j in range(1,100001):
num[j] = min(num[j],j//36+num[j%36])
for j in range(81,324):
num[j] = min(num[j],1+num[j-81])
for ... | SixNum = [i for i in range(0,100001)]
for i in range(1,7):
for j in range(1,100001):
SixNum[j] = min(SixNum[j],j//(6**i) + SixNum[j%(6**i)])
NineNum = [i for i in range(0,100001)]
for i in range(1,6):
for j in range(1,100001):
NineNum[j] = min(NineNum[j],j//(9**i... | p03329 |
SixNum = [i for i in range(0,100001)]
for i in range(1,7):
for j in range(1,100001):
SixNum[j] = min(SixNum[j],j//(6**i) + SixNum[j%(6**i)])
NineNum = [i for i in range(0,100001)]
for i in range(1,6):
for j in range(1,100001):
NineNum[j] = min(NineNum[j],j//(9**i... | n=int(eval(input()))
dp=[10**10]*(n+1)
dp[0]=0
for i in range(1,n+1):
dp[i]=dp[i-1]+1
x=0
while 9**(x+1)<=i:
x+=1
dp[i]=min(dp[i],dp[i-9**x]+1)
x=0
while 6**(x+1)<=i:
x+=1
dp[i]=min(dp[i],dp[i-6**x]+1)
print((dp[n]))
| p03329 |
n = int(eval(input()))
a = 6
b = [1]
b.append(a)
while a <= 100000:
a *= 6
b.append(a)
c = 9
b.append(c)
while c <= 100000:
c *= 9
b.append(c)
b.sort()
INF = 10**7
dp = [INF]*100001
dp[0] = 0
for i in range(100001):
for j in b:
if i + j > 100000:
continue
dp[i+j] = min(dp[i]+1, dp[i+j])
... | n = int(eval(input()))
ary = [1]
x = 1
for i in range(6):
x *= 6
ary.append(x)
x = 1
for i in range(5):
x *= 9
ary.append(x)
ary.sort()
dp = [i for i in range(n+1)]
for i in range(1,n+1):
for j in ary:
if j > i:
break
dp[i] = min(dp[i],dp[i-j]+1)
print((dp[n])) | p03329 |
n = int(eval(input()))
ary = [1]
x = 1
for i in range(6):
x *= 6
ary.append(x)
x = 1
for i in range(5):
x *= 9
ary.append(x)
ary.sort()
dp = [i for i in range(n+1)]
for i in range(1,n+1):
for j in ary:
if j > i:
break
dp[i] = min(dp[i],dp[i-j]+1)
print((dp[n])) | n = int(eval(input()))
ary = [1]
x = 1
for i in range(6):
x *= 6
ary.append(x)
x = 1
for i in range(5):
x *= 9
ary.append(x)
ary.sort()
dp = [i for i in range(n+1)]
for i in range(1,n+1):
for j in ary:
if j > i:
continue
dp[i] = min(dp[i],dp[i-j]+1)
print((dp[n])) | p03329 |
def main():
n = int(eval(input()))
m = [10 ** 5 for _ in range(n + 1)]
m[0] = 0
for i in range(1, n + 1):
j = 0
while i - 6 ** j >= 0:
m[i] = min(1 + m[i - 6 ** j], m[i])
j += 1
j = 0
while i - 9 ** j >= 0:
m[i] = min(1 + m[i... | def main():
import bisect
n = int(eval(input()))
m = [10 ** 5 for _ in range(n + 1)]
m[0] = 0
a = [6 ** i for i in range(7)]
b = [9 ** i for i in range(6)]
c = sorted(a + b)
for i in range(1, n + 1):
j = bisect.bisect_right(c, i)
k = [1 + m[i - x] for l, x in en... | p03329 |
# 配るDP
n = int(eval(input()))
max_n = 110000
dp = [n] * max_n
# 初期化
dp[0] = 0
for i in range(n):
pow6, pow9 = 1, 1
while i + pow6 <= n:
dp[i + pow6] = min(dp[i + pow6], dp[i] + 1)
pow6 *= 6
while i + pow9 <= n:
dp[i + pow9] = min(dp[i + pow9], dp[i] + 1)
... | # 貰うDP
n = int(eval(input()))
max_n = 110000
dp = [n] * max_n
# 初期化
dp[0] = 0
for i in range(1, n + 1):
pow6, pow9 = 1, 1
while pow6 <= i:
dp[i] = min(dp[i], dp[i - pow6] + 1)
pow6 *= 6
while pow9 <= i:
dp[i] = min(dp[i], dp[i - pow9] + 1)
pow9 *= 9
... | p03329 |
def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
from collections import d... | def getN():
return int(eval(input()))
def getNM():
return list(map(int, input().split()))
def getList():
return list(map(int, input().split()))
def getArray(intn):
return [int(eval(input())) for i in range(intn)]
def input():
return sys.stdin.readline().rstrip()
def rand_N(ran1, ran2):
... | p03329 |
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
import sys
# import numpy as np
# from scipy.special import comb
sys.setrecursionlimit(100000)
INF = float('inf')
N = int(eval(input()))
memo = [INF] * (N + 1)
memo[0] = 0
def f(n):... | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
import sys
# import numpy as np
# from scipy.special import comb
sys.setrecursionlimit(100000)
INF = 100100100
N = int(eval(input()))
memo = [-1] * (N + 1)
memo[0] = 0
def f(n):
... | p03329 |
# import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
import sys
# import numpy as np
# from scipy.special import comb
sys.setrecursionlimit(100000)
INF = 100100100
N = int(eval(input()))
memo = [-1] * (N + 1)
memo[0] = 0
def f(n):
... | # import math
# import itertools
# from collections import deque
# from collections import defaultdict
# import heapq
# import sys
# import numpy as np
# from scipy.special import comb
INF = 100100100
def main():
N = int(eval(input()))
memo = [INF] * (N + 1)
memo[0] = 0
for i in r... | p03329 |
n = int(eval(input()))
dp = [float('inf')]*100001
dp[0] = 0
for i in range(1,100001):
p = 1
while p <= i:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 6
p = 1
while p <= i:
dp[i] = min(dp[i], dp[i-p] + 1)
p *= 9
print((dp[n])) | n = int(eval(input()))
minC = n
for i in range(n+1):
cnt = 0
t = i
while t > 0:
cnt += t%6
t //= 6
t = n-i
while t > 0:
cnt += t%9
t //= 9
if minC > cnt:
minC = cnt
print(minC) | p03329 |
# 引き出したいお金の額を入力する
N = int(eval(input()))
# 整数aの累乗のうち、整数N以下かつ最も大きいものを返す関数を定義
def func(N, a):
index = 0
while True:
if a ** (index + 1) <= N:
index += 1
else:
break
return a ** index
# 引き出し回数を再帰的に求める関数を定義
def search_times_re(N):
times = 0
if N ... | N = int(eval(input()))
ans = N
for i in range(0, N + 1, 6):
cnt = 0
j = N - i
while i > 0:
cnt += i % 6
i //= 6
while j > 0:
cnt += j % 9
j //= 9
ans = min(ans, cnt)
print(ans) | p03329 |
# https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = s_inpl() | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,.... | # https://qiita.com/_-_-_-_-_/items/34f933adc7be875e61d0
# abcde s=input() s='abcde'
# abcde s=list(input()) s=['a', 'b', 'c', 'd', 'e']
# 5(1つだけ) a=int(input()) a=5
# 1 2 | x,y = s_inpl() | x=1,y=2
# 1 2 3 4 5 ... n li = input().split() li=['1','2','3',...,'n']
# 1 2 3 4 5 ... n li = inpl() li=[1,2,3,4,5,.... | p03329 |
N = int(eval(input()))
DP = [100000000] * (N+1)
DP[0] = 0
for i in range (N):
DP[i + 1] = DP[i] + 1
for j in range (100):
if 6**j <= i + 1:
DP[i + 1] = min(DP[i + 1],DP[i + 1 - 6**j] + 1)
for j in range (100):
if 9**j <= i + 1:
DP[i + 1] = min(DP[i + 1],DP[i... | N = int(eval(input()))
DP = [100000000] * (N+1)
DP[0] = 0
for i in range (N):
DP[i + 1] = DP[i] + 1
for j in range (8):
if 6**j <= i + 1:
DP[i + 1] = min(DP[i + 1],DP[i + 1 - 6**j] + 1)
for j in range (8):
if 9**j <= i + 1:
DP[i + 1] = min(DP[i + 1],DP[i + 1... | p03329 |
n = int(eval(input()))
dp = [1000000] * 100010
dp[0] = 0
for i in range(n):
a = 1
while i + a <= 100000:
dp[i + a] = min(dp[i + a], dp[i] + 1)
a *= 6
b = 1
while i + b <= 100000:
dp[i + b] = min(dp[i + b], dp[i] + 1)
b *= 9
print((dp[n]))
| n = int(eval(input()))
dp = [1000000] * 100010
dp[0] = 0
for i in range(1, n + 1):
a = 1
while a <= i:
dp[i] = min(dp[i], dp[i - a] + 1)
a *= 6
b = 1
while b <= i:
dp[i] = min(dp[i], dp[i - b] + 1)
b *= 9
print((dp[n]))
| p03329 |
N = int(eval(input()))
def Base10toN(X, n):
if (int(X / n)):
return Base10toN(int(X / n), n) + str(X % n)
else:
return str(X % n)
def f(amount):
if amount <= 5:
return amount
s = Base10toN(amount, 6)
fs = f(amount - 6 ** (len(s) - 1))
n = Base10toN(amount, ... | N= int(eval(input()))
memo = [-1] * 100001
def Base10toN(X, n):
if (int(X / n)):
return Base10toN(int(X / n), n) + str(X % n)
else:
return str(X % n)
def f(amount):
if memo[amount] != -1:
return memo[amount]
if amount <= 5:
memo[amount] = amount
re... | p03329 |
def main():
n = int(eval(input()))
money = sorted([6 ** i for i in range(7)] + [9 ** i for i in range(1, 6)], reverse=True)
dp = [0] + [1000000] * n
for i in range(1, n + 1):
dp[i] = min(dp[i], *[dp[i - j] + 1 for j in money if i - j >= 0])
print((dp[n]))
if __name__ == '__main__':
... | def main():
n = int(eval(input()))
money = sorted([6 ** i for i in range(7)] + [9 ** i for i in range(1, 6)], reverse=True)
dp = [0] * (n + 1)
for i in range(1, n + 1):
dp[i] = min(dp[i - j] + 1 for j in money if i - j >= 0)
print((dp[n]))
if __name__ == '__main__':
main() | p03329 |
N=int(eval(input()))
dp=[10**7]*3000000
dp[0]=0
pow6=[6**j for j in range(10) if 6**j <= N]
pow9=[9**j for j in range(10) if 9**j <= N]
for i in range(N):
for p6 in pow6:
dp[i+p6]=min(dp[i+p6], dp[i]+1)
for p9 in pow9:
dp[i+p9]=min(dp[i+p9], dp[i]+1)
print((dp[N])) | N = int(eval(input()))
ans = 10**10
for i in range(N+1):
cc = 0
t = i
while t > 0:
cc += t % 6
t //= 6
t = N-i
while t > 0:
cc += t % 9
t //= 9
if ans > cc:
ans = cc
print(ans)
| p03329 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.