input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
def eratosthenes2(n):
D=[-1]*(n+1)
D[0]=0
D[1]=1
for i in range(2, n+1):
if D[i] == -1:
D[i] = i
for j in range(i*i, n+1, i):
if D[j] == -1:
D[j] = i
return D
N=int(eval(input()))
A=list(map(int,input().split()))
maxA... | N=int(eval(input()))
A=list(map(int,input().split()))
maxA=max(A)
count=[0]*(maxA+1)
for x in A:
count[x]+=1
maxc=0
for i in range(2,maxA+1):
maxc = max(maxc,sum(count[i::i]))
if maxc==N:
print('not coprime')
elif maxc<=1:
print('pairwise coprime')
else:
print('setwise coprime') | p02574 |
N = int(eval(input()))
from math import gcd
prime = [0] * 2 + [1] * (10 ** 6 - 1)
A = list(map(int, input().split()))
A.sort()
g = 0
for a in A:
g = gcd(g, a)
for i in range(2, 10 ** 2 + 1):
if prime[i]:
for j in range(2 * i, 10 ** 3 + 1, i):
prime[j] = 0
P = [i for i in range(2, 10 ** 3 + 1) ... | N = int(eval(input()))
from math import gcd
prime = [0] * 2 + [1] * (10 ** 6 - 1)
A = list(map(int, input().split()))
A.sort()
g = 0
for a in A:
g = gcd(g, a)
for i in range(2, 10 ** 2 + 1):
if prime[i]:
for j in range(2 * i, 10 ** 3 + 1, i):
prime[j] = 0
P = [i for i in range(2, 10 ** 3 + 1) ... | p02574 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, permutati... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, permutati... | p02574 |
# -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, permutati... | # -*- coding: utf-8 -*-
import bisect
import heapq
import math
import random
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, permutati... | p02574 |
from math import gcd
from functools import reduce
N, *A = list(map(int, open(0).read().split()))
t = [0] * (10 ** 6 + 1)
for a in A:
t[a] += 1
for i in range(2, 10 ** 6 + 1):
c = 0
for j in range(i, 10 ** 6 + 1, i):
c += t[j]
if c > 1:
break
else:
print('pairwise c... | from math import gcd
from functools import reduce
N, *A = list(map(int, open(0).read().split()))
def f():
t = [0] * (10 ** 6 + 1)
for a in A:
t[a] += 1
c = 0
for j in range(2, 10 ** 6 + 1, 2):
c += t[j]
if c > 1:
return False
for i in range(3, 10 ** 6 ... | p02574 |
n = int(eval(input()))
a = list(map(int, input().split()))
def fact(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
cnt=0
while temp%i==0:
cnt+=1
temp //= i
arr.append([i, cnt])
if temp... | n = int(eval(input()))
a = list(map(int, input().split()))
M=max(a)
biggest_prime = [0] * (M+10)
for i in range(2, M+10):
if biggest_prime[i] == 0:
biggest_prime[i] = i
for j in range(i*i, M+1, i):
biggest_prime[j] = i
from collections import defaultdict
cntd=defaultdict(int)... | p02574 |
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
r = set()
while n % 2 == 0:
r.add(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
r.add(f)
... | N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
r = set()
while n % 2 == 0:
r.add(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
r.add(f)
n //= f
else:
f += 2
if n != 1:
... | p02574 |
# -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
import copy
import math
sys.setrecursionlimit(10**6)
# lis_of_lis = [[] for _ in range(N)]
def zz(): return list(map(int, sys.stdin.readli... | # -*- coding: utf-8 -*-
import sys
from collections import deque
from collections import defaultdict
import heapq
import collections
import itertools
import bisect
import copy
import math
sys.setrecursionlimit(10**6)
# lis_of_lis = [[] for _ in range(N)]
def zz(): return list(map(int, sys.stdin.readli... | p02574 |
import math
from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
a = []
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def prime_factorize(n):
global a
tmp = []
while n % 2 == 0:
if 2 not in a:
tmp.append(2)
n //= 2
else:
r... | import math
from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
a = set()
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def prime_factorize(n):
global a
tmp = []
while n % 2 == 0:
if 2 not in a:
tmp.append(2)
n //= 2
else:
... | p02574 |
from collections import Counter
from math import gcd
class Prime:
def __init__(self, N):
smallestPrime = [1] * (N + 1)
primes = []
for i in range(2, N + 1):
if smallestPrime[i] != 1:
continue
primes.append(i)
for p in range(i ... | from collections import Counter
from math import gcd
class Prime:
def __init__(self, N):
smallestPrime = [1] * (N + 1)
primes = []
for i in range(2, N + 1):
if smallestPrime[i] != 1:
continue
primes.append(i)
for p in range(i ... | p02574 |
#Code by Sounak, IIESTS
#------------------------------warmup----------------------------
import os
import sys
import math
from io import BytesIO, IOBase
from fractions import Fraction
import collections
from itertools import permutations
from collections import defaultdict
BUFSIZE = 8192
class F... | import math
mod=10**9+7
n=int(eval(input()))
a=list(map(int,input().split()))
m=max(a)+1
g=a[0]
d=dict()
for i in a:
g=math.gcd(g,i)
if i in d:
d[i]+=1
else:
d[i]=1
if g>1:
print("not coprime")
else:
p=[0]*(m)
ch=0
for i in range (2,m):
if p[i]==1:
... | p02574 |
import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
def find_p... | import bisect
import collections
import copy
import functools
import heapq
import math
import sys
from collections import deque
from collections import defaultdict
input = sys.stdin.readline
sys.setrecursionlimit(10**9)
MOD = 10**9+7
N = int(eval(input()))
A = list(map(int,input().split()))
one = A.co... | p02574 |
ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
def is_primes(n):
primes = [1]*n
primes[0] =0
primes[1] =0
... | ma = lambda :map(int,input().split())
lma = lambda :list(map(int,input().split()))
tma = lambda :tuple(map(int,input().split()))
ni = lambda:int(input())
yn = lambda fl:print("Yes") if fl else print("No")
import collections
import math
gcd=math.gcd
def is_primes(n):
primes = [1]*n
primes[0] =0
... | p02574 |
def get_sieve_of_eratosthenes(n):
if not isinstance(n, int):
raise TypeError('n is int type.')
if n < 2:
raise ValueError('n is more than 2')
prime = [2]
limit = int(n**0.5)
data = [i + 1 for i in range(2, n, 2)]
while True:
p = data[0]
if limit <= p:
... | from collections import defaultdict
max = 10 ** 6
sieve = [None] * (max + 1)
for i in range(2, max + 1):
if sieve[i] == None: # i is prime
for ki in range(i, max + 1, i):
sieve[ki] = i
def factors(n):
while True:
if sieve[n] is None:
break
yield sieve[n... | p02574 |
def prime(p):
memo = set()
for i in range(2,(int(p**0.5)+1)):
while p%i==0:
p //= i
memo.add(i)
if p != 1:
memo.add(p)
return memo
from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
tmp_gcd = A[0]
for i in range(1... | def prime(p):
memo = set()
for i in range(2,(int(p**0.5)+1)):
while p%i==0:
p //= i
memo.add(i)
if p != 1:
memo.add(p)
return memo
from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
tmp_gcd = A[0]
for i in range(1... | p02574 |
import sys
import re
import queue
import collections
import math
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replac... | import sys
import re
import queue
import collections
import math
from math import ceil, floor, sqrt, pi, factorial, gcd
from copy import deepcopy
from collections import Counter, deque
from heapq import heapify, heappop, heappush
from itertools import accumulate, product, combinations, combinations_with_replac... | p02574 |
from math import gcd
from functools import reduce
NUM_MAX = 10**6 + 1
def solve(n, a):
c = [0] * NUM_MAX
for x in a:
c[x] += 1
t = any(sum(c[i::i]) > 1 for i in range(2, NUM_MAX))
t += reduce(gcd, a) > 1
return ["pairwise", "setwise", "not"][t] + " coprime"
n = int(eval(input()))... | from math import gcd
from functools import reduce
k=10**6+1
def judge(n,a):
c=[0]*k
for x in a:
c[x]+=1
t=any(sum(c[i::i])>1 for i in range(2,k))
t+=reduce(gcd,a)>1
return ['pairwise','setwise','not'][t]+' coprime'
n=int(eval(input()))
a=list(map(int,input().split()))
print((judge(n,a)))
| p02574 |
from math import gcd, sqrt
from functools import reduce
n, *A = list(map(int, open(0).read().split()))
def f(A):
sup = max(A)+1
table = [set() for i in range(sup)]
for i in range(2, sup):
if not table[i]:
for j in range(i, sup, i):
table[j].add(i)
D = set(... | from math import gcd, sqrt
from functools import reduce
n, *A = list(map(int, open(0).read().split()))
def f(A):
sup = max(A)+1
table = [i for i in range(sup)]
for i in range(2, int(sqrt(sup))+1):
if table[i] == i:
for j in range(i**2, sup, i):
table[j] = i
... | p02574 |
from math import gcd
from functools import reduce
N = int(eval(input()))
A = list(map(int, input().split()))
M = 10**6+1
mp = [0]*M
for a in A:
mp[a] += 1
pairwise = 1
for i in range(2,M):
if sum(mp[i::i])>1:
pairwise = 0
break
if pairwise:
print('pairwise coprime')
el... | from math import gcd
from functools import reduce
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
M = 10**6+1
mp = [0]*M
for a in A:
mp[a] += 1
pairwise = 1
for i in range(2,M):
if sum(mp[i::i])>1:
pairwise = 0
b... | p02574 |
import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | import sys
sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python
import math
from copy import copy, deepcopy
from copy import deepcopy as dcp
from operator import itemgetter
from bisect import bisect_left, bisect, bisect_right#2分探索
#bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下
from co... | p02574 |
n=int(eval(input()))
a=list(map(int,input().split()))
import sys
import math
def setwise_coprime(a):
ans=a[0]
for i in range(1,n):
ans=math.gcd(ans,a[i])
return ans
def erast(n):
num_set=set()
prime_set=set()
for i in range(2,n+1):
if i not in num_set:
prime_set.add(i)
... | n=int(eval(input()))
a=list(map(int,input().split()))
import sys
import math
def setwise_coprime(a):
ans=a[0]
for i in range(1,n):
ans=math.gcd(ans,a[i])
return ans
#エラストテネスのふるい
def create_sieve(n):
sieve=[0]*(n+1)
for i in range(2,n+1):
if sieve[i]==0:
for j in range(i*i,n+1,i... | p02574 |
n=int(eval(input()))
a=list(map(int,input().split()))
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
#高速素因数分解
#エラストテネスのふるい
#sieveが0なら素数、0以外ならその値を割り切る素数
def create_sieve(n):
sieve=[0]*(n+1)
for i in range(2,n+1):
if sieve[i]==0:
for j in range(i*i,n+1,i):
s... | n=int(eval(input()))
a=list(map(int,input().split()))
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
#高速素因数分解
#エラストテネスのふるい
#sieveが0なら素数、0以外ならその値を割り切る素数
def create_sieve(n):
sieve=[0]*(n+1)
for i in range(2,n+1):
if sieve[i]==0:
for j in range(i*i,n+1,i):
s... | p02574 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
# https://qiita.com/Kiri8128/items/eca965fe86ea5f4cbb98
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
y = pow(a, t, ... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from functools import reduce
from math import gcd
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
if reduce(gcd, A) != 1:
print("... | p02574 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from math import gcd
from functools import reduce
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
if reduce(gcd, A) != 1:
print("... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from math import gcd
from functools import reduce
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
if reduce(gcd, A) != 1:
print("... | p02574 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from math import gcd
from functools import reduce
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
if reduce(gcd, A) != 1:
print("... | import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from functools import reduce
from math import gcd
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
if reduce(gcd, A) != 1:
print("... | p02574 |
import sys
INF = 1 << 60
MOD = 10**9 + 7 # 998244353
sys.setrecursionlimit(2147483647)
input = lambda:sys.stdin.readline().rstrip()
from math import gcd
from functools import reduce
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
M = max(A)
if reduce(gcd, A) != 1:
... | from functools import reduce
from math import gcd
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
M = max(A)
if reduce(gcd, A) != 1:
print("not coprime")
return
# linear sieve
sieve = list(range(M + 1))
primes = []
for i in range(... | p02574 |
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
A_max = max(A)
if A_max == 1:
print("pairwise coprime")
sys.exit()
dp = [0]*(A_max+10)
p = 0
s = 0
for i in range(2, A_max+1):
c = 0
if dp[i] == 0:
dp[i] = 1
for j in range(i, A_max+1, i):
dp... | import sys
N = int(eval(input()))
A = list(map(int, input().split()))
A_max = max(A)
if A_max == 1:
print("pairwise coprime")
sys.exit()
dp = [0]*(A_max+10)
K = [0]*(A_max+10)
p = 0
s = 0
for i in range(N):
K[A[i]] += 1
for i in range(2, A_max+1):
c = 0
if dp[i] == 0:
dp[i] =... | p02574 |
from math import gcd
import sys
MAXN = 10**6+10
sieve = [i for i in range(MAXN+1)]
p = 2
while p*p <= MAXN:
if sieve[p] == p:
for q in range(2*p,MAXN+1,p):
if sieve[q] == q:
sieve[q] = p
p += 1
def pf(a):
tmp = set()
while a > 1:
tmp.add(... | from math import gcd
import sys
MAXN = 10**6+10
sieve = [i for i in range(MAXN+1)]
p = 2
while p*p <= MAXN:
if sieve[p] == p:
for q in range(2*p,MAXN+1,p):
if sieve[q] == q:
sieve[q] = p
p += 1
def pf(a):
tmp = set()
while a > 1:
tmp.add(... | p02574 |
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return float(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,inp... | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return float(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,inp... | p02574 |
import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return float(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,inp... | import sys
input = sys.stdin.buffer.readline
#sys.setrecursionlimit(10**9)
#from functools import lru_cache
def RD(): return input().rstrip().decode()
def II(): return int(eval(input()))
def FI(): return float(eval(input()))
def MI(): return list(map(int,input().split()))
def MF(): return list(map(float,inp... | p02574 |
#!/usr/bin/env python3
import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
from math import gcd
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf... | #!/usr/bin/env python3
import sys
from typing import Any, Callable, Deque, Dict, List, Mapping, Optional, Sequence, Set, Tuple, TypeVar, Union
# import time
# import math, cmath
from math import gcd
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf... | p02574 |
##https://www.codechef.com/viewsolution/20131475
from math import gcd
N = (10 ** 6) + 100
sv = [i for i in range(N)]
for i in range(2 , N) :
if i * i >= N : break
if sv[i] < i : continue
for j in range(i * i , N , i) :
sv[j] = min(sv[j] , i)
def getPrimes(a) :
pr = []
if a... | ##https://www.codechef.com/viewsolution/20131475
from math import gcd
N = (10 ** 6) + 100
sv = [i for i in range(N)]
for i in range(2 , N) :
if i * i >= N : break
if sv[i] < i : continue
for j in range(i * i , N , i) :
sv[j] = min(sv[j] , i)
def getPrimes(a) :
pr = []
if a... | p02574 |
import sys
from math import gcd
input = lambda: sys.stdin.readline().rstrip()
n = int(eval(input()))
A = list(map(int, input().split()))
nowgcd = A[0]
# 全体のGCDを取る
for i in A:
nowgcd = gcd(nowgcd, i)
if nowgcd != 1:
print('not coprime')
exit()
# osa_k法で前処理
MAXN = 10**6 + 5
sieve = [i for i in... | import sys
from math import gcd
def osa_k(sieve, MAXN):
p = 2
while p * p <= MAXN:
# まだチェックされていないなら
if sieve[p] == p:
# 次のqの倍数からp刻みでチェック入れていく
for q in range(2 * p, MAXN + 1, p):
if sieve[q] == q:
sieve[q] = p
p +=... | p02574 |
N=int(eval(input()))
A=list(map(int,input().split()))
from functools import reduce
from math import gcd
g=reduce(lambda x,y:gcd(x,y),A,0)
if g>1:
print('not coprime')
exit()
def prime(N):
p=set(range(2,N+1))
for i in range(int(N**.5)+1):
if i in p:
p-=set(range(i*2,N+1,i)... | N=int(eval(input()))
A=list(map(int,input().split()))
from functools import reduce
from math import gcd
g=reduce(lambda x,y:gcd(x,y),A,0)
if g>1:
print('not coprime')
exit()
def prime(N):
p=set(range(2,N+1))
for i in range(int(N**.5)+1):
if i in p:
p-=set(range(i*2,N+1,i)... | p02574 |
#!/usr/bin/env python3
import collections
import functools
try:
from math import gcd
except ImportError:
from fractions import gcd
L = 10 ** 6 + 1
def sieve_of_eratosthenes(end):
"""Enumerates prime numbers below the given integer `end`.
Returns (as a tuple):
- `is_prime... | #!/usr/bin/env python3
import collections
import functools
try:
from math import gcd
except ImportError:
from fractions import gcd
L = 10 ** 6 + 1
def sieve_of_eratosthenes(end):
"""Enumerates prime numbers below the given integer `end`.
Returns (as a tuple):
- `is_prime... | p02574 |
#!/usr/bin/env python3
import collections
import functools
from math import gcd
L = 10 ** 6 + 1
def sieve_of_eratosthenes(end):
"""Enumerates prime numbers below the given integer `end`.
Returns (as a tuple):
- `is_prime`: a list of bool values.
If an integer `i` is a prime nu... | #!/usr/bin/env python3
import collections
import functools
from math import gcd
L = 10 ** 6 + 1
def sieve_of_eratosthenes(end):
"""Enumerates prime numbers below the given integer `end`.
Returns (as a tuple):
- `is_prime`: a list of bool values.
If an integer `i` is a prime nu... | p02574 |
N = int(eval(input()))
A = list(map(int, input().split()))
def eratosthenes(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i*2, n+1, i):
is_prime[j] ... | N = int(eval(input()))
A = list(map(int, input().split()))
A_MAX = max(A)
def eratosthenes(n):
is_prime = [True] * (n+1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i*2, n+1, i):
... | p02574 |
from math import gcd
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 2
histgram = [0] * MAX_A
for x in array:
histgram[int(x)] += 1
pairwise = True
for divider in range(2, MAX_A):
count = 0
for counted in histg... | from math import gcd
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = 0
for counted in histogram[divider::divid... | p02574 |
from math import gcd
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = 0
for counted in histogram[divider::divid... | from math import gcd
from functools import reduce
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
for divider in range(2, MAX_A):
count = sum(histogram[divi... | p02574 |
from math import gcd
from functools import reduce
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array:
histogram[int(x)] += 1
# エラトステネスの篩
primes = []
not_primes = set()
for a in ... | from math import gcd
from functools import reduce
def facs(n):
"""試し割り法における割る数を生成する。"""
yield 2
for x in range(3, n, 2):
yield x
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array... | p02574 |
from math import gcd
from functools import reduce
from collections import defaultdict
def facs(n):
"""試し割り法における割る数を生成する。"""
yield 2
for x in range(3, n, 2):
yield x
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histog... | from math import gcd
from functools import reduce
def facs(n):
"""試し割り法における割る数を生成する。"""
yield 2
for x in range(3, n, 2):
yield x
def main():
eval(input()) # N
array = [int(x) for x in input().split()]
MAX_A = 10 ** 6 + 1
histogram = [0] * MAX_A
for x in array... | p02574 |
from collections import Counter
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
... | from collections import Counter
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
... | p02574 |
import sys,random
from math import gcd
input=sys.stdin.readline
n=int(eval(input()))
*a,=list(map(int, input().split()))
random.shuffle(a)
tmp=a[0]
for i in range(1,n):
tmp=gcd(tmp,a[i])
if tmp>1:
print('not coprime')
exit()
# pairwize coprime なら素因数が2度現れることはない
def f(x):
res=set()
... | import sys,random
from math import gcd
input=sys.stdin.readline
n=int(eval(input()))
*a,=list(map(int, input().split()))
random.shuffle(a)
tmp=a[0]
for i in range(1,n):
tmp=gcd(tmp,a[i])
if tmp>1:
print('not coprime')
exit()
# pairwize coprime なら素因数が2度現れることはない
def f(x):
res=set()
... | p02574 |
from math import gcd # Python3.6以降
# --------------------------------------------------------------
# n以下の素数列挙: O-nlogn
# def primes(n):
# prs = []
# is_prime = [True] * (n + 1)
# is_prime[0] = False
# is_prime[1] = False
# for i in range(2, int(n**0.5)+1):
# if not is_prime[i]:
... | from math import gcd # Python3.6以降
# --------------------------------------------------------------
# n以下の素数列挙: O-nlogn
def primes(n):
prs = []
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5)+1):
if not is_prime[i]:
co... | p02574 |
from math import gcd
n=int(eval(input()))
A=list(map(int,input().split()))
m=max(A)
l=[0 for _ in range(m)]
fp=True
for a in A:
l[a-1]+=1
for i in range(2,m):
cnt=0
for j in range(i-1,m,i):
cnt+=l[j]
if cnt>1:
fp=False
break
g=0
fs=False
for a in A:
... | from math import gcd
def main():
n=int(eval(input()))
A=list(map(int,input().split()))
m=max(A)
l=[0 for _ in range(m)]
fp=True
for a in A:
l[a-1]+=1
for i in range(2,m):
cnt=0
for j in range(i-1,m,i):
cnt+=l[j]
if cnt>1:
... | p02574 |
import math
f=0
n=int(eval(input()))
a=list(map(int,input().split()))
p = [0]*10**6
for i in range(0, len(a)):
for j in range(2, int(math.sqrt(a[i]))+1):
if a[i] % j == 0:
p[j] += 1
if max(p)>1:
f=1
break
if f==0:
print("pairwise coprime")
else:
_gcd=a[... | n = int(eval(input()))
a = list(map(int,input().split()))
M = max(a)+1
if M == 2:
print("pairwise coprime")
exit()
count = [0]*(M)
prime = [2,3,5,7,11,13]
for i in range(14,int(M**0.5)+2):
check = True
for j in prime:
if i%j == 0:
check = False
break
if ... | p02574 |
def main():
N = int(eval(input()))
*A, = list(map(int, input().split()))
B = [0] * (10 ** 6 + 1)
for x in A:
B[x] += 1
setwise = False
d = 2
e = d
cnt = 0
while e <= 10 ** 6:
if B[e]:
cnt += B[e]
e += d
if cnt == N:
... | class Sieve:
"""区間[2,n]の値を素因数分解する"""
def __init__(self, n=1):
primes = []
f = [0] * (n + 1)
f[0] = f[1] = -1
for i in range(2, n + 1): # 素数を探す
if f[i]:
continue
primes.append(i)
f[i] = i # 素数には自身を代入
fo... | p02574 |
import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | import sys
sys.setrecursionlimit(10 ** 9)
# input = sys.stdin.readline ####
def int1(x): return int(x) - 1
def II(): return int(eval(input()))
def MI(): return list(map(int, input().split()))
def MI1(): return list(map(int1, input().split()))
def LI(): return list(map(int, input().split()))
def LI1(): return... | p02574 |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
import math
def get_primenumber(number):#エラトステネスの篩
prime_list = []
sear... |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
n=int(eval(input()))
ap=list(map(int,input().split()))
amin=min(ap)
amax=max(ap)
... | p02574 |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
p=[2, 3, 5, 7, 11, 13, 17, 19, 23, 29,
31, 37, 41, 43, 47, 53, 59, 61, 67, 71,
... |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
from collections import deque
# q = deque(l)
# q.append(4) # 後ろから4を挿入, l... | p02574 |
import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
from collections import deque
# q = deque(l)
# q.append(4) # 後ろから4を挿入, l... | import sys
def enum_div(n):
ir=int(n**(0.5))+1
ret=[]
for i in range(1,ir):
if n%i == 0:
ret.append(i)
if (i!= 1) & (i*i != n):
ret.append(n//i)
return ret
n=int(eval(input()))
ap=list(map(int,input().split()))
amin=min(ap)
amax=max(ap)
... | p02574 |
from functools import reduce
from math import gcd
N=int(eval(input()))
A=list(map(int, input().split()))
c=10**6+1
C=[0]*c
f=1
for i in A:
C[i]+=1
for i in range(2,c):
cnt=0
for j in range(i,c,i):
cnt+=C[j]
if cnt>1:
f=0
if f==1:
print('pairwise coprime')
e... | from functools import reduce
from math import gcd
N=int(eval(input()))
A=list(map(int, input().split()))
c=max(A)+1
C=[0]*c
f=1
for i in A:
C[i]+=1
for i in range(2,c):
cnt=0
for j in range(i,c,i):
cnt+=C[j]
if cnt>1:
f=0
if f==1:
print('pairwise coprime')
... | p02574 |
from functools import reduce
from math import gcd
N=int(eval(input()))
A=list(map(int, input().split()))
c=max(A)+1
C=[0]*c
f=1
for i in A:
C[i]+=1
for i in range(2,c):
cnt=0
for j in range(i,c,i):
cnt+=C[j]
if cnt>1:
f=0
if f==1:
print('pairwise coprime')
... | from functools import reduce
from math import gcd
N=int(eval(input()))
A=list(map(int, input().split()))
c=max(A)+1
D=[0]*c
div=[0]*c
P=[]
for i in range(2,c):
if D[i]==0:
P.append(i)
D[i]=i
for j in P:
if i*j>=c or j>D[i] :
break
D[i*j]=j
f=0
f... | p02574 |
import sys
from functools import reduce
from operator import add
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return list(map(int, sys.stdin.readline().strip().split()))
def gcd(a, b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
else:
... | import sys
from functools import reduce
from operator import add
def _i(): return int(sys.stdin.readline().strip())
def _ia(): return list(map(int, sys.stdin.readline().strip().split()))
def gcd(a, b):
if a < b:
a, b = b, a
r = a % b
if r == 0:
return b
else:
... | p02574 |
from math import sqrt, gcd
import sys
def osk_a(M):
p = [i for i in range(M+1)]
for x in range(2, int(sqrt(M))+1):
if p[x] == x:
for y in range(2*x, M+1, x):
if p[y] == y:
p[y] = x
return p
def g(a):
g = 0
for x in a:
... | from math import sqrt, gcd
import sys
def osk_a(M):
p = [i for i in range(M+1)]
for x in range(2, int(sqrt(M))+1):
if p[x] == x:
for y in range(2*x, M+1, x):
if p[y] == y:
p[y] = x
return p
def g(a):
g = 0
for x in a:
... | p02574 |
from math import sqrt, gcd
import sys
def osk_a(M):
p = [i for i in range(M+1)]
for x in range(2, int(sqrt(M))+1):
if p[x] == x:
for y in range(2*x, M+1, x):
if p[y] == y:
p[y] = x
return p
def g(a):
g = 0
for x in a:
... | from math import sqrt, gcd
import sys
def osk_a(M):
p = [i for i in range(M+1)]
for x in range(2, int(sqrt(M))+1):
if p[x] == x:
for y in range(2*x, M+1, x):
if p[y] == y:
p[y] = x
return p
def g(a):
g = 0
for x in a:
... | p02574 |
from functools import reduce
from math import gcd
N, *A = list(map(int, open(0).read().split()))
C = [0] * (10 ** 6 + 10)
for a in A:
C[a] += 1
if reduce(gcd, A) != 1:
print("not coprime")
elif all(sum(C[i::i]) <= 1 for i in range(2, len(C))):
print("pairwise coprime")
else:
print("... | from functools import reduce
from math import gcd
N, *A = list(map(int, open(0).read().split()))
C = [0] * (max(A) + 1)
for a in A:
C[a] += 1
if reduce(gcd, A) != 1:
print("not coprime")
elif all(sum(C[i::i]) <= 1 for i in range(2, len(C))):
print("pairwise coprime")
else:
print("se... | p02574 |
import sys
import math
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI = lambda: eval(inp... | import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | p02574 |
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | p02574 |
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | p02574 |
import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | import sys
import math
import fractions
from collections import deque
from collections import defaultdict
sys.setrecursionlimit(1000000)
MOD = 10 ** 9 + 7
input = lambda: sys.stdin.readline().strip()
NI = lambda: int(eval(input()))
NMI = lambda: list(map(int, input().split()))
NLI = lambda: list(NMI())
SI ... | p02574 |
import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
def max_gcd_pair(S):
# Assumption 1: S is the list of numbers
# Assumption 2: There are no duplicates in S
s = set(S)
m = max(S)
res = 0
i = m
while(i > 0):
a = i
cnt = 0
while (a<=m): ... | import sys
input = lambda: sys.stdin.readline().rstrip("\r\n")
n = int(eval(input()))
a = [int(x) for x in input().split()]
# 1~aの最大値までの数の最小の素因数を前処理で求める(O(max_aloglog(max_a)))
def smallest_prime_factors(a):
max_a = max(a)
smallest_prime_factors = [int(x) for x in range(max_a + 1)]
for i in range... | p02574 |
from math import gcd
def lcm(a, b):
return a * b // gcd(a, b)
def factorize(n):
b = 2
fct = []
while b * b <= n:
if n % b == 0:
fct.append(b)
while n % b == 0:
n //= b
b = b + 1
if n > 1:
fct.append(n)
return set(fct)
... | import math
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
f = 3
while f * f <= n:
if n % f == 0:
a.append(f)
n //= f
else:
f += 2
if n != 1:
a.append(n)
return set(a)
n = in... | p02574 |
from math import gcd
from collections import deque
# = map(int, input().split())
N = int(eval(input()))
A = deque(list(map(int, input().split())))
mA = max(A)
counter = [0 for _ in range(mA+1)]
primenum = [2]
sgn = [-1 for _ in range(int(mA**0.5)+1)]
k = 3
while k**2 <= mA:
if sgn[k] == -1:
primenum.a... | from math import gcd
# = map(int, input().split())
N = int(eval(input()))
A = list(map(int, input().split()))
flag = True
c2 = 0
c3 = 0
c5 = 0
for k in range(N):
if A[k] %2 ==0:
c2 += 1
if c2 > 1:
flag = False
break
elif A[k] %3 ==0:
c3 += 1
if c3 > 1:
flag = F... | p02574 |
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 07:10:00 2020
@author: liang
"""
# -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 00:26:07 2020
@author: liang
"""
"""
コーナーケース１:
重複があるとき not coprime
ただし、1の重複は除く
"""
import math
C = 10**6
N = int(eval(input()))
judge = [False]*(C+1)
... | # -*- coding: utf-8 -*-
"""
Created on Fri Sep 18 00:26:07 2020
@author: liang
"""
"""
コーナーケース１:
重複があるとき not coprime(※これが誤り)
ただし、1の重複は除く
コーナーケース:
重複があるとき pairwise coprime ではない
setwise coprimeの可能性はある
ただし、１の重複は
"""
import math
C = 10**6
#T = int(math.sqrt(C)*10**3)+1
N = int(eva... | p02574 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
Ones = A.count(1)
R = max(A)
nums = [0]*(R+1)
# 素因数テーブルの作成
D = [0]*(R+1)
for i in range(2, R+1):
if D[i]:
continue
n = i
while n < R+1:
if D[n] == 0:
D[n] = i
... | # 入力
N = int(eval(input()))
A = list(map(int, input().split()))
R = max(A)
prime_factor_counter = [0]*(R+1)
# D[x]にxを割り切れる最初の素数を格納
# 次に行う素因数分解で試し割りのムダを削減するための前準備
D = [0]*(R+1)
for i in range(2, R+1):
if D[i]:
continue
n = i
while n < R+1:
if D[n] == 0:
D[n] = i
... | p02574 |
from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
pc = True
gg = False
cnt = Counter()
fs = set()
fm = {}
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp in fs:
arr += fm[temp]
... | from collections import Counter
N = int(eval(input()))
A = list(map(int, input().split()))
x = max(A)
hurui = [x]*(x+1)
for i in range(2, x+1):
for j in range(i, x+1, i):
hurui[j] = min(i, hurui[j])
cnt = Counter([1])
for i in range(N):
num = A[i]
while num > 1:
x = hurui[num... | p02574 |
import sys
input = sys.stdin.buffer.readline
def main():
N = int(eval(input()))
a = list(map(int,input().split()))
def factrize(x):
f = set()
for i in range(2,int(x**(1/2))+1):
if x%i == 0:
f.add(i)
while x%i == 0:
... | import sys
input = sys.stdin.buffer.readline
def main():
N = int(eval(input()))
a = list(map(int,input().split()))
pr = [0]*(max(a)+1)
flag = True
for num in a:
pr[num] += 1
for i in range(2, max(a)+1):
count = sum(pr[i::i])
if count == N:
print(... | p02574 |
import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def SS(): return eval(input())
def LI(): return [int(x) for x in input().spl... | import bisect, collections, copy, heapq, itertools, math, string, sys
input = lambda: sys.stdin.readline().rstrip()
sys.setrecursionlimit(10**7)
INF = float('inf')
def I(): return int(eval(input()))
def F(): return float(eval(input()))
def SS(): return eval(input())
def LI(): return [int(x) for x in input().spl... | p02574 |
import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.... | import bisect, copy, heapq, math, sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
def celi(a,b):
return -(-a//b)
sys.... | p02574 |
N = int(eval(input()))
A = list(map(int, input().split()))
Amax = max(A)
lis = [0]*(Amax+1)
for i in range(N):
lis[A[i]] += 1
setwise = False
for t in range(2,Amax+1):
p = t
cnt = 0
while p<=Amax:
cnt += lis[p]
p += t
if cnt==N:
print('not coprime')
break
if 2<=cnt<N:
se... | N = int(eval(input()))
A = list(map(int, input().split()))
Amax = max(A)
lis = [0]*(Amax+1)
lis2 = [False]*(Amax+1)
for i in range(N):
lis[A[i]] += 1
setwise = False
for t in range(2,Amax+1):
if lis2[t]==True:
continue
p = t
cnt = 0
while p<=Amax:
lis2[p] = True
cnt += lis[p]
p... | p02574 |
from collections import defaultdict
N = int(eval(input()))
A = list(map(int, input().split()))
INF = 10**6
def min_primes(n):
ret = [i for i in range(n+1)]
for i in range(2, int(n**0.5)+1):
if ret[i] < i:
continue
for j in range(i, n+1, i):
ret[j] = min(i, ret[j])
return ret
... | import math
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
Nums = [0]*(10**6 + 1)
for a in A:
Nums[a] += 1
GCD = A[0]
for i in range(N-1):
GCD = math.gcd(GCD, A[i+1])
if GCD != 1:
print("not coprime")
else:
for d in range(2, 10**6+1):
... | p02574 |
mod = 10**9 + 7
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
def solve():
n = int(eval(input()))
a = list(map(int, input().split()))
primes = []
isprime = [True for i in range(1001)]
for i in range(2, 1001):
if isprime[i]:
primes.append(i)
for j... | mod = 10**9 + 7
def gcd(a, b):
return a if b == 0 else gcd(b, a % b)
def solve():
n = int(eval(input()))
a = list(map(int, input().split()))
primes = []
isprime = [True for i in range(1001)]
for i in range(2, 1001):
if isprime[i]:
primes.append(i)
for j... | p02574 |
import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = float('inf')
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.st... | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = float('inf')
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
_LI = lambda : [int(x)-1 for x in sys.stdin.readline().split()]
NI = lambda : int(sys.st... | p02574 |
#abc177 e
import sys,math,collections,itertools
input = sys.stdin.readline
def factorization(n):
arr = []
temp = n
for i in range(2, int(-(-n**0.5//1))+1):
if temp%i==0:
while temp%i==0:
temp //= i
arr.append(i)
if temp!=1:
arr.appe... | #abc177 e
import sys,math,collections,itertools
import functools
input = sys.stdin.readline
N=int(eval(input()))
A=list(map(int,input().split()))
fact = set()
for a in A:
if a==1:
fact.add(1)
continue
if a%2 == 0 and 2 in fact:
break
while a%2==0:
fact.add(2... | p02574 |
import sys
import math
from collections import defaultdict
def first_prime_list(N):
D = [1] * (N + 1)
for i in range(2, N + 1):
if D[i] != 1:
continue
for j in range(1, N // i + 1):
if D[i * j] == 1:
D[i * j] = i
return D
def fa... | import sys
import math
N_MAX = 200000 + 5
INF = 10**9 + 7
sys.setrecursionlimit(N_MAX)
MOD = 10**9 + 7
def main():
N = int(sys.stdin.readline().rstrip())
A = [int(x) for x in sys.stdin.readline().rstrip().split()]
maxA = max(A)
# 1 <= a <= maxA までの、要素の登場回数
C = [0] * (maxA + 1)... | p02574 |
import itertools
import math
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
B = itertools.combinations(A, 2)
C = list([math.gcd(x[0], x[1]) for x in B])
if len(list(set(C))) == 1 and list(set(C))[0] == 1:
print("pairwise coprime")
elif len(list(s... | import math
def resolve():
n = int(eval(input()))
A = list(map(int, input().split()))
M = max(A) + 1
C = [0 for i in range(M)]
for a in A:
C[a] += 1
pairwise = True
for i in range(2, M):
cnt = 0
for j in range(i, M, i):
cnt += C[j]
... | p02574 |
n = int(eval(input()))
A = tuple(map(int, input().split()))
U = 10**6
D = list(range(U+1))
i = 2
while i*i <= U:
if D[i] != i:
i += 1
continue
for j in range(i*i, U+1, i):
D[j] = min(D[j], i)
i += 1
C = [0]*(U+1)
is_pairwise = True
for a in A:
while a > 1:
d = D[a]
while a%d... | import sys
input = sys.stdin.readline
def main():
n = int(eval(input()))
A = tuple(map(int, input().split()))
U = 10**6
D = list(range(U+1))
i = 2
while i*i <= U:
if D[i] != i:
i += 1
continue
for j in range(i*i, U+1, i):
D[j] = min(D[j], i)
i += 1
C = [0]*(U+1... | p02574 |
from collections import defaultdict
from math import gcd
def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
all = 0
for a in A:
all = gcd(all, a)
if all != 1:
return "not coprime"
M = 10 ** 6
B = defaultdict(int)
for a in A:
B... | from math import gcd
def solve():
N = int(eval(input()))
A = list(map(int, input().split()))
all = 0
for a in A:
all = gcd(all, a)
if all != 1:
return "not coprime"
M = 10 ** 6
B = dict()
for a in A:
if a in B:
B[a] += 1
else:... | p02574 |
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def factorize(n, d):
# if n == 0 or n == 1:
# return []
arr = []
tmp = n
while True:
i = d[tmp]
if i == 1:
break
#cnt=0
while tmp%i==0:
#cnt+=1
... | import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def factorize(n, d):
# if n == 0 or n == 1:
# return []
arr = []
tmp = n
while True:
i = d[tmp]
if i == 1:
break
#cnt=0
while tmp%i==0:
#cnt+=1
... | p02574 |
from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
MAXN = 10**6+10
sieve = [0,0] + [1]*MAXN
p = 2
primes = set()
while p*p <= MAXN:
if sieve[p]:
primes.add(p)
for q in ran... | from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
sa = set()
for a in A:
if a==1: continue
if a in sa:
print('setwise coprime')
exit()
sa.add(a)
MAXN = 10**6+10... | p02574 |
from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
MAXA = 10**6
B = [0] * (MAXA+1)
for a in A:
if a==1: continue
if B[a]:
print('setwise coprime')
exit()
B[a] = 1
... | from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
def solve():
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
MAXA = 10**6
B = [0] * (MAXA+1)
for a in A:
if a==1: continue
if B[a]:
... | p02574 |
from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
from collections import Counter
def factorize(n):
d = Counter()
m = 2
while m*m <= n:
while n%m == 0:
n //= m... | from math import gcd
N = int(eval(input()))
A = list(map(int,input().split()))
g = 0
for a in A:
g = gcd(g,a)
if g > 1:
print('not coprime')
exit()
def factorize(n):
d = set()
m = 2
while m*m <= n:
while n%m == 0:
n //= m
d.add(m)
m += ... | p02574 |
from math import gcd
import sys
sys.setrecursionlimit(1000000)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
tmp = gcd(A[0],A[1])
set_A = set(A)
for i in range(2,N):
tmp = gcd(tmp, A[i])
if tmp != 1:
print('not coprime')
exit()
... | from math import gcd
import sys
sys.setrecursionlimit(1000000)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
tmp = gcd(A[0],A[1])
set_A = set(A)
for i in range(2,N):
tmp = gcd(tmp, A[i])
if tmp != 1:
print('not coprime')
exit()
... | p02574 |
N = int(eval(input()))
A = list(map(int, input().split()))
M = 1000
P = [True for i in range(M+1)]
p_set = set()
for i in range(2,M+1):
if P[i]:
p_set.add(i)
for j in range(2*i, M+1, i):
P[j] = False
#print( len(p_set) )
#N = 10 ** 6
#A = [1001 for i in range(N)]
c = 0
for p in p_set... | N = int(eval(input()))
A = list(map(int, input().split()))
#A = [888881 for i in range(10**6)]
M = max(A)
#高速素因数分解
#前処理：その数にある最小の素因数→エラトステネスの篩で最初におとすもの
P = [1 for i in range(M+1)]
for i in range(2, M+1):
if P[i] == 1:
for j in range(i, M+1, i):
if P[j] == 1:
P[j] =... | p02574 |
def max(a,b):
if a>b:
return a
else:
return b
def min(a,b):
if a>b:
return b
else:
return a
def gcd(a,b):
a,b = max(a,b),min(a,b)
while a%b!=0:
a,b = b,a%b
return b
def gcdl(A):
if len(A)==2:
return gcd(A[0],A[1... | def max(a,b):
if a>b:
return a
else:
return b
def min(a,b):
if a>b:
return b
else:
return a
def gcd(a,b):
a,b = max(a,b),min(a,b)
while a%b!=0:
a,b = b,a%b
return b
def gcdl(A):
if len(A)==2:
return gcd(A[0],A[1... | p02574 |
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | import math
from collections import defaultdict
pc = True
n = int(eval(input()))
a = list(map(int,input().split()))
g = math.gcd(a[0],a[1])
for i in range(2,n):
g = math.gcd(g,a[i])
M = max(a)
class Sieve_of_Eratosthenes:
def __init__(self, N):
self.sieve = [-1] * (N+1)
for i in r... | p02574 |
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | #!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | p02574 |
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | #!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | p02574 |
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | #!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | p02574 |
#!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | #!/usr/bin/env pypy3
# N,M = map(int,sys.stdin.readline().split())
# a = tuple(map(int,sys.stdin.readline().split())) # single line with multi param
# a = tuple(int(sys.stdin.readline()) for _ in range(N)) # multi line with single param
# a = tuple(tuple(map(int,sys.stdin.readline().rstrip().split())) for _ in rang... | p02574 |
# E
N=int(eval(input()))
A=list(map(int,input().split()))
def gcd(a,b):
if a>b:
a,b=b,a
while a%b:
a,b=b,(a%b)
return b
def fast_factorization_init(N):
res=list(range(N))
for i in range(2,N):
if i*i>N:
break
for j in range(i*i,N,i):
... | # E
N=int(eval(input()))
A=list(map(int,input().split()))
def gcd(a,b):
if a>b:
a,b=b,a
while a%b:
a,b=b,(a%b)
return b
def fast_factorization_init(N):
res=list(range(N))
for i in range(2,N):
if i*i>N:
break
for j in range(i*i,N,i):
... | p02574 |
import collections
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class Prime:
@staticmethod
def trial_division(x):
if x % 2 == 0:
return True
for p in range(3, int(x**0.5 + 1), 2):
if x % p == 0:
return False
return Tr... | import collections
N = int(eval(input()))
A = [int(_) for _ in input().split()]
class Prime:
@staticmethod
def trial_division(x):
if x % 2 == 0:
return True
for p in range(3, int(x**0.5 + 1), 2):
if x % p == 0:
return False
return Tr... | p02574 |
# でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
from math import gcd
M = 10**6
def main(N, A):
g = 0
for a in A:
g = gcd(g, a)
if g > 1:
print('not coprime')
return
u = [False] * (M + 1)
cc = [0] * (M + 1)
for a in A:
cc[a] += 1
for ... | # でつoO(YOU PLAY WITH THE CARDS YOU'RE DEALT..)
import sys
from math import gcd
from functools import reduce
from typing import Iterable
M = 10**6
def main(N, A):
g = reduce(gcd, A)
if g > 1:
print('not coprime')
return
s = EratosthenesSieve(M)
u = [False] * (M + 1)
for... | p02574 |
import math
from functools import reduce
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
tmp = [0] * N
s = 1
for i in range(N):
tmp[- i - 1] = s
s *= A[-i - 1]
is_pairwise_coprime = True
for i in range(N - 1):
if math.gcd(A... | import math
from functools import reduce
def lcm(x, y):
return (x * y) // math.gcd(x, y)
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
tmp = [0] * N
s = 1
for i in range(N):
tmp[- i - 1] = s
s = lcm(s, A[-i - 1])
is_pairwise_... | p02574 |
from functools import reduce
n = input()
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
def f(ais):
seen = set()
bis = ais[::]
flag= True
for ai in bis[::]:
factor =2
while(ai != 1):
if ai % factor == 0:
if factor in seen:
flag = False
break
while(ai % factor... | from functools import reduce
n = input()
def gcd(a,b):
if b == 0:
return a
return gcd(b,a%b)
def g(ais): return reduce(gcd, ais) == 1
def f(ais):
seen = set()
for ai in ais:
factor =2
oi = ai
while(ai != 1 and factor * factor <= oi):
if ai % factor == 0:
if factor in seen:
retu... | p02574 |
from math import gcd
from functools import reduce
from sys import exit
# O(A+NloglogN)解
MAX_A = 1000000
lowerst_prime = [10**9] * (MAX_A + 1) # 最小の素因数をいれる(2以上をみていけばいい)
count = [0] * (MAX_A + 1) # 約数として出てくる回数を数える
for i in range(2, MAX_A + 1): # エラトステネスの篩
if lowerst_prime[i] != 10**9:
continue
... | from math import gcd
from functools import reduce
from sys import exit
# O(NlogA+AloglogA)解
MAX_A = 1000000
lowerst_prime = [10**9] * (MAX_A + 1) # 最小の素因数をいれる(2以上をみていけばいい)
count = [0] * (MAX_A + 1) # 約数として出てくる回数を数える
for i in range(2, MAX_A + 1): # エラトステネスの篩
if lowerst_prime[i] != 10**9:
continu... | p02574 |
from math import gcd
from functools import reduce
from sys import exit
# O(NlogA+AloglogA)解
MAX_A = 1000000
lowerst_prime = [10**9] * (MAX_A + 1) # 最小の素因数をいれる(2以上をみていけばいい)
count = [0] * (MAX_A + 1) # 約数として出てくる回数を数える
for i in range(2, MAX_A + 1): # エラトステネスの篩
if lowerst_prime[i] != 10**9:
continu... | from math import gcd
from functools import reduce
from sys import exit
# O(NlogA+AloglogA)解
MAX_A = 1000000
lowerst_prime = [0] * (MAX_A + 1) # 最小の素因数をいれる(2以上をみていけばいい)
count = [0] * (MAX_A + 1) # 約数として出てくる回数を数える
for i in range(2, MAX_A + 1): # エラトステネスの篩
if lowerst_prime[i] != 0:
continue
l... | p02574 |
import sys
import math
import collections
import bisect
import itertools
import decimal
# import numpy as np
# sys.setrecursionlimit(10 ** 6)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().spli... | import sys
import math
import collections
import bisect
import itertools
import decimal
# import numpy as np
# sys.setrecursionlimit(10 ** 6)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().spli... | p02574 |
import sys
import math
import collections
import bisect
import itertools
import decimal
# import numpy as np
# sys.setrecursionlimit(10 ** 6)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().spli... | import sys
import math
import collections
import bisect
import itertools
import decimal
# import numpy as np
# sys.setrecursionlimit(10 ** 6)
INF = 10 ** 20
MOD = 10 ** 9 + 7
# MOD = 998244353
ni = lambda: int(sys.stdin.readline().rstrip())
ns = lambda: list(map(int, sys.stdin.readline().rstrip().spli... | p02574 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.