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]:
f=0;break
for j in range(x,p+1,x):
g[j]=1
if f and (i!=n-1 and l[i+1]!=l[i]):
an+=1
elif f and i==n-1:
an+=1
print(an) | 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((arr.count(1)))
main() | 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]):
flag[j]=False
print((arr.count(1))) | 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,313,317,331,337,347,349,353,359,367,373,379,383,389,397,401,409,419,421,431,433,439,443,449,457,461,463,467,479,487,491,499,503,509,521,523,541,547,557,563,569,571,577,587,593,599,601,607,613,617,619,631,641,643,647,653,659,661,673,677,683,691,701,709,719,727,733,739,743,751,757,761,769,773,787,797,809,811,821,823,827,829,839,853,857,859,863,877,881,883,887,907,911,919,929,937,941,947,953,967,971,977,983,991,997,1009,1013,1019,1021,1031,1033,1039,1049,1051,1061,1063,1069,1087,1091,1093,1097,1103,1109,1117,1123,1129,1151,1153,1163,1171,1181,1187,1193,1201,1213,1217,1223,1229,1231,1237,1249,1259,1277,1279,1283,1289,1291,1297,1301,1303,1307,1319,1321,1327,1361,1367,1373,1381,1399,1409,1423,1427,1429,1433,1439,1447,1451,1453,1459,1471,1481,1483,1487,1489,1493,1499,1511,1523,1531,1543,1549,1553,1559,1567,1571,1579,1583,1597,1601,1607,1609,1613,1619,1621,1627,1637,1657,1663,1667,1669,1693,1697,1699,1709,1721,1723,1733,1741,1747,1753,1759,1777,1783,1787,1789,1801,1811,1823,1831,1847,1861,1867,1871,1873,1877,1879,1889,1901,1907,1913,1931,1933,1949,1951,1973,1979,1987,1993,1997,1999,2003,2011,2017,2027,2029,2039,2053,2063,2069,2081,2083,2087,2089,2099,2111,2113,2129,2131,2137,2141,2143,2153,2161,2179,2203,2207,2213,2221,2237,2239,2243,2251,2267,2269,2273,2281,2287,2293,2297,2309,2311,2333,2339,2341,2347,2351,2357,2371,2377,2381,2383,2389,2393,2399,2411,2417,2423,2437,2441,2447,2459,2467,2473,2477,2503,2521,2531,2539,2543,2549,2551,2557,2579,2591,2593,2609,2617,2621,2633,2647,2657,2659,2663,2671,2677,2683,2687,2689,2693,2699,2707,2711,2713,2719,2729,2731,2741,2749,2753,2767,2777,2789,2791,2797,2801,2803,2819,2833,2837,2843,2851,2857,2861,2879,2887,2897,2903,2909,2917,2927,2939,2953,2957,2963,2969,2971,2999,3001,3011,3019,3023,3037,3041,3049,3061,3067,3079,3083,3089,3109,3119,3121,3137,3163,3167,3169,3181,3187,3191,3203,3209,3217,3221,3229,3251,3253,3257,3259,3271,3299,3301,3307,3313,3319,3323,3329,3331,3343,3347,3359,3361,3371,3373,3389,3391,3407,3413,3433,3449,3457,3461,3463,3467,3469,3491,3499,3511,3517,3527,3529,3533,3539,3541,3547,3557,3559,3571,3581,3583,3593,3607,3613,3617,3623,3631,3637,3643,3659,3671,3673,3677,3691,3697,3701,3709,3719,3727,3733,3739,3761,3767,3769,3779,3793,3797,3803,3821,3823,3833,3847,3851,3853,3863,3877,3881,3889,3907,3911,3917,3919,3923,3929,3931,3943,3947,3967,3989,4001,4003,4007,4013,4019,4021,4027,4049,4051,4057,4073,4079,4091,4093,4099,4111,4127,4129,4133,4139,4153,4157,4159,4177,4201,4211,4217,4219,4229,4231,4241,4243,4253,4259,4261,4271,4273,4283,4289,4297,4327,4337,4339,4349,4357,4363,4373,4391,4397,4409,4421,4423,4441,4447,4451,4457,4463,4481,4483,4493,4507,4513,4517,4519,4523,4547,4549,4561,4567,4583,4591,4597,4603,4621,4637,4639,4643,4649,4651,4657,4663,4673,4679,4691,4703,4721,4723,4729,4733,4751,4759,4783,4787,4789,4793,4799,4801,4813,4817,4831,4861,4871,4877,4889,4903,4909,4919,4931,4933,4937,4943,4951,4957,4967,4969,4973,4987,4993,4999,5003,5009,5011,5021,5023,5039,5051,5059,5077,5081,5087,5099,5101,5107,5113,5119,5147,5153,5167,5171,5179,5189,5197,5209,5227,5231,5233,5237,5261,5273,5279,5281,5297,5303,5309,5323,5333,5347,5351,5381,5387,5393,5399,5407,5413,5417,5419,5431,5437,5441,5443,5449,5471,5477,5479,5483,5501,5503,5507,5519,5521,5527,5531,5557,5563,5569,5573,5581,5591,5623,5639,5641,5647,5651,5653,5657,5659,5669,5683,5689,5693,5701,5711,5717,5737,5741,5743,5749,5779,5783,5791,5801,5807,5813,5821,5827,5839,5843,5849,5851,5857,5861,5867,5869,5879,5881,5897,5903,5923,5927,5939,5953,5981,5987,6007,6011,6029,6037,6043,6047,6053,6067,6073,6079,6089,6091,6101,6113,6121,6131,6133,6143,6151,6163,6173,6197,6199,6203,6211,6217,6221,6229,6247,6257,6263,6269,6271,6277,6287,6299,6301,6311,6317,6323,6329,6337,6343,6353,6359,6361,6367,6373,6379,6389,6397,6421,6427,6449,6451,6469,6473,6481,6491,6521,6529,6547,6551,6553,6563,6569,6571,6577,6581,6599,6607,6619,6637,6653,6659,6661,6673,6679,6689,6691,6701,6703,6709,6719,6733,6737,6761,6763,6779,6781,6791,6793,6803,6823,6827,6829,6833,6841,6857,6863,6869,6871,6883,6899,6907,6911,6917,6947,6949,6959,6961,6967,6971,6977,6983,6991,6997,7001,7013,7019,7027,7039,7043,7057,7069,7079,7103,7109,7121,7127,7129,7151,7159,7177,7187,7193,7207,7211,7213,7219,7229,7237,7243,7247,7253,7283,7297,7307,7309,7321,7331,7333,7349,7351,7369,7393,7411,7417,7433,7451,7457,7459,7477,7481,7487,7489,7499,7507,7517,7523,7529,7537,7541,7547,7549,7559,7561,7573,7577,7583,7589,7591,7603,7607,7621,7639,7643,7649,7669,7673,7681,7687,7691,7699,7703,7717,7723,7727,7741,7753,7757,7759,7789,7793,7817,7823,7829,7841,7853,7867,7873,7877,7879,7883,7901,7907,7919,7927,7933,7937,7949,7951,7963,7993,8009,8011,8017,8039,8053,8059,8069,8081,8087,8089,8093,8101,8111,8117,8123,8147,8161,8167,8171,8179,8191,8209,8219,8221,8231,8233,8237,8243,8263,8269,8273,8287,8291,8293,8297,8311,8317,8329,8353,8363,8369,8377,8387,8389,8419,8423,8429,8431,8443,8447,8461,8467,8501,8513,8521,8527,8537,8539,8543,8563,8573,8581,8597,8599,8609,8623,8627,8629,8641,8647,8663,8669,8677,8681,8689,8693,8699,8707,8713,8719,8731,8737,8741,8747,8753,8761,8779,8783,8803,8807,8819,8821,8831,8837,8839,8849,8861,8863,8867,8887,8893,8923,8929,8933,8941,8951,8963,8969,8971,8999,9001,9007,9011,9013,9029,9041,9043,9049,9059,9067,9091,9103,9109,9127,9133,9137,9151,9157,9161,9173,9181,9187,9199,9203,9209,9221,9227,9239,9241,9257,9277,9281,9283,9293,9311,9319,9323,9337,9341,9343,9349,9371,9377,9391,9397,9403,9413,9419,9421,9431,9433,9437,9439,9461,9463,9467,9473,9479,9491,9497,9511,9521,9533,9539,9547,9551,9587,9601,9613,9619,9623,9629,9631,9643,9649,9661,9677,9679,9689,9697,9719,9721,9733,9739,9743,9749,9767,9769,9781,9787,9791,9803,9811,9817,9829,9833,9839,9851,9857,9859,9871,9883,9887,9901,9907,9923,9929,9931,9941,9949,9967,9973]:
if j%v==0:
break
v=j//v
for c in a:
if c>v:
break
else:
if j%c==0:
k=True
break
return k
n=int(eval(input()))
a=sorted(list(map(int,input().split())))
ac=Counter(a)
ans=0
for i,j in enumerate(a):
if ac[j]>=2:
continue
if solve(i,j,a):
continue
else:
ans+=1
print(ans) | 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):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print((yes if b else no))
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
n=n0()
A=n1()
A.sort()
A=deque(A)
d=defaultdict(int)
for j in A:
d[j]+=1
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
#divisors.sort()
return divisors
ans=0
while len(A)>0:
a=A.popleft()
l=make_divisors(a)
for i in l:
if i==a:
if d[i]>1:
break
elif d[i]>0:
break
else:
ans+=1
print(ans) |
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):return [int(eval(input())) for _ in range(n)]
def n3(n):return [[int(x) for x in input().split()] for _ in range(n)]
def t3(n):return [tuple(int(x) for x in input().split()) for _ in range(n)]
def p0(b,yes="Yes",no="No"): print((yes if b else no))
# from sys import setrecursionlimit
# setrecursionlimit(1000000)
from collections import Counter,deque,defaultdict
# import itertools
# import math
# import networkx as nx
# from bisect import bisect_left,bisect_right
# from heapq import heapify,heappush,heappop
n=n0()
A=n1()
A.sort()
m=A[-1]
d=defaultdict(int)
d2=defaultdict(int)
for i in A:
d2[i]+=1
ans=0
for a in A:
if d[a]==0:
if d2[a]<=1:
ans+=1
i=a
while i<=m:
d[i]=1
i+=a
print(ans) | 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:
if len(A)>0:
if A[0]!=a:
res+=1
else:
res+=1
m=2
while (a*m)<=Amax:
dp[a*m-1]=1
m+=1
tmp=a
print(res)
if __name__=="__main__":
main() | 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-1]==0:
if len(A)>0:
if A[len(A)-1]!=a:
res+=1
else:
res+=1
m=2
while (a*m)<=Amax:
dp[a*m-1]=1
m+=1
tmp=a
print(res)
if __name__=="__main__":
main() | 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_prime[a]:
ans += 1
print(ans) | 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] == 1:
ans += 1
print(ans)
| # エラトステネスの篩を使う！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 += 1
print(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]:
check=False
if check:
ans+=1
print(ans)
| 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] == 1 for i in A)
print(sum_num)
| 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]:
continue
b = True
for x in div:
if a[i] < x * 2:
break
if a[i] % x == 0:
b = False
if b:
ans += 1
div += [a[i]]
print(ans) | 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 < n-1 and a[i] == a[i+1]:
continue
if b[a[i]]:
ans += 1
print(ans) | 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] == a[i+1]:
dic[a[i]] = 1
continue
flag = 1
for check in range(1,int(x**0.5)+1):
if(x%check==0):
if dic[check]:
flag = 0
break
if dic[x//check]:
flag = 0
break
if flag:
ans += 1
dic[a[i]] = 1
print(ans)
if __name__ == "__main__":
main() | 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]:
tab[a[i]] = 0
if tab[x]:
ans += 1
for i in range(N):
if x*i >= N:
break
tab[x*i] = 0
print(ans)
if __name__ == "__main__":
main() | 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 += (is_ans[a] == 0)
print(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])
ans += (is_ans[a] == 1)
print(ans)
| 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
while i*j<=10**6:
count_list[i*j-1]+=1
j+=1
print(count) | 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:
j=2
while i*j<=a_max:
count_list[i*j-1]+=1
j+=1
print(count) | 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():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
# 愚直に行うとO(N^2)となる
# 各要素、約数を列挙(sqrt(N))
# 約数がこれまでに存在したかをチェックO(1)*約数の個数
# 存在すれば1を加える
# print(A)
ans = 0
history = [False]*N
for i in range(N):
if history[i]:
continue
# A[i]を乗じていくとどうか
for j in range(i+1, N):
if A[j] % A[i] == 0:
history[j] = True
if i+1 < N and A[i] == A[i+1]:
history[i] = True
print((N-sum(history)))
return
if __name__ == '__main__':
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():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
# 愚直に行うとO(N^2)となる
# 各要素、約数を列挙(sqrt(N))
# 約数がこれまでに存在したかをチェックO(1)*約数の個数
# 存在すれば1を加える
# print(A)
ans = 0
history = [False]*N
for i in range(N):
if history[i]:
continue
# A[i]を乗じていくとどうか
k = i
for j in range(2, A[-1]//A[i] + 1):
k = bisect_left(A, A[i]*j, lo=k)
# print(A[i], A[i]*j, k, A[k])
if A[k] % A[i] == 0:
history[k] = True
#
k = bisect_left(A, A[i])
if k < i:
history[i] = True
if i+1 < N and A[i] == A[i+1]:
history[i] = True
print((N-sum(history)))
return
if __name__ == '__main__':
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():
N = int(eval(input()))
A = list(map(int, input().split()))
A.sort()
# 愚直に行うとO(N^2)となる
# 各要素、約数を列挙(sqrt(N))
# 約数がこれまでに存在したかをチェックO(1)*約数の個数
# 存在すれば1を加える
# print(A)
ans = 0
history = [False]*N
for i in range(N):
if history[i]:
continue
# A[i]を乗じていくとどうか
k = i
for j in range(2, A[-1]//A[i] + 1):
k = bisect_left(A, A[i]*j, lo=k)
# print(A[i], A[i]*j, k, A[k])
if A[k] % A[i] == 0:
history[k] = True
#
k = bisect_left(A, A[i])
if k < i:
history[i] = True
if i+1 < N and A[i] == A[i+1]:
history[i] = True
print((N-sum(history)))
return
if __name__ == '__main__':
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[-1]+1)
ans = 0
for i in range(N):
# すでに何かの倍数ならば、考える必要なし
if table[A[i]]:
continue
# 最大値まで見ていく
for j in range(2, A[-1]//A[i]+1):
table[A[i]*j] = True
ans = 0
for i in range(N):
if table[A[i]] is False:
ans += 1
if i == 0:
if len(A) == 1:
break
if A[0] == A[1]:
ans -= 1
elif i == N-1:
if A[N-1] == A[N-2]:
ans -= 1
else:
if A[i] == A[i-1] or A[i] == A[i+1]:
ans -= 1
print(ans)
return
if __name__ == '__main__':
main()
| 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[j] = 1
return prime_list
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
ans = 0
m = max(A)
zeta = [0]*(m+1)
for a in A:
zeta[a] += 1
# 素数の列挙
primes = eratosthenes_sieve(m)
# ゼータ変換
for p in primes:
for i in range(1, m//p+1):
zeta[p*i] += zeta[i]
for a in A:
if zeta[a] == 1:
ans += 1
print(ans)
# print(zeta)
# for a in A:
# print(a, zeta[a])
return
if __name__ == '__main__':
main()
| #!/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("inf")
MOD = 10**9 + 7
def main():
N = INT()
A = LIST()
A.sort()
M = A[-1] + 1
table = [0] * (M)
for i in A:
if table[i] == 0:
table[i] = -1
for j in range(i + i, M, i):
table[j] = 1
elif table[i] == -1:
# 重複しているということ
table[i] = -2
# print(table)
cnt = 0
for i in range(N):
if table[A[i]] == -1:
cnt += 1
print(cnt)
return
if __name__ == '__main__':
main()
| 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)
ans += 1
else:
for i in range(len(i_s))[::-1]:
a.pop(i_s[i])
a.pop(0)
if len(a) == 1:
ans += 1
print(ans) | 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(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
A = inputList()
A.sort()
refd = [0 for i in range(1000000 + 1)]
for i,val in enumerate(A):
for j in range(val,1000000 + 1,val):
refd[j] += 1
ans = 0
for i,val in enumerate(A):
if refd[val] < 2:
ans += 1
print(ans)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| # -*- 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(): return list(map(int, input().split()))
def inputList(): return list(map(int, input().split()))
def inputStr(): return input()[:-1]
inf = float('inf')
mod = 1000000007
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
def main():
N = inputInt()
A = inputList()
A.sort()
zyuufuku = {}
for i,val in enumerate(A):
if i == 0:
continue
if val == A[i-1]:
if val in zyuufuku:
pass
else:
zyuufuku[val] = 1
refd = [0 for i in range(1000000 + 1)]
for i,val in enumerate(A):
if val in zyuufuku:
if zyuufuku[val] > 2:
continue
else:
zyuufuku[val] += 1
for j in range(val,1000000 + 1,val):
refd[j] += 1
ans = 0
for i,val in enumerate(A):
if val in zyuufuku:
continue
if refd[val] < 2:
ans += 1
print(ans)
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
#-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-+-
if __name__ == "__main__":
main()
| 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:
total += 1
else:
flag = 0
print(total) | 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:
cnt+=1
print(cnt) | 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 s[ai]==1:
cnt+=1
print(cnt) | 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
if cnt[x] > 0:
y = x * 2
while y <= amax:
dp[y] = False
y += x
ansval = [x for x in A if dp[x]]
# print(ansval)
ans = len(ansval)
return ans
def solve1(N, A):
ans = 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:
ans += 1
return ans
print((solve2(N, A)))
| 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 = 0
for i in set(a):
if l[i] == 1:
ans += 1
print(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
for a in values:
if dp[a] == 1:
count+=1
print(count)
| 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
i += 1
count = 0
for a in values:
if dp[a] == 1:
count+=1
print(count)
| 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)
cnt = [0]*(max(A)+1)
for a in A:
tmp = set(divisor(a)) & set_A
if len(tmp) == 1: cnt[a] += 1
ans = collections.Counter(cnt)
print((ans[1])) | 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()))
A = list(map(int, input().split()))
## SUBMITION CODES HERE
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)
main() | 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
if not done[num]:
sieve(num, done)
ans += 1
print(ans)
| 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]:
continue
sieve(num, done)
continue
if not done[num]:
sieve(num, done)
ans += 1
print(ans)
| 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 list(map(str, input().split()))
def LMAPSTR(): return list(map(str, input().split()))
def main():
n = INT()
a = LMAPINT()
ans = [0] * (max(a) + 1)
for x in a:
if ans[x] == 0:
for j in range(x, max(a)+1, x):
ans[j] += 1
else:
ans[x] += 1
print((len(list([x for x in a if ans[x] == 1]))))
if __name__ == '__main__':
main() | 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 __name__ == '__main__':
main() | 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]:
continue
if i < n-1:
if a[i] == a[i+1]:
continue
ans += 1
print(ans)
| 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(A, a)-bisect_left(A, a) > 1:
ans -= 1
i += 1
print((ans+len(A_)))
| 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
break
if not isDividable:
B.append(a)
print((len(B) - len(sames)))
if __name__ == '__main__':
main()
| # 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] * a_max
# A = set(A)
for a in A:
if dp[a] != 0:
dp[a] = 2
continue
i = a
while i < a_max + 1:
dp[i] += 1
i += a
r = 0
for a in A:
if dp[a] == 1:
r += 1
print(r)
# if dp[a - 1]:
# tmp_a = a * 2
# while tmp_a < a_max + 1:
# dp[tmp_a - 1] = False
# tmp_a += a
# r = 0
# for a in A:
# if dp[a - 1]:
# r += 1
# print(r - sames)
if __name__ == '__main__':
main()
| 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()):
if v > 1:
f[k] = False
for i in range(k + k, 10 ** 6 + 1, k):
f[i] = False
print((sum(1 for x in a if f[x])))
main() | 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()):
if v > 1:
f[k] = False
for i in range(k + k, q, k):
f[i] = False
print((sum(1 for x in a if f[x])))
main() | 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:
print((1))
return
for i in range(lenb):
if Boo[i] and B[i]<500004:
temp = Boo[i]*2 -1
for j in range(i+1,lenb):
if Boo[j] and s[B[j]-1]==False and B[j]>temp and B[j] % B[i] == 0:
Boo[j] = False
cnt = 0
for i in range(lenb):
if Boo[i] and C[B[i]]==1:
cnt += 1
print(cnt)
def sieve(n):
is_prime = [True for _ in range(n+1)]
is_prime[0] = False
for i in range(2, n+1):
if is_prime[i-1]:
j = 2 * i
while j <= n:
is_prime[j-1] = False
j += i
table = [ i for i in range(1, n+1) if is_prime[i-1]]
return is_prime, table
if __name__ == '__main__':
main() | 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:
print((1))
return
for i in range(lenb):
temp = 2
if ZENBU[B[i]]==False:
while B[i]*temp < 1000002:
ZENBU[B[i]*temp] = True
temp+=1
cnt = 0
for i in range(lenb):
if ZENBU[B[i]]==False and C[B[i]]==1:
cnt += 1
print(cnt)
if __name__ == '__main__':
main() | 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 no_div[A[-1]]:
ndiv_sum += 1
print(ndiv_sum)
| 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[i] == 1]))) | # 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
print(ans) | 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, Nsq, 2):
if i in primes:
primes -= set(range(i * i, N + 1, i * 2))
return primes
N = int(eval(input()))
A = list(map(int, input().split()))
prime = prime_set(10 ** 6 + 1)
C = Counter(A)
if C[1] == 1:
print((1))
exit()
if C[1] >= 2:
print((0))
exit()
ans = 0
for a, v in list(C.items()):
if v >= 2:
ans += v
continue
if a in prime:
continue
for i in range(2, int(a ** 0.5) + 1):
if a % i == 0:
if C[i] > 0:
ans += 1
break
if C[a // i] > 0:
ans += 1
break
print((N-ans)) | 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)
curr += num
print(count)
| 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] != arr[i-1]:
for j in range(arr[i], 1000001, arr[i]):
ap[j] = 1
print(count)
| 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 | upper_divisors
n = int(eval(input()))
*A, = list(map(int, input().split()))
A.sort()
setA = set(A)
cnt = 0
for i, a in enumerate(A):
if bisect.bisect_right(A, a) - bisect.bisect_left(A, a) != 1:
cnt += 1
continue
X = make_divisors(a)
for x in X:
if x != a and x in setA:
cnt += 1
break
print((n - cnt))
| 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:
D[a * tmp] = 1
tmp += 1
ans = 0
for a in A:
if C[a] == 1 and D[a] == 0:
ans += 1
print(ans)
| 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:
D[a * tmp] = 1
tmp += 1
ans = 0
for a in A:
if C[a] == 1 and D[a] == 0:
ans += 1
print(ans)
| 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
tmp += 1
ans = 0
for a in A:
if C[a] == 1 and D[a] == 0:
ans += 1
print(ans)
| 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+1):
num[a*k]=False
ans=0
for i in range(1,max(A)+1):
if num[i] and not check[i]:
ans+=1
print(ans)
| 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):
if X[A[i]]==1:
ans+=1
print(ans) | 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] += 1
#print('div =', div)
ans = 0
for i in range(n):
if div[a[i]] == 1:
ans += 1
print(ans)
| #!/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 = format(i,'b').zfill(LEN)
an = 1
for j in range(LEN):
if b[j] == '1':
an *= values[j]
answer += an
answer %= MOD
print(answer)
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = next(tokens) # type: str
solve(N, S)
if __name__ == '__main__':
main()
| #!/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(1,LEN):
answer *= values[i]+1
answer%=MOD
print((answer-1))
return
def main():
def iterate_tokens():
for line in sys.stdin:
for word in line.split():
yield word
tokens = iterate_tokens()
N = int(next(tokens)) # type: int
S = next(tokens) # type: str
solve(N, S)
if __name__ == '__main__':
main()
| 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(product([0, 1], repeat=len(d)))
for x in ls:
num = 1
for z, y in zip(d, x):
if y == 1:
num = (z*num)%mod
ans = (ans + num*(2**b))%mod
print((ans-1)) | 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], repeat=len(d)))
for x in ls:
num = 1
for z, y in zip(d, x):
if y == 1:
num = (z*num)%mod
ans = (ans + num*(2**b))%mod
print((ans-1)) | 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], repeat=len(d)))
for x in ls:
num = 1
for z, y in zip(d, x):
if y == 1:
num = (z*num)%mod
ans = (ans + num*(2**b))%mod
print((ans-1)) | 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
t2 = s2[i+1:]
# print(t1, t2, ans)
func(t1, t2)
N = int(eval(input()))
S = input().strip()
func("", S)
print(ans)
| 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(stringCounterBox)
# 文字そのものを並べる文字列長さは 1から3まで
# print("maxStringLength:{}".format(maxStrLength))
countList = list(stringCounterBox.values())
# [2,2,1] と 各文字数だけ取り出した配列になった
# print("countList:{}".format(countList))
'''
戦略
1個の時→1個の配列を取り出した物を足す→2 + 2 + 1 = 5
2個の時→取り出す文字は文字毎に数字だけパターンが替わる→ 2*2 + 2*1 + 2* 1 = 8
3個の時 同上→ 2*2*1 = 4
これ以上の取り出しはもう出来ない:同じ文字が出てくるため
5 + 8 + 4 = 17 と答えと一致した
TODO 取り出す配列番号を調べる方法が不明
この場合なら2個の時0番目と1番目,0番目と2番目,1番目と2番目を洗い出すのはどうするのか？
偉い人の回答待ち
'''
counter = 1
for i in range(0,len(countList),+1):
# counter = (counter * (countList[i]+1)) % (10^9+7)
counter = (counter*(countList[i]+1)) % (pow(10,9)+7)
answer = counter-1
return answer
if __name__ == '__main__':
_ = int(input().strip())
S = str(input().strip())
solution = solveProblem(S)
print(("{}".format(solution)))
| # _*_ 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),(b,2),(c,1)]
maxStrLength = len(stringCounterBox)
# 文字そのものを並べる文字列長さは 1から3まで
countList = list(stringCounterBox.values())
# [2,2,1] と 各文字数だけ取り出した配列になった
'''
戦略
リストに入った数値に1足した物を掛けて行く。最後に1を引いたのが答え。
根拠
このabcの時を例に出すとa,b,cの3字について
a→0回～2回出す
b→aと同じ
c→0回～1回出す
ケースの組み合わせを考えると 3 * 3 * 2 = 18通りある
しかし 全ての文字0回という選択をすると文字列そのものが無くなってしまう。
この場合は対象外となるので1減らす。
'''
counter = 1
for i in range(0,len(countList),+1):
# counter = (counter * (countList[i]+1)) % (10^9+7)
counter = (counter*(countList[i]+1)) % (pow(10,9)+7)
answer = counter-1
return answer
if __name__ == '__main__':
_ = int(input().strip())
S = str(input().strip())
solution = solveProblem(S)
print(("{}".format(solution)))
| 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
ans = 0
CC = Counter()
for c in S:
CC[c] += 1
m = Mod(10**9+7)
cs = tuple(CC.values())
def f(v):
if not v:
return 1
c = v[0]
v = v[1:]
return m.add(m.mul(c, f(v)), f(v))
return f(cs) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| # -*- 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
ans = 0
CC = Counter()
for c in S:
CC[c] += 1
m = Mod(10**9+7)
cs = tuple(CC.values())
@lru_cache(maxsize=None)
def f(v):
if not v:
return 1
c = v[0]
v = v[1:]
return m.add(m.mul(c, f(v)), f(v))
return f(cs) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
ans = 0
CC = Counter()
for c in S:
CC[c] += 1
m = Mod(10**9+7)
cs = tuple(CC.values())
@lru_cache(maxsize=None)
def f(v):
if not v:
return 1
c = v[0]
v = v[1:]
return m.add(m.mul(c, f(v)), f(v))
return f(cs) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| # -*- 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
CC = Counter()
for c in S:
CC[c] += 1
for c in CC:
CC[c] += 1
m = Mod(10**9+7)
return reduce(m.mul, CC.values()) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
CC = Counter()
for c in S:
CC[c] += 1
for c in CC:
CC[c] += 1
m = Mod(10**9+7)
return reduce(m.mul, CC.values()) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| # -*- 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, product, permutations
from operator import add, mul, sub
sys.setrecursionlimit(100000)
def read_int():
return int(input())
def read_int_n():
return list(map(int, input().split()))
def read_float():
return float(input())
def read_float_n():
return list(map(float, input().split()))
def read_str():
return input().strip()
def read_str_n():
return list(map(str, input().split()))
def error_print(*args):
print(*args, file=sys.stderr)
def mt(f):
import time
def wrap(*args, **kwargs):
s = time.time()
ret = f(*args, **kwargs)
e = time.time()
error_print(e - s, 'sec')
return ret
return wrap
class Mod:
def __init__(self, m):
self.m = m
def add(self, a, b):
return (a + b ) % self.m
def sub(self, a, b):
return (a - b) % self.m
def mul(self, a, b):
return ((a % self.m) * (b % self.m)) % self.m
def div(self, a, b):
return self.mul(a, self.pow(b, self.m-2))
def pow(self, x, y):
if y == 0:
return 1
elif y == 1:
return x % self.m
elif y % 2 == 0:
return self.pow(x, y//2)**2 % self.m
else:
return self.pow(x, y//2)**2 * x % self.m
@mt
def slv(N, S):
CC = defaultdict(lambda: 1)
for c in S:
CC[c] += 1
m = Mod(10**9+7)
return reduce(m.mul, CC.values()) - 1
def main():
N = read_int()
S = read_str()
print(slv(N, S))
if __name__ == '__main__':
main()
| 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[:i]:
count[alpha.find(S[i])] = S[:i].count(S[i]) + 1
res += res // count[alpha.find(S[i])]
else:
res *= 2
res -= 1
big = 10**9 + 7
print((res % big))
| 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.find(S[i])
count[st] += 1
if count[st] > 1:
res += res // count[st]
else:
res *= 2
res -= 1
big = 10**9 + 7
print((res % big))
| 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.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import Counter
n = ni()
s = ns()
MOD = 10**9+7
cnt = Counter(s)
ans = 1
for key, val in list(cnt.items()):
ans *= (val+1)
ans %= MOD
ans -= 1
if ans < 0:
ans += MOD
print(ans) | 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.readline().rstrip()
def lc(): return list(ns())
def ni(): return int(stdin.readline())
def nf(): return float(stdin.readline())
from collections import Counter
n = ni()
s = ns()
cnt = Counter(s)
ans = 1
mod = 10**9+7
for k,v in list(cnt.items()):
ans *= (v+1)
ans %= mod
ans -= 1
if ans < 0:
ans += mod
print(ans) | 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
for j in x:
prod = (prod*D[j][1])%p
cnt = (cnt+prod)%p
print(cnt) | 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 = []
for a in "abcdefghijklmnopqrstuvwxyz":
q.append( s.count(a) )
for a in range(1,min(26+1,n+1)):
#print a
for x in itertools.combinations(q,a):
ans += reduce(mul,x)
ans %= mod
print(ans % mod)
| 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__':
slove()
| 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 - 1))
if __name__ == '__main__':
solve()
| 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)):
res = 1
for i, c in enumerate(comb):
if c == 1:
res = (res * values[i]) % P
ans = (ans + res) % P
print(ans)
if __name__ == "__main__":
main()
| 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 __name__ == "__main__":
main()
| 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])
dp.append(min(q))
print((dp[n])) | 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(eval(input()))
limit = []
answer = float("inf")
for yen in [6, 9]:
i = 1
while yen ** i <= N:
i += 1
limit.append(i - 1)
for i in range(N + 1):
answer = min(answer, how_many_times_withdraw(i, 6, limit[0]) + how_many_times_withdraw(N - i, 9, limit[1]))
print(answer)
if __name__ == '__main__':
main() | 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()))
answer = float("inf")
way_6 = make_list(6, n)
way_9 = make_list(9, n)
for i in range(n + 1):
answer = min(answer, find_withdraw_times(i, way_6) + find_withdraw_times(n - i, way_9))
print(answer)
if __name__ == '__main__':
main()
| 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)
money = [1]
for i in range(20):
if 100000 >= 6**i:
money.append(6**i)
if 100000 >= 9**i:
money.append(9**i)
dp = [[10**18] * (N + 1) for _ in range(len(money) + 1)]
dp[0][0] = 0
for i in range(1, len(money) + 1):
m = money[i - 1]
for j in range(N + 1):
if j - m >= 0:
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - m] + 1, dp[i][j - m] + 1)
else:
dp[i][j] = dp[i - 1][j]
print((dp[len(money)][N])) | 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)
money = [1]
for i in range(20):
if 100000 >= 6**i:
money.append(6**i)
if 100000 >= 9**i:
money.append(9**i)
money = sorted(money)[::-1]
dp = [[10**18] * (N + 1) for _ in range(len(money) + 1)]
dp[0][0] = 0
for i in range(1, len(money) + 1):
m = money[i - 1]
for j in range(N + 1):
if j - m >= 0:
dp[i][j] = min(dp[i - 1][j], dp[i - 1][j - m] + 1, dp[i][j - m] + 1)
else:
dp[i][j] = dp[i - 1][j]
print((dp[len(money)][N])) | 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((dp[n])) | 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**power] + 1
power += 1
print((int(dp[n]))) | 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.bisect_left(l6, a)
if a == l6[idx]:
a -= l6[idx]
else:
a -= l6[idx-1]
p += 1
q = 0
while b > 0:
idx = bisect.bisect_left(l9, b)
if b == l9[idx]:
b -= l9[idx]
else:
b -= l9[idx-1]
q += 1
ans = min(ans, p+q)
print(ans) | 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, a)
cnt += a // sixs[idx-1]
a -= (a // sixs[idx-1]) * sixs[idx-1]
while b > 0:
idx = bisect.bisect_right(nines, b)
cnt += b // nines[idx-1]
b -= (b // nines[idx-1]) * nines[idx-1]
ans = min(ans, cnt)
print(ans) | 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, a)
cnt += a // sixs[idx-1]
a -= (a // sixs[idx-1]) * sixs[idx-1]
while b > 0:
idx = bisect.bisect_right(nines, b)
cnt += b // nines[idx-1]
b -= (b // nines[idx-1]) * nines[idx-1]
ans = min(ans, cnt)
print(ans) | 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で構成する。これらを全通り試す
"""
ans = N
for i in range(N+1):
cnt = 0
sum_six = i
sum_nine = N-i
while sum_six > 0:
idx = bisect_right(sixs, sum_six) - 1
tmp = sum_six // sixs[idx]
cnt += tmp
sum_six -= tmp * sixs[idx]
while sum_nine > 0:
idx = bisect_right(nines, sum_nine) - 1
tmp = sum_nine // nines[idx]
cnt += tmp
sum_nine -= tmp * nines[idx]
ans = min(ans, cnt)
print(ans)
if __name__ == "__main__":
main() | 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
if i - cnt >= 0:
dp[i] = min(dp[i], dp[i - cnt] + 1)
print((dp[n])) | 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]
else:
res = 10**6
for d in divs:
res = min(res,f(x-d)+1)
dp[x] = res
return res
print((f(N)))
main() | 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):
for a in amounts:
if i+a <= N:
dp[i+a] = min(dp[i+a],dp[i]+1)
print((dp[N]))
main() | 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回で引き出せる金額を足したものとの比較で算出
dp[j + WithdrOrder] = min(dp[j + WithdrOrder], dp[j] + 1)
print((dp[n])) | 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の累乗の要素がどれだけあるかがわかる。
最終的に商がゼロになるまで繰り返す
'''
while t>0:
element_cnt+=t%6
t//=6
j=N-i
while j>0:
element_cnt+=j%9
j//=9
ans = min(ans,element_cnt)
print(ans) | 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 - w < 0: continue
if newline[i]: continue
if dp[len(dp)-1][i-w]: newline[i] = True
if newline[n]: return len(dp)
dp.append(newline)
print((solve())) | 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 range(w, n+1):
if newdp[i]: continue
if dp[i-w]: newdp[i] = True
if newdp[n]:
return loop_counter
dp = [x for x in newdp]
print((solve())) | 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:
if j > n:
break
if i - j >= 0:
dp[i] = min(dp[i], dp[i - j] + 1)
print((dp[-1]))
if __name__ == "__main__":
main() | # 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:
if i - j >= 0:
dp[i] = min(dp[i], dp[i - j] + 1)
print((dp[-1]))
if __name__ == "__main__":
main() | 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:
if i >= v:
tmp.append(dp[i - v] + 1)
dp[i] = min(tmp)
print((dp[N]))
if __name__ == '__main__':
main()
| 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
print((dp[N]))
| 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
ans[i] = min(cand1,cand2,cand3) + 1
print((ans[n]))
| # -*- 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)
cand2 = ans[i-x]
x=6*x
y = 9
while (y<=i):
#cand3 = min(ans[i-y], cand3)
cand3 = ans[i-y]
y=9*y
ans[i] = min(cand1,cand2,cand3) + 1
print((ans[n]))
| 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)
#[1, 6, 36, 1, 9, 81]
#print(dp)
for k in range(target+1):
for t in sorted(list(set(tmp))):
if k-t>=0:
dp[k] = min(dp[k],1 + dp[k-t])
#dp[k] = min([dp[k-t] for t in tmp])
'''
try:
dp[k] = min(dp[k],1 + min([dp[k-t] for t in tmp]))
except:
print(len(dp),dp[k-t],dp[k])
pass
'''
#print(k)
#print([t for t in tmp])
#print([dp[k-t] for t in tmp])
motome(n)
#print(dp[n-1])
print((dp[n]))
#print(dp)
#print(dp[n+2])
#print(dp[n-1])
#print(dp[n]) | 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)
print((dp[n])) | 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
for j in g:
if dp[v+j] != -1: continue
if v+j > N: continue
dp[v+j] = dp[v] + 1
q.append(v+j)
print((dp[N]))
| 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, -1):
if n // 6**j > 0:
tmp += n // 6**j
n %= 6**j
# print(ans, j)
# print(ans, j, N)
ans = min(ans, tmp)
print(ans) | # 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[N]))
| 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):
while 6**(y+1)<=i:
y+=1
for j in range(y,-1,-1):
z=(math.floor(i/(6**j))%6)
i-=(6**j)*z
cnt+=z
ansb.append(cnt)
cnt=0
for i in range(n+1):
ans.append(ansa[i]+ansb[n-i])
print((min(ans)))
| 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 range(6):
if i>=li9[j]:
k=i-li9[j]
break
dp9[i]=1+dp9[k]
for i in range(n+1):
ans.append(dp6[i]+dp9[n-i])
print((min(ans)))
| 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 j in range(162,324):
num[j] = min(num[j],2+num[j-162])
for j in range(243,324):
num[j] = min(num[j],3+num[j-243])
for j in range(324,100001):
num[j] = (j//324)*4 + num[j%234]
for j in range(216,648):
num[j] = min(num[j],1+num[j-216])
for j in range(432,648):
num[j] = min(num[j],2+num[j-216*2])
for j in range(648,100001):
num[j] = (j//648)*3 + num[j%648]
for i in range(1,8):
for j in range(729*i,729*8):
num[j] = min(num[j],i+num[j-729*i])
for j in range(729*8,100001):
num[j] = (j//(729*8))*8+num[j%(729*8)]
MoneyYouCanGet = [6**4,9**4,6**5,6**6,9**5]
for i in MoneyYouCanGet:
for j in range(1,100001):
k = 1
while k*i<j:
num[j] = min(num[j],k+num[j-k*i])
k += 1
N = int(eval(input()))
print((num[N])) | 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) + NineNum[j%(9**i)])
N = int(eval(input()))
ans = 100001
for i in range(0,N+1):
ans = min(ans,SixNum[i]+NineNum[N-i])
print(ans) | 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) + NineNum[j%(9**i)])
N = int(eval(input()))
ans = 100001
for i in range(0,N+1):
ans = min(ans,SixNum[i]+NineNum[N-i])
print(ans) | 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])
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:
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 - 9 ** j], m[i])
j += 1
print((m[-1]))
if __name__ == '__main__':
main()
| 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 enumerate(c) if l < j]
m[i] = min(k)
print((m[-1]))
if __name__ == '__main__':
main()
| 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)
pow9 *= 9
print((dp[n]))
| # 貰う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
print((dp[n]))
| 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 defaultdict, deque, Counter
from sys import exit
import heapq
import math
import fractions
import copy
from itertools import permutations
from operator import mul
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
N = getN()
num = [1]
sixsta = 6
while sixsta < 100000:
num.append(sixsta)
sixsta *= 6
ninesta = 9
while ninesta < 100000:
num.append(ninesta)
ninesta *= 9
num.sort()
dp = [float('inf')] * 100001
dp[0] = 0
for i in range(N + 1):
for k in range(len(num)):
if i >= num[k]:
dp[i] = min(dp[i], dp[i - num[k]] + 1)
print((dp[N]))
| 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):
return random.randint(ran1, ran2)
def rand_List(ran1, ran2, rantime):
return [random.randint(ran1, ran2) for i in range(rantime)]
def rand_ints_nodup(ran1, ran2, rantime):
ns = []
while len(ns) < rantime:
n = random.randint(ran1, ran2)
if not n in ns:
ns.append(n)
return sorted(ns)
def rand_query(ran1, ran2, rantime):
r_query = []
while len(r_query) < rantime:
n_q = rand_ints_nodup(ran1, ran2, 2)
if not n_q in r_query:
r_query.append(n_q)
return sorted(r_query)
from collections import defaultdict, deque, Counter
from sys import exit
from decimal import *
from heapq import heapify, heappop, heappush
import math
import random
import string
from copy import deepcopy
from itertools import combinations, permutations, product
from operator import mul, itemgetter
from functools import reduce
from bisect import bisect_left, bisect_right
import sys
sys.setrecursionlimit(1000000000)
mod = 10 ** 9 + 7
#############
# Main Code #
#############
N = getN()
coin = [1]
sixsta = 6
while sixsta < 100000:
coin.append(sixsta)
sixsta *= 6
ninesta = 9
while ninesta < 100000:
coin.append(ninesta)
ninesta *= 9
coin.sort()
# NlogNダイクストラ
# これも最短経路を求める問題
def dijkstra(n, start):
dist = [float('inf')] * n
pos = [(0, start)]
heapify(pos)
dist[start] = 0
while len(pos):
cost, u = heappop(pos)
if dist[u] < cost:
continue
# エッジは探索のたびに生成していく
for i in range(len(coin)):
if u + coin[i] >= n:
continue
if dist[u] + 1 < dist[u + coin[i]]:
dist[u + coin[i]] = dist[u] + 1
heappush(pos, (dist[u] + 1, u + coin[i]))
return dist
print((dijkstra(N + 1, 0)[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 = float('inf')
N = int(eval(input()))
memo = [INF] * (N + 1)
memo[0] = 0
def f(n):
# 0なら終了
if n == 0:
return 0
# メモされてたら終了
if not memo[n] == INF:
return memo[n]
ans = INF
# 9
for i in range(1, n):
if 9 ** i > n:
break
ans = min(ans, f(n - 9**i) + 1)
# 6
for i in range(1, n):
if 6 ** i > n:
break
ans = min(ans, f(n - 6**i) + 1)
# 1
ans = min(ans, f(n - 1) + 1)
# メモ
memo[n] = ans
return ans
def main():
print((f(N)))
if __name__ == '__main__':
main()
| # 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):
# 0なら終了
if n == 0:
return 0
# メモされてたら終了
if not memo[n] == -1:
return memo[n]
ans = INF
# 9
for i in range(1, n):
if 9 ** i > n:
break
ans = min(ans, f(n - 9**i) + 1)
# 6
for i in range(1, n):
if 6 ** i > n:
break
ans = min(ans, f(n - 6**i) + 1)
# 1
ans = min(ans, f(n - 1) + 1)
# メモ
memo[n] = ans
return ans
def main():
print((f(N)))
if __name__ == '__main__':
main()
| 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):
# 0なら終了
if n == 0:
return 0
# メモされてたら終了
if not memo[n] == -1:
return memo[n]
ans = INF
# 9
for i in range(1, n):
if 9 ** i > n:
break
ans = min(ans, f(n - 9**i) + 1)
# 6
for i in range(1, n):
if 6 ** i > n:
break
ans = min(ans, f(n - 6**i) + 1)
# 1
ans = min(ans, f(n - 1) + 1)
# メモ
memo[n] = ans
return ans
def main():
print((f(N)))
if __name__ == '__main__':
main()
| # 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 range(1, N + 1):
for nine in range(1, i + 1):
if 9**nine > i:
break
memo[i] = min(memo[i], memo[i - 9**nine] + 1)
for six in range(1, i + 1):
if 6**six > i:
break
memo[i] = min(memo[i], memo[i - 6**six] + 1)
memo[i] = min(memo[i], memo[i - 1] + 1)
print((memo[N]))
if __name__ == '__main__':
main()
| 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 < 6:
times = N
return times
elif N < 9:
times = 1 + (N - 6)
return times
else:
N1 = search_times_re(N - func(N, 6))
N2 = search_times_re(N - func(N, 9))
if N1 < N2:
return 1 + N1
else:
return 1 + N2
print((search_times_re(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,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import copy
from collections import defaultdict, Counter
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
from bisect import bisect_left, bisect_right
# import numpy as np
def i_inpl(): return int(eval(input()))
def s_inpl(): return list(map(int,input().split()))
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")
N = i_inpl()
dp = [INF for _ in range(N+1)]
dp[0] = 0
for i in range(1, N+1):
# 6
power = 1
while power <= N:
dp[i] = min(dp[i], dp[i-power] + 1)
power *= 6
# 9
power = 1
while power <= N:
dp[i] = min(dp[i], dp[i-power] + 1)
power *= 9
print((dp[N])) | # 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,...,n]
# FFFTFTTFF li = input().split('T') li=['FFF', 'F', '', 'FF']
# INPUT
# 3
# hoge
# foo
# bar
# ANSWER
# n=int(input())
# string_list=[input() for i in range(n)]
import math
import copy
from collections import defaultdict, Counter
# 直積 A={a, b, c}, B={d, e}:のとき，A×B={(a,d),(a,e),(b,d),(b,e),(c,d),(c,e)}: product(A, B)
from itertools import product
# 階乗 P!: permutations(seq), 順列 {}_len(seq) P_n: permutations(seq, n)
from itertools import permutations
# 組み合わせ {}_len(seq) C_n: combinations(seq, n)
from itertools import combinations
from bisect import bisect_left, bisect_right
# import numpy as np
def i_inpl(): return int(eval(input()))
def s_inpl(): return list(map(int,input().split()))
def l_inpl(): return list(map(int, input().split()))
INF = float("inf")
N = i_inpl()
dp = [INF for _ in range(N+1)]
dp[0] = 0
for i in range(1, N+1):
# 6
power = 1
while power <= i:
dp[i] = min(dp[i], dp[i-power] + 1)
power *= 6
# 9
power = 1
while power <= i:
dp[i] = min(dp[i], dp[i-power] + 1)
power *= 9
print((dp[N])) | 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 + 1 - 9**j] + 1)
print((DP[N])) | 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 - 9**j] + 1)
print((DP[N])) | 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, 9)
fn = f(amount - 9 ** (len(n) - 1))
if (fs < fn):
return fs + 1
else:
return fn + 1
print((f(N))) | 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
return amount
s = Base10toN(amount, 6)
fs = f(amount - 6 ** (len(s) - 1))
n = Base10toN(amount, 9)
fn = f(amount - 9 ** (len(n) - 1))
if (fs < fn):
memo[amount] = fs + 1
return fs + 1
else:
memo[amount] = fn + 1
return fn + 1
print((f(N))) | 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__':
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.