input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
import array
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
rpos = 0
... | import array
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
rpos = 0
... | p02274 |
import array
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
rpos = 0
... | from array import array
def merge_sort(A):
if len(A) <= 1:
return A, 0
mid = len(A) // 2
left, lcount = merge_sort(A[:mid])
right, rcount = merge_sort(A[mid:])
merged, count = merge(left, right)
return merged, lcount + rcount + count
def merge(left, right):
lpos = 0
... | p02274 |
n = int(eval(input()))
nd = list(map(int, input().split()))
c = 0
for i in range(n):
m = min(nd)
index = nd.index(m)
nd.remove(m)
c += index
print(c)
| n = int(eval(input()))
nlist = list(map(int, input().split()))
W = [0for i in range(n)]
def M(l,r): ##l~r-1 까지의 리스트.
if (l+1 >= r):
return 0
elif (l+2 == r):
if (nlist[l] <= nlist[l+1]):
return 0
else:
nlist[l],nlist[l+1] = nlist[l+1],nlist[l]
... | p02274 |
INF = float("inf")
cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left: mid] + [INF]
R = A[mid: right] + [INF]
i = j = 0
limit = mid - left
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
if i >= limit:
... | INF = float("inf")
cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left: mid] + [INF]
R = A[mid: right] + [INF]
i = j = 0
limit = mid - left
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
cnt += lim... | p02274 |
INF = float("inf")
cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left: mid] + [INF]
R = A[mid: right] + [INF]
i = j = 0
limit = mid - left
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
cnt += lim... | INF = float("inf")
cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left: mid] + [INF]
R = A[mid: right] + [INF]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
cnt += j
i += 1
else:
A[k] = R[j]
... | p02274 |
from bisect import bisect_left
def count_inversion(A):
cnt = 0
L = len(A)
for i in reversed(list(range(L - 1))):
j = bisect_left(A, A[i], i + 1, L)
cnt += j - i - 1
tmp = A[i]
del A[i]
A.insert(j - 1, tmp)
return cnt
def main():
n = int(eva... | #! /usr/local/bin/python3
# coding: utf-8
from math import inf
inv = 0
def merge(A, left, mid, right):
global inv
L = A[left:mid]
L.append(inf)
R = A[mid:right]
R.append(inf)
i = j = 0
for k in range(left, right):
if L[i] < R[j]:
A[k] = L[i]
... | p02274 |
import bisect, sys
n = sys.stdin.readline()
cnt = 0
a = []
for ai in map(int, sys.stdin.readline().split()):
pos = bisect.bisect_left(a, ai)
cnt -= pos
a.insert(pos, ai)
print((((len(a) - 1) * len(a)) // 2 + cnt)) | SENTINEL = 10 ** 9 +1
cnt = 0
def merge(A, left, mid, right):
global cnt
L = A[left:mid] + [SENTINEL]
R = A[mid:right] + [SENTINEL]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
A[k] = L[i]
i += 1
else:
A[k] = R[j]
... | p02274 |
def invNum(d,A):
if d < 0 or len(A)==0: return 0
cnt = 0
L = []
R = []
for ai in A:
if ai < 2**d:
L.append(ai)
cnt += len(R)
else:
R.append(ai-2**d)
return cnt + invNum(d-1,L) + invNum(d-1,R)
if __name__=='__main__':
n = int... | def invNum(d,A):
if d < 0 or not A: return 0
cnt = 0
L = []
R = []
for ai in A:
if ai < 2**d:
L.append(ai)
cnt += len(R)
else:
R.append(ai-2**d)
return cnt + invNum(d-1,L) + invNum(d-1,R)
if __name__=='__main__':
n = int(eva... | p02274 |
def invNum(d,A):
if d < 0 or not A: return 0
cnt = 0
L = []
R = []
for ai in A:
if ai < 2**d:
L.append(ai)
cnt += len(R)
else:
R.append(ai-2**d)
return cnt + invNum(d-1,L) + invNum(d-1,R)
if __name__=='__main__':
n = int(eva... | def invNum(d,A):
if d < 0 or len(A) < 2: return 0
cnt = 0
L = []
R = []
for ai in A:
if ai < 2**d:
L.append(ai)
cnt += len(R)
else:
R.append(ai-2**d)
return cnt + invNum(d-1,L) + invNum(d-1,R)
if __name__=='__main__':
n = in... | p02274 |
def invNum(d,A):
if d < 0 or len(A) < 2: return 0
cnt = 0
L = []
R = []
for ai in A:
if ai < 2**d:
L.append(ai)
cnt += len(R)
else:
R.append(ai-2**d)
return cnt + invNum(d-1,L) + invNum(d-1,R)
if __name__=='__main__':
n = in... | cnt = 0
def merge(L,R):
global cnt
n = len(L)+len(R)
lenL = len(L)
A = []
i = j = 0
L.append(-1)
R.append(-1)
for _ in range(n):
if L[i] > R[j]:
A.append(L[i])
i += 1
else:
A.append(R[j])
j += 1
c... | p02274 |
import sys
cnt2 = 0
def bubble_sort(a):
cnt = 0
n = len(a)
for i in range(n):
for j in range(n-1, i, -1):
if a[j] < a[j-1]:
tmp = a[j]
a[j] = a[j-1]
a[j-1] = tmp
cnt += 1
return cnt
def merge_sort(a):
merge_sort_(a, 0, len(a))
def merge_sort_(a, left, right):
if left + 1... | import sys
cnt = 0
def merge_sort(a, left, right):
if left + 1 < right:
mid = int(left + (right - left) / 2)
merge_sort(a, left, mid)
merge_sort(a, mid, right)
merge(a, left, mid, right)
def merge(a, left, mid, right):
n1 = mid - left
n2 = right - mid
L = a[left:left+n1]
R = a[mid:mid+n2]
... | p02274 |
from bisect import bisect_right
def inv_number(A):
cnt = 0
left = []
for i, a in enumerate(A):
j = bisect_right(left, a)
cnt += i - j
left.insert(j, a)
return cnt
n = int(eval(input()))
print((inv_number(list(map(int, input().split())))))
| n = int(eval(input()))
A = [(i + 1, int(j)) for i, j in enumerate(input().split())]
A.sort(key=lambda x: -x[1])
class BIT:
def __init__(self, n):
self.data = [0] * (n + 1)
def add(self, i, x):
while i <= n:
self.data[i] += x
# 区間の長さ
i += i & -i
... | p02274 |
from collections import deque
def mergeSort(A,left,right):
middle = (left + right) // 2
if left + 1 < right:
mergeSort(A, left, middle)
mergeSort(A, middle, right)
merge(A,left,right,middle)
def merge(A,left,right,middle):
global count
L = deque(A[left:... | from _collections import deque
SENIAL = 1000000000
def mergeSort(A,left,right):
if left + 1 < right:
middle = (left + right) // 2
mergeSort(A, left, middle)
mergeSort(A, middle, right)
merge(A,left,right,middle)
def merge(A,left,right,middle):
global count ... | p02274 |
import sys
sintinel = 1000000001
def merge_sort(A, l, r):
if l + 1 < r:
mid = (l + r) // 2
merge_sort(A, l, mid)
merge_sort(A, mid, r)
merge(A, l, mid, r)
def merge(A, l, mid, r):
global count
for j in range(mid, r):
y = j
x = y - 1
... | import sys
sintinel = 1000000001
def merge_sort(A, l, r):
if l + 1 < r:
mid = (l + r) // 2
cnt1 = merge_sort(A, l, mid)
cnt2 = merge_sort(A, mid, r)
cnt3 = merge(A, l, mid, r)
return (cnt1 + cnt2 + cnt3)
else:
return 0
def merge(A, l, mid, r):
... | p02274 |
import sys
def solve():
n = int(sys.stdin.readline().rstrip())
a = list(map(int, sys.stdin.readline().split()))
b = compress(a)
ft = FenwickTree(max(b) + 1)
ans = 0
for bi in reversed(b):
ans += ft.psum(bi + 1)
ft.add(bi, 1)
print(ans)
def compress(a):
... | import sys
inf = 1<<30
ans = 0
def solve():
n = int(sys.stdin.readline().rstrip())
a = list(map(int, sys.stdin.readline().split()))
MergeSort(a)
print(ans)
def MergeSort(a):
if len(a) == 1:
return a
apre = MergeSort(a[:len(a)//2])
asuf = MergeSort(a[len(a)//2:... | p02274 |
#coding:utf-8
import itertools
n = int(eval(input()))
numbers = list(map(int, input().split()))
count = 0
for item in itertools.combinations(numbers, 2):
if item[0] > item[1]:
count += 1
print(count) | #coding:utf-8
#1_5_D
def merge(array, left, mid, right):
global cnt
L = array[left:mid] + [sentinel]
R = array[mid:right] + [sentinel]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
array[k] = L[i]
i += 1
else:
array[k] = ... | p02274 |
#coding:utf-8
#1_5_D
def merge(array, left, mid, right):
global cnt
L = array[left:mid] + [sentinel]
R = array[mid:right] + [sentinel]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
array[k] = L[i]
i += 1
else:
array[k] = ... | #coding:utf-8
#1_5_D
def merge(array, left, mid, right):
global cnt
L = array[left:mid] + [SENTINEL]
R = array[mid:right] + [SENTINEL]
i = j = 0
for k in range(left, right):
if L[i] <= R[j]:
array[k] = L[i]
i += 1
else:
array[k] = ... | p02274 |
import sys
mod=10**9+7 ; inf=float("inf")
from math import sqrt, ceil
from collections import deque, Counter, defaultdict #すべてのkeyが用意されてる defaultdict(int)で初期化
input=lambda: sys.stdin.readline().strip()
sys.setrecursionlimit(11451419)
from decimal import ROUND_HALF_UP,Decimal #変換後の末尾桁を0や0.01で指定
#Decimal((str(0... | n=int(eval(input()))
A=list(map(int,input().split()))
def Dlist(BIG):
D=[1]*(BIG+1)
for p in range(2,BIG+1):
if D[p]!=1:
continue
for i in range(p,BIG+1,p):
if D[i]==1:
D[i]=p
return D
D=Dlist(max(A))
def SOINSU(num,D): #素因数だけ列挙(setしただけ)
... | p02574 |
import math
import unittest
import collections
def f(n):
e = set()
if n == 1:
return e
while n % 2 == 0:
e.add(2)
n //= 2
i = 3
while i <= n:
while n % i == 0:
e.add(i)
n //= i
i += 2
return e
def is_pairwis... | import math
import unittest
import sys
class PrimeFactorization:
def __init__(self, max_n):
_primes, minimam_prime_factor = PrimeFactorization.list_primes(max_n)
self.minimam_prime_factor = minimam_prime_factor
def list_primes(max_n):
# Sieve of Eratosthenes
minima... | p02574 |
import math
import unittest
import sys
class PrimeFactorization:
def __init__(self, upper_limit):
_primes, minimam_prime_factor = PrimeFactorization.list_primes(
upper_limit)
self.minimam_prime_factor = minimam_prime_factor
def list_primes(upper_limit):
# Sieve... | import math
import unittest
import sys
class PrimeFactorization:
def __init__(self, upper_limit):
_primes, minimam_prime_factor = PrimeFactorization.list_primes(
upper_limit)
self.minimam_prime_factor = minimam_prime_factor
def list_primes(upper_limit):
# Sieve... | p02574 |
import sys,math
n=int(eval(input()))
a=list(map(int,input().split()))
numbers={}
flag=0
for i in range(n):
if a[i] in numbers:
numbers[a[i]]+=1
else:
numbers[a[i]]=1
pointer=2
while pointer<10**6+1:
count=0
pointer2=pointer
while pointer2<10**6+1:
if pointer2 in numbers:
coun... | import sys,math
n=int(eval(input()))
a=list(map(int,input().split()))
numbers={}
flag=0
for i in range(n):
if a[i] in numbers:
numbers[a[i]]+=1
else:
numbers[a[i]]=1
for pointer in range(2,10**6+1):
count=0
pointer2=pointer
while pointer2<10**6+1:
if pointer2 in numbers:
count... | p02574 |
def factorize(x):
p = 2
f = {}
while x>=p*p:
if x%p==0: f[p]=0
while x%p==0:
f[p]+=1
x//=p
p+=1
if x>1: f[x]=1
return f
N = int(eval(input()))
A = list(map(int, input().split()))
F = {0:0}
for a in A:
for f in set(factorize(a))... | def factorize(x):
f = {}
if x%2==0: f[2]=0
while x%2==0:
f[2]+=1
x//=2
p = 3
while x>=p*p:
if x%p==0: f[p]=0
while x%p==0:
f[p]+=1
x//=p
p+=2
if x>1: f[x]=1
return f
N = int(eval(input()))
A = list(map(in... | p02574 |
import math
from functools import reduce
def getD(num):
input_list = [2 if i % 2 == 0 else i for i in range(num+1)]
input_list[0] = 0
bool_list = [False if i % 2 == 0 else True for i in range(num+1)]
sqrt = int(math.sqrt(num))
for serial in range(3, sqrt + 1, 2):
if bool_list... | import math
from functools import reduce
def getD(num):
input_list = [2 if i % 2 == 0 else i for i in range(num+1)]
input_list[0] = 0
bool_list = [False if i % 2 == 0 else True for i in range(num+1)]
sqrt = int(math.sqrt(num))
for serial in range(3, sqrt + 1, 2):
if bool_list... | p02574 |
import math
from functools import reduce
def getD(num):
input_list = [2 if i % 2 == 0 else i for i in range(num+1)]
input_list[0] = 0
bool_list = [False if i % 2 == 0 else True for i in range(num+1)]
sqrt = int(math.sqrt(num))
for serial in range(3, sqrt + 1, 2):
if bool_list... | import math
from functools import reduce
def getD(num):
input_list = [2 if i % 2 == 0 else i for i in range(num+1)]
input_list[0] = 0
bool_list = [False if i % 2 == 0 else True for i in range(num+1)]
sqrt = int(math.sqrt(num))
for serial in range(3, sqrt + 1, 2):
if bool_list... | p02574 |
from math import gcd, sqrt, ceil
from functools import reduce
# def sieve(n):
# A = list(range(n+1))
# for i in range(2, n+1 ,2):
# A[i] = 2
# for j in range(3, ceil(sqrt(n+1))+1, 2)[::-1]:
# for i in range(j, n+1, j):
# A[i] = j
# return A
# def factorize(n, A)... | from math import gcd, sqrt, ceil
from functools import reduce
# def sieve(n):
# A = list(range(n+1))
# for i in range(2, n+1 ,2):
# A[i] = 2
# for j in range(3, ceil(sqrt(n+1))+1, 2)[::-1]:
# for i in range(j, n+1, j):
# A[i] = j
# return A
# def factorize(n, A)... | p02574 |
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
def main():
... | def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
def prime_facto... | p02574 |
from math import gcd
n = int(eval(input()))
a = list(map(int, input().split()))
g = a[0]
for i in range(1, n):
g = gcd(g, a[i])
if g == 1:
break
else:
print('not coprime')
exit()
ind = [-1] * (10**6)
prime = [2, 3, 5, 7]
for i in range(11, 10 ** 6, 2):
j = 0
flag =... | class Prime():
def __init__(self, n):
self.p = []
self.d = [0] * n
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
if self.d[j] == 0:
self.d[j] = i
... | p02574 |
class Prime():
def __init__(self, n):
self.p = []
self.d = [0] * n
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
if self.d[j] == 0:
self.d[j] = i
... | class Prime():
def __init__(self, n):
self.p = []
self.d = [0] * n
for i in range(2, n):
if self.d[i] == 0:
self.p.append(i)
for j in range(i, n, i):
if self.d[j] == 0:
self.d[j] = i
... | p02574 |
from math import gcd, sqrt
def Divisor_Set(n):
s = set()
for i in range(1, int(sqrt(n))+2):
if n%i == 0:
s.add(i)
s.add(n//i)
return s
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
cnt = [0]*(10**6+1)
for v in a:
... | from math import gcd, sqrt
def Divisor_Set(n):
s = set()
for i in range(1, int(sqrt(n))+2):
if n%i == 0:
s.add(i)
s.add(n//i)
return s
def main():
n = int(eval(input()))
a = list(map(int, input().split()))
f = True
divset = set()
for v in ... | p02574 |
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
m = max(a)
d = [0] * (m + 1)
d[1] = 1
for i in range(2, m + 1):
for j in range(i, m + 1, i):
if d[j] == 0:
d[j] = i
def prime_factorize(n):
res = []
if n == 1:
return res
... | from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
m = max(a)
d = [0] * (m + 1)
d[1] = 1
for i in range(2, m + 1):
for j in range(i, m + 1, i):
if d[j] == 0:
d[j] = i
def prime_factorize(n):
res = []
if n == 1:
return res
... | p02574 |
def yakusu(x):
tmp=int(pow(x, 1/2))+1
out=set()
for i in range(1, tmp):
if x%i==0:
out.add(i)
out.add(x//i)
if pow(x, 1/2)%1==0:
out.add(pow(x, 1/2))
out=list(out)
out.sort()
return out
N=int(eval(input()))
A=list(map(int, input().split(... | def yakusu(x):
tmp=int(pow(x, 1/2))+1
out=set()
for i in range(1, tmp):
if x%i==0:
out.add(i)
out.add(x//i)
if pow(x, 1/2)%1==0:
out.add(pow(x, 1/2))
out=list(out)
out.sort()
return out
N=int(eval(input()))
A=list(map(int, input().split(... | p02574 |
import base64
import subprocess
exe_bin = "e??420s#R400000000000{}h%0RR91unqtK00000KmY&$00000Fj4>j0000000000Kma%Z2>?I<9snHx1^@s61ONa4KmY&$00000KmY&$00000KmY&$00000_yGU_00000_yGU_000002mk;8000000{{R31ONa4I066w00000I066w00000I066w000008~^|S000008~^|S000000RR91000000RR911poj5000000000000000000000000000000b}|3}00000b... | import base64
import subprocess
exe_bin = "e??420s#R400000000000{}h%0RR91&<y|p00000KmY&$00000;4c6G0000000000Kma%Z2>?I<9snHx1^@s61ONa4KmY&$00000KmY&$00000KmY&$00000_yGU_00000_yGU_000002mk;8000000{{R31ONa4I066w00000I066w00000I066w000008~^|S000008~^|S000000RR91000000RR911poj5000000000000000000000000000000sv7_R00000s... | p02574 |
import base64
import subprocess
exe_bin = "e??420s#R400000000000{}h%0RR91unqtK00000KmY&$00000Fj4>j0000000000Kma%Z2>?I<9snHx1^@s61ONa4KmY&$00000KmY&$00000KmY&$00000_yGU_00000_yGU_000002mk;8000000{{R31ONa4I066w00000I066w00000I066w000008~^|S000008~^|S000000RR91000000RR911poj5000000000000000000000000000000ZZZG>00000Z... | # This code is generated by [Atcoder_base64](https://github.com/kyomukyomupurin/AtCoder_base64)
# Original source code :
"""
#include <algorithm>
#include <bitset>
#include <cassert>
#include <cctype>
#include <chrono>
#include <cmath>
#include <complex>
#include <cstring>
#include <deque>
#include <ioma... | p02574 |
# coding: utf-8
from math import gcd
import math
# 素数判定関数
def isPrime(num):
# 2未満の数字は素数ではない
if num < 2: return False
# 2は素数
elif num == 2: return True
# 偶数は素数ではない
elif num % 2 == 0: return False
# 3 ~ numまでループし、途中で割り切れる数があるか検索
# 途中で割り切れる場合は素数ではない
for i in range(3, math... | # coding: utf-8
from math import gcd
def getPrime(x):
num_list=[i for i in range(2,x+1)]
prime_list=[]
D=[x+1 for i in range(x+1)]
while num_list[0]<x**(1/2):
p=num_list.pop(0)
prime_list.append(p)
for i in range(len(num_list)):
if num_list[i]%p==0:
... | p02574 |
import sys
from math import gcd
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A =list(map(int, input().split()))
all_gcd = A[0]
max_num = A[0]
for a in A:
all_gcd = gcd(all_gcd, a)
max_num = max(max_num, a)
if all_gcd != 1:
... | import sys
from math import gcd
def input(): return sys.stdin.readline().strip()
def main():
N = int(eval(input()))
A =list(map(int, input().split()))
all_gcd = A[0]
max_num = A[0]
for a in A:
all_gcd = gcd(all_gcd, a)
max_num = max(max_num, a)
if all_gcd != 1:
... | p02574 |
import math
import functools
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
Amax = max(A) + 1
if Amax == 2:
print('pairwise coprime')
sys.exit(0)
hurui = [1] * 1001
primes = []
for n in range(2, 1001):
if hurui[n] != 1:
continue
primes.append(n)
... | import math
import functools
import sys
N = int(eval(input()))
A = list(map(int, input().split()))
wise = functools.reduce(math.gcd, A)
if wise != 1:
print('not coprime')
sys.exit(0)
A = list([a for a in A if a != 1])
if len(A) == 0:
print('pairwise coprime')
sys.exit(0)
pcount = ... | p02574 |
n = int(eval(input()))
a = list(map(int,input().split()))
p = [0 for _ in range(10**6)]
for x in a:
d = int(x)
for y in range(2,10**3):
if d % y == 0:
p[y] += 1
while d % y == 0:
d //= y
if d != 1:
p[d] += 1
#print(p)
if max(p) == 1:
print('pairwise coprime')
exit(... | n = int(eval(input()))
a = list(map(int,input().split()))
p = [0 for _ in range(10**6)]
pr = [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, 23... | p02574 |
import math
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
isprime = [True] * (1 + pow(10, 6))
prime = []
SPF = [None] * (1 + pow(10, 6))
def manipulated_seive(N):
isprime[0] = isprime[1] = False
for i in range(2, N):
if isprim... | import math
import collections
def main():
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:
... | p02574 |
import math
import collections
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
d = dict()
def prime_factor(n):
if n % 2 == 0: d[2] = d.get(2, 0) + 1
while n % 2 == 0:
n //= 2
for i in range(3, int(math.sqrt(n))+1, 2):
... | import math
import collections
def main():
N = int(eval(input()))
A = list(map(int, input().split()))
d = dict()
def prime_factor(n):
if n % 2 == 0: d[2] = d.get(2, 0) + 1
while n % 2 == 0:
n //= 2
i = 3
while i * i <= n:
if n % i... | p02574 |
# 自然数m以下の素数を返す（SETでRETURN）
import math
def prime_numbers(m):
# 素数を保持するset
primes = []
# 2以上m以下の素数を数え上げる
n = 2
while n <= m:
# 自身より小さい全ての素数で割り切れなければ、素数とみなせる
if all(n % i != 0 for i in primes):
primes.append(n)
n += 1
return primes
#素数で割れるか、同じ素数... | #素因数分解（10**6まで）
def soinsu_bunkai(m):
pf=set()
mm =m
for i in pri_num:
while mm %i==0:
if i >m:
break
elif mm %i==0:
pf.add(i)
mm //=i
if mm !=1:
pf.add(mm)
return pf
# 初期入力
import math
impo... | p02574 |
#素因数分解（10**6まで）
def soinsu_bunkai(m):
pf=set()
mm =m
for i in pri_num:
while mm %i==0:
pf.add(i)
mm //=i
if mm !=1:
pf.add(mm)
return pf
# 初期入力
import math
import sys
from collections import Counter
from functools import reduce
input = ... | #素因数分解（10**6まで）
def soinsu_bunkai(m):
pf=set()
mm =m
for i in pri_num:
while mm %i==0:
pf.add(i)
mm //=i
if mm !=1:
pf.add(mm)
return pf
# 初期入力
import math
import sys
from bisect import bisect_left
from functools import reduce
input = sys... | p02574 |
#素因数分解（10**6まで）
def soinsu_bunkai(m):
pf=set()
mm =m
for i in pri_num:
while mm %i==0:
pf.add(i)
mm //=i
if mm !=1:
pf.add(mm)
return pf
# 初期入力
import math
import sys
from bisect import bisect_left
from functools import reduce
input = sys... | #素因数分解（10**6まで）
def soinsu_bunkai(m):
pf=set()
mm =m
for i in pri_num:
while mm %i==0:
pf.add(i)
mm //=i
if mm !=1:
pf.add(mm)
return pf
# 初期入力
import math
import sys
from bisect import bisect_left
from functools import reduce
input = sys... | p02574 |
#高速素因数分解 osa_k法
#下準備
def osa_k(a,MAXN):
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
#素因数分解の値
tmp = set()
while a ... | #高速素因数分解 osa_k法
def osa_k(a):
tmp = set()
while a > 1:
tmp.add(sieve[a])
a //= sieve[a]
return tmp
# 初期入力
import math
import sys
from bisect import bisect_left
from functools import reduce
input = sys.stdin.readline #文字列では使わない
N = int(eval(input()))
A = list(map(int, i... | p02574 |
import sys
sys.setrecursionlimit(10**7)
def I(): return int(sys.stdin.readline().rstrip())
def MI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
def LI2(): return list(map(int,sys.stdin.readline().rstrip())) #空白なし
def ... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
from math import gcd
g = 0 # Aiたちの最大公約数
for i in range(N):
g = gcd(g,A[i])
if g != 1:
print('not coprime')
exit()
B = []
for i... | p02574 |
import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
from math import gcd
g = 0 # Aiたちの最大公約数
for i in range(N):
g = gcd(g,A[i])
if g != 1:
print('not coprime')
exit()
B = [0]*(... | import sys
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N = I()
A = LI()
from math import gcd
g = 0 # Aiたちの最大公約数
for i in range(N):
g = gcd(g,A[i])
if g != 1:
print('not coprime')
exit()
# osa_k法
... | p02574 |
def main():
n, *a, = list(map(int, open(0).read().split()))
m = max(a)
def minimum_prime(x):
if x == 1:
return 1
for i in range(3, x + 1, 2):
if x % i == 0:
return i
d = [minimum_prime(i) if i % 2 == 1 else 2 for i in range(m + 1)]
... | def main():
n, *a, = list(map(int, open(0).read().split()))
m = max(a)
d = [0] * (m+1)
d[1] = 1
for i in range(2, m+1):
for j in range(i, m+1, i):
if d[j] == 0:
d[j] = i
def primes(x):
ps = set()
while x != 1:
p = d[... | p02574 |
def main():
n, *a, = list(map(int, open(0).read().split()))
m = max(a)
d = [0] * (m+1)
d[1] = 1
for i in range(2, m+1):
for j in range(i, m+1, i):
if d[j] == 0:
d[j] = i
def primes(x):
ps = set()
while x != 1:
p = d[... | def main():
n, *a, = list(map(int, open(0).read().split()))
m = max(a)
d = [0] * (m + 1)
d[1] = 1
for i in range(2, m + 1):
for j in range(i, m + 1, i):
if d[j] == 0:
d[j] = i
def primes(x):
ps = set()
while x != 1:
... | p02574 |
from math import sqrt
from collections import Counter
def arrayF(n):
F=[0]*(n+1)
i=2
while i*i<=n:
if F[i] == 0:
k=i*i
while k <= n:
if F[k] == 0:
F[k] = i
k += i
i += 1
return F
def fact... | def arrayF(n):
F=[0]*(n+1)
i=2
while i*i<=n:
if F[i] == 0:
k=i*i
while k <= n:
if F[k] == 0:
F[k] = i
k += i
i += 1
return F
def factorization(x, F):
primeFactors = []
while F[x] >... | p02574 |
from math import gcd
from functools import reduce
from collections import defaultdict
n=int(eval(input()))
a=list(map(int,input().split()))
g=reduce(gcd,a)
if g!=1:
print("not coprime")
exit()
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
... | from math import gcd
from functools import reduce
from collections import defaultdict
n=int(eval(input()))
a=list(map(int,input().split()))
g=reduce(gcd,a)
if g!=1:
print("not coprime")
exit()
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
... | p02574 |
from math import gcd
from functools import reduce
from collections import defaultdict
n=int(eval(input()))
a=list(map(int,input().split()))
g=reduce(gcd,a)
if g!=1:
print("not coprime")
exit()
def isPrimeMR(n):
d = n - 1
d = d // (d & -d)
L = [2]
for a in L:
t = d
... | from math import gcd
from functools import reduce
from collections import defaultdict
n=int(eval(input()))
a=list(map(int,input().split()))
if reduce(gcd,a)!=1:
print("not coprime")
exit()
def primes(x):
ret=[]
for i in range(1,int(x**0.5)+1):
if x%i==0:
ret.append(i)
if x//i!=i... | p02574 |
M=10**6+1
f=lambda p: exit(print(['pairwise','setwise','not'][p]+' coprime'))
n,*l=map(int,open(0).read().split())
from math import *
g=l[0]
for x in l: g=gcd(g,x)
if g>1: f(2)
C=[0]*M
for x in l: C[x]=1
for i in range(2,M):
if sum(C[j] for j in range(i,M,i))>1: f(1)
f(0)
| M=10**6+1
f=lambda p: exit(print(['pairwise','setwise','not'][p]+' coprime'))
n,*l=map(int,open(0).read().split())
from math import *
g,C=0,[0]*M
for x in l:
g=gcd(g,x)
C[x]=1
if g>1: f(2)
if any(sum(C[i::i])>1 for i in range(2,M)): f(1)
f(0)
| p02574 |
M=10**6+1
f=lambda p: exit(print(['pairwise','setwise','not'][p]+' coprime'))
n,*l=map(int,open(0).read().split())
from math import *
g,C=0,[0]*M
for x in l:
g=gcd(g,x)
C[x]=1
if g>1: f(2)
if any(sum(C[i::i])>1 for i in range(2,M)): f(1)
f(0)
| M=10**6+1
f=lambda p: exit(print(['pairwise','setwise','not'][p]+' coprime'))
n=int(input())
l=[*map(int,input().split())]
g=0
from math import *
for x in l:
g=gcd(g,x)
if g>1: f(2)
def sieve(x):
p=[]
s=[0]*x
for i in range(2,x):
if s[i]<1:
p+=[i]
for j in range(i,x,i): s[j]=i
... | p02574 |
import sys
import math
N = int(eval(input()))
A = list(map(int, input().split()))
gcd = A[0]
for i in range(1, N):
gcd = math.gcd(gcd, A[i])
if gcd != 1:
print("not coprime")
sys.exit()
NUM = 10**6
T = [True]*(NUM+1)
prime = []
for i in range(2, NUM+1):
if T[i]:
prime.appe... | import sys
import math
N = int(eval(input()))
A = list(map(int, input().split()))
NUM = 10**6
gcd = A[0]
for i in range(1, N):
gcd = math.gcd(gcd, A[i])
if gcd != 1:
print("not coprime")
sys.exit()
def osa_k(num):
S = list(i for i in range(num+1))
for i in range(2, int(num**0.5)... | p02574 |
n = int(eval(input()))
a = list(map(int, input().split()))
import sys
input = sys.stdin.readline
#iを篩にかけた数をmemo
def sieve_table(n):
table = [0] * (n+1)
for i in range(2, n+1):
if table[i] > 0:
continue
table[i] = i
for j in range(2 * i, n+1, i):
ta... | n = int(eval(input()))
a = list(map(int, input().split()))
import sys
input = sys.stdin.readline
#iを篩にかけた数をmemo
def sieve_table(n):
table = [0] * (n+1)
for i in range(2, n+1):
if table[i] > 0:
continue
table[i] = i
for j in range(2 * i, n+1, i):
ta... | p02574 |
n = int(eval(input()))
a = list(map(int,input().split()))
from math import gcd
g = a[0]
for i in range(n):
g = gcd(g,a[i])
if g!=1:
print('not coprime')
exit()
def prime_factorize(n):
a = set()
while n % 2 == 0:
a.add(2)
n //= 2
f = 3
while f * f <= n:
... | n = int(eval(input()))
a = list(map(int,input().split()))
from math import gcd
g = a[0]
for i in range(n):
g = gcd(g,a[i])
if g!=1:
print('not coprime')
exit()
f = True
l = set()
for i in a:
for j in range(2,int(i**0.5)+1):
if i%j==0:
if i in l:
f... | p02574 |
def gcd(x, y):
while y:
x, y = y, x % y
return x
N = int(eval(input()))
A = list(map(int,input().split()))
primes = [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, 18... | def gcd(x, y):
while y:
x, y = y, x % y
return x
N = int(eval(input()))
A = list(map(int,input().split()))
primes = [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, 18... | p02574 |
def gcd(x, y):
while y:
x, y = y, x % y
return x
N = int(eval(input()))
A = list(map(int,input().split()))
primes = [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, 18... | def gcd(x, y):
while y:
x, y = y, x % y
return x
N = int(eval(input()))
A = list(map(int,input().split()))
primes = [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, 18... | p02574 |
def eratosthenes(N):
is_prime = {i: True for i in range(2, N+1)}
primes = []
for i in range(2, N+1):
if is_prime[i]:
primes.append(i)
if i**2 <= N:
for j in range(i**2, N+1, i):
is_prime[j] = False
return primes
def gcd(a,... | def eratosthenes(N):
is_prime = {i: True for i in range(2, N+1)}
primes = []
for i in range(2, N+1):
if is_prime[i]:
primes.append(i)
if i**2 <= N:
for j in range(i**2, N+1, i):
is_prime[j] = False
return primes
def gcd(a,... | p02574 |
def eratosthenes(N):
is_prime = {i: True for i in range(2, N+1)}
primes = []
for i in range(2, N+1):
if is_prime[i]:
primes.append(i)
if i**2 <= N:
for j in range(i**2, N+1, i):
is_prime[j] = False
return primes
def gcd(a,... | def eratosthenes(N):
is_prime = {i: True for i in range(2, N+1)}
primes = []
for i in range(2, N+1):
if is_prime[i]:
primes.append(i)
if i**2 <= N:
for j in range(i**2, N+1, i):
is_prime[j] = False
return primes
def gcd(a,... | p02574 |
#!/usr/bin/env python3
import collections
import sys
input=sys.stdin.readline
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
def judge(n,arr):
MAX=10**6
table=[i for i in range(MAX+1)]
for i in range(2,MAX+1):
if table[i]<i:
continue
... | import collections
import sys
input=sys.stdin.readline
def divisors(n):
ret=[]
for i in range(2,int(n**0.5)+1):
if n%i==0:
ret.append(i)
while n%i==0:
n//=i
if n!=1:
ret.append(n)
return ret
def gcd(a,b):
if b==0:
return a
else:
return gcd(b,a%b)
n... | p02574 |
'''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecurs... | '''
自宅用PCでの解答
'''
import math
#import numpy as np
import itertools
import queue
import bisect
from collections import deque,defaultdict
import heapq as hpq
from sys import stdin,setrecursionlimit
#from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
ipt = stdin.readline
setrecurs... | p02574 |
def eratosthenes(n):
prime = []
limit = n**0.5
numbers = [i for i in range(2,n+1)]
while True:
p = numbers[0]
if limit <= p:
return prime + numbers
prime.append(p)
numbers = [i for i in numbers if i%p != 0]
return prime
def prime_decomposition... | N = int(eval(input()))
A = list(map(int,input().split()))
def prime_decomposition(n):
i = 2
d = {}
while i * i <= n:
while n % i == 0:
n //= i
if i not in d:
d[i] = 0
d[i] += 1
i += 1
if n > 1:
if n not in d:
d[n] = 1
return d
A.sort()
M = A... | p02574 |
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | p02574 |
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | p02574 |
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | p02574 |
import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | import sys
sys.setrecursionlimit(1 << 25)
readline = sys.stdin.buffer.readline
read = sys.stdin.readline # 文字列読み込む時はこっち
ra = range
enu = enumerate
def exit(*argv, **kwarg):
print(*argv, **kwarg)
sys.exit()
def mina(*argv, sub=1): return list(map(lambda x: x - sub, argv))
# 受け渡されたすべての要素からsubだけ... | p02574 |
from math import gcd
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
cnt += dp[j]
... | from math import gcd
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
setwise = (res == 1)
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
... | p02574 |
from math import gcd
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
setwise = (res == 1)
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
... | from math import gcd
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
setwise = (res == 1)
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
... | p02574 |
from math import gcd
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
res = s[0]
for ss in s:
dp[ss] += 1
res = gcd(res, ss)
A = max(s)
pairwise = True
setwise = (res == 1)
primes = set(range(2, A+1))
for i in range(2, int(A**0.5+1)):
if i ... | n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
for ss in s:
dp[ss] += 1
A = max(s)
pairwise = True
setwise = True
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
cnt += dp[j]
if cnt > 1:
pairwise = False... | p02574 |
n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
dp = [0] * ((10 ** 6) + 100)
for ss in s:
dp[ss] += 1
A = max(s)
pairwise = True
setwise = True
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
cnt += dp[j]
if cnt > 1:
pairwise = False... | n = int(eval(input()))
s = list(map(int, input().split()))
s.sort()
A = max(s)
dp = [0] * (A + 5)
for ss in s:
dp[ss] += 1
pairwise = True
setwise = True
for i in range(2, A + 1):
cnt = 0
for j in range(i, A + 1, i):
cnt += dp[j]
if cnt > 1:
pairwise = False
if... | p02574 |
import sys
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(map(int, readline().split()))
D = [False] * (10 ** 6 + 1)
D[1] = True
pairwise = True
setwise = s... | import sys
from functools import reduce
from math import gcd
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(map(int, readline().split()))
used = [False] * (max(A) + 1)
... | p02574 |
import sys
from functools import reduce
from math import gcd
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(map(int, readline().split()))
pairwise = True
used ... | import sys
from functools import reduce
from math import gcd
read = sys.stdin.read
readline = sys.stdin.buffer.readline
sys.setrecursionlimit(10 ** 8)
INF = float('inf')
MOD = 10 ** 9 + 7
def main():
N = int(readline())
A = list(map(int, readline().split()))
pairwise = True
used = [F... | p02574 |
from math import gcd
N = int(eval(input()))
A = [int(i) for i in input().split()]
st=set()
pn = [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... | N = int(eval(input()))
A = [int(i) for i in input().split()]
maxA=max(A)
pn=list(range(maxA+1))
n=2
while n*n <= maxA:
if n == pn[n]:
for m in range(n, len(pn), n):
if pn[m] == m:
pn[m] = n
n+=1
s=set()
for a in A:
st = set()
while a > 1:
st.add(pn[a])
a//=pn[a]
if... | p02574 |
import math, collections
n = int(eval(input()))
a = list(map(int, input().split()))
def prime(n):
p = []
flag = [True] * (n - 1)
for i in range(n - 1):
if flag[i] == True:
p.append(i + 2)
num = i
while num <= n - 2:
flag[num] = False... | import math, sys
input = sys.stdin.readline
n = int(eval(input()))
a = list(map(int, input().split()))
def prime(n):
p = []
min_p = [0 for i in range(n - 1)]
flag = [True] * (n - 1)
for i in range(n - 1):
if flag[i] == True:
p.append(i + 2)
num = i
... | p02574 |
MOD=10**9+7
import sys
import math
import random
N=int(eval(input()))
alist=list(map(int,input().split()))
#alist.sort()
random.shuffle(alist)
all_GCD=alist[0]
for i in range(1,N):
all_GCD=math.gcd(all_GCD,alist[i])
if all_GCD==1:
break
else:
print("not coprime")
sys.exit(0)
lcm=1
pro... | import sys
import math
N=int(eval(input()))
alist=list(map(int,input().split()))
all_GCD=alist[0]
for i in range(1,N):
all_GCD=math.gcd(all_GCD,alist[i])
if all_GCD==1:
break
else:
print("not coprime")
sys.exit(0)
max_a=max(alist)
dlist=[i for i in range(max_a+1)]
for i in range(2,int(ma... | p02574 |
import math
N = int(eval(input()))
A = list(map(int, input().split()))
is_prime = [1] * 1000001
D = [0] * 1000001
for i in range(2, 1001):
if is_prime[i]:
D[i] = i
j = 2 * i
while j <= 1000000:
if is_prime[j]:
D[j] = i
is_prime[j]... | import math
N = int(eval(input()))
A = list(map(int, input().split()))
g = 0
for a in A:
g = math.gcd(g, a)
if g != 1:
print('not coprime')
exit()
is_prime = [1] * 1000001
D = [0] * 1000001
for i in range(2, 1001):
if is_prime[i]:
D[i] = i
j = 2 * i
while j... | p02574 |
#!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve(N, AS):
num_division = 0
maxAS = max(AS)
eratree = [0] * (maxAS + 10)
for p in range(2, maxAS + 1):
... | #!/usr/bin/env python3
import sys
sys.setrecursionlimit(10**6)
INF = 10 ** 9 + 1 # sys.maxsize # float("inf")
MOD = 10 ** 9 + 7
def debug(*x):
print(*x, file=sys.stderr)
def solve(N, AS):
num_division = 0
maxAS = max(AS)
eratree = [0] * (maxAS + 10)
for p in range(2, maxAS + 1):
... | p02574 |
from functools import reduce
from math import gcd
def primes(n):
is_prime = [i % 2 != 0 and i % 3 != 0 and i % 5 != 0 and i % 7 != 0 for i in range(n + 1)]
is_prime[1] = False
is_prime[2] = is_prime[3] = is_prime[5] = is_prime[7] = True
for p in range(3, int(n**0.5) + 1, 2):
if not is... | from math import gcd
def main():
n = int(eval(input()))
a = [int(i) for i in input().split()]
m = max(a)
p = [i for i in range(m + 1)]
for i in range(3, m + 1):
for j in range(2, int(i**.5 + 1) + 1):
if i % j == 0:
p[i] = j
break
... | p02574 |
from math import gcd
def main():
n = int(eval(input()))
a = [int(i) for i in input().split()]
m = max(a)
p = [i for i in range(m + 1)]
for i in range(3, m + 1):
for j in range(2, int(i**.5 + 1) + 1):
if i % j == 0:
p[i] = j
break
... | from math import gcd
def main():
n = int(eval(input()))
a = [int(i) for i in input().split()]
m = max(a)
p = [0] * (m + 1)
for i in range(2, m + 1):
if p[i] == 0:
for j in range(i, m + 1, i):
p[j] = i
factors = set()
for ai in a:
if... | p02574 |
N=int(eval(input()))
A=list(map(int,input().split()))
import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
def sieve_of_eratosthenes(n):
candidate = [i for i in range(2, n+1)]
prime = []
limit = math.sqrt(n) + 1
while True:
p = ... | import math
from functools import reduce
def gcd_list(numbers):
return reduce(math.gcd, numbers)
N=int(eval(input()))
A=list(map(int,input().split()))
mA = max(A)
D = [-1]*(mA+1)
D[0]=1
D[1]=1
for i in range(2,mA+1):
if D[i] != -1: continue
D[i] = i
cnt = 2*i
while cnt < mA+1:
if D[cnt]... | p02574 |
from math import gcd
def eratosthenes(n):
prime = []
data = [i + 1 for i in range(1, n)]
while True:
p = data[0]
if n <= p ** 2:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
return data
def factorize(N): # 素因数分... | from math import gcd
def eratosthenes(n):
prime = []
data = [i for i in range(2, n + 1)]
while True:
p = data[0]
if n <= p ** 2:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
return data
def factorize(N): # 素因数分... | p02574 |
from math import gcd
def eratosthenes(n):
prime = []
data = [i for i in range(2, n + 1)]
while True:
p = data[0]
if n <= p ** 2:
return prime + data
prime.append(p)
data = [e for e in data if e % p != 0]
return data
def factorize(N): # 素因数分... | from math import gcd
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] = False
return [i for i in... | p02574 |
from math import gcd
from functools import reduce
N = int(eval(input()))
*A, = list(map(int, input().split()))
def lcm(a, b):
return a*b//gcd(a,b)
g = 1
for a in A:
if lcm(g, a) == g * a:
g *= a
else:
if reduce(gcd, A) == 1:
print("setwise coprime")
else:... | from math import gcd
from functools import reduce
N = int(eval(input()))
*A, = list(map(int, input().split()))
MAX_N = max(A)+5
primes = list(range(MAX_N+1))
for i in range(2, int(MAX_N**0.5)+1):
if primes[i] < i:
continue
for j in range(2*i, MAX_N+1, i):
primes[j] = i
def check... | p02574 |
# E - Coprime
import math
from functools import reduce
from itertools import chain
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
assert len(a) == n
if reduce(math.gcd, a) > 1:
print("not coprime")
exit()
def primes_under(n):
plist = []
is... | # E - Coprime
import math
from functools import reduce
n = int(eval(input()))
a = list(map(int, input().split()))
assert len(a) == n
if reduce(math.gcd, a) > 1:
print("not coprime")
exit()
def factors(n):
"""Return the list of prime factors of n."""
fac = set()
sqrtn = math.sqrt(... | p02574 |
N=int(eval(input()))
A=list(map(int,input().split()))
A_max=max(A)
D=[0] *(A_max+1) #xを割り切る最小の素数を格納
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
for i in range(2,A_max+1):
for j in ra... | import sys
N=int(eval(input()))
A = list(map(int,input().split()))
import math
from functools import reduce
def gcd(*numbers):
return reduce(math.gcd, numbers)
def gcd_list(numbers):
return reduce(math.gcd, numbers)
if gcd_list(A) > 1:
print("not coprime")
sys.exit()
D = [i for ... | p02574 |
N = int(eval(input()))
A = list(map(int, input().split()))
def get_prime(p):
result = []
if p==1:
return result
else:
integers = [1 for _ in range(p+1)]
integers[0] = 0
integers[1] = 0
for i in range(p+1):
if integers[i] == 1:
result.append(i)
for j in rang... | N = int(eval(input()))
A = list(map(int, input().split()))
def get_count(p):
integers = [1 for _ in range(p+1)]
integers[0] = 0
integers[1] = 0
counts = [0 for _ in range(p+1)]
for a in A:
counts[a] += 1
answer = 0
for i in range(p+1):
if integers[i] >= 1:
count = 0
for ... | p02574 |
N = int(eval(input()))
M = 10**6 + 1
counts = [0 for _ in range(M)]
for a in map(int, input().split()):
counts[a] += 1
max_count = 0
for i in range(2,M):
count = 0
for j in range(i,M,i):
count += counts[j]
max_count = max(max_count,count)
if max_count == N:
answer = 'not coprime'
elif m... | N = int(eval(input()))
M = 10**6 + 1
counts = [0 for _ in range(M)]
for a in map(int, input().split()):
counts[a] += 1
max_count = 0
for i in range(2,M):
max_count = max(max_count,sum(counts[i::i]))
if max_count == N:
answer = 'not coprime'
elif max_count >= 2:
answer = 'setwise coprime'
else:... | p02574 |
import sys
input = sys.stdin.readline
from math import gcd
from functools import reduce
from collections import Counter
import heapq
def read():
N = int(input().strip())
A = list(map(int, input().strip().split()))
return N, A
def sieve(n):
"""
n以下の素数を昇順に列挙する
"""
prime_d... | import sys
input = sys.stdin.readline
from math import gcd
from functools import reduce
from collections import defaultdict
def read():
N = int(input().strip())
A = list(map(int, input().strip().split()))
return N, A
def is_pairwise_coprime(A):
n = max(A)
base = [False for i in ra... | p02574 |
#dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(eval(input())),lambda :[int(w) for w in input().split()]
#from fractions import gcd
def gcd(a, b):
if a == 0: return b
if b == 0: return a
k = 0
while ((a | b) & 1) == 0:
a >>= ... | #dt = {} for i in x: dt[i] = dt.get(i,0)+1
import sys;input = sys.stdin.readline
inp,ip = lambda :int(eval(input())),lambda :[int(w) for w in input().split()]
#from fractions import gcd
def gcd(a, b):
if a == 0: return b
if b == 0: return a
k = 0
while ((a | b) & 1) == 0:
a >>= ... | p02574 |
def make_divisors(n):
lower_divisors , upper_divisors = [], []
i = 1
while i*i <= n:
if n % i == 0:
lower_divisors.append(i)
if i != n // i:
upper_divisors.append(n//i)
i += 1
return lower_divisors + upper_divisors[::-1]
n = int(eval(in... | from math import gcd
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... | p02574 |
primeset = {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, 33... | def gcd(n,m):
while n:
m,n = n,m%n
return m
N = int(eval(input()))
A = list(map(int,input().split()))
maxA = max(A)
B = [0]*(maxA+1)
for i in range(2,maxA+1):
if B[i] == 0:
B[i] = i
for j in range(2*i,maxA+1,i):
B[j] = i
soinsu = set()
a,b = 0,0
def... | p02574 |
import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import accumulate, permutations, combinations, product, groupby, combinations_with_replacement
from operator import itemgetter, mul
from copy import deepcopy
... | p02574 |
from collections import defaultdict
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:
... | from collections import defaultdict
import sys
input = sys.stdin.readline
N = int(eval(input()))
A = list(map(int, input().split()))
# 素因数分解、リストで返す
#############################################################
def prime_factorize(n):
a = []
while n % 2 == 0:
a.append(2)
n //= 2
... | p02574 |
n = int(eval(input()))
a = list(map(int,input().split()))
r = max(a)+1
s = []
t = [0]*r
for i in range(r):
s.append([])
for i in range(2,r):
for j in range(1,-(-r//i)):
s[i*j].append(i)
for i in range(n):
for j in range(len(s[a[i]])):
t[s[a[i]][j]] += 1
if(max(t) == n):
pri... | n = int(eval(input()))
a = list(map(int,input().split()))
r = max(a)+1
s = []
t = [0]*r
for i in range(r):
s.append([])
for i in range(2,r):
if(s[i] == []):
for j in range(1,-(-r//i)):
s[i*j].append(i)
for i in range(n):
for j in range(len(s[a[i]])):
t[s[a[i]][j]] +=... | p02574 |
def gcd(a, b):
if (b == 0):
return a
else:
return gcd(b, a % b)
def divisor(n):
l = []
i = 1
while True:
if n % i == 0:
l.append(i)
if i * i != n:
l.append(n / i)
i += 1
if i * i >= n:
brea... | def gcd(a, b):
if (b == 0):
return a
else:
return gcd(b, a % b)
def divisor(n):
l = []
i = 1
while True:
if n % i == 0:
l.append(i)
if i * i != n:
l.append(n / i)
i += 1
if i * i > n:
break... | p02574 |
import math
def divisorGenerator(n):
large_divisors = []
for i in range(1, int(math.sqrt(n) + 1)):
if n % i == 0:
yield i
if i*i != n:
large_divisors.append(n // i)
for divisor in reversed(large_divisors):
yield divisor
if __name__ == '__... | import math
def divisorGenerator(n):
large_divisors = []
for i in range(1, int(math.sqrt(n) + 1)):
if n % i == 0:
yield i
if i*i != n:
large_divisors.append(n // i)
for divisor in reversed(large_divisors):
yield divisor
if __name__ ==... | p02574 |
def primes(n):
is_prime = [True] * (n + 1)
is_prime[0] = False
is_prime[1] = False
for i in range(2, int(n**0.5) + 1):
if not is_prime[i]:
continue
for j in range(i * 2, n + 1, i):
is_prime[j] = False
return {i:0 for i in range(n + 1) if is_prime[i]}
... | def primes(n):
is_prime = [-1] * (n + 1)
is_prime[0] = 0
is_prime[1] = 1
for i in range(2, n + 1):
if is_prime[i] != -1:
continue
for j in range(i, n + 1, i):
if is_prime[j] == -1:
is_prime[j] = i
return is_prime
n = int(eval(input... | p02574 |
import math
#素数列挙
def get_primes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(prime)
A = [i for i in A if i%prime!... |
import math
#素数列挙
def get_primes(limit):
A = [i for i in range(2, limit+1)]
P = []
time = 0
while True:
prime = min(A)
if prime > math.sqrt(limit):
break
P.append(prime)
A = [i for i in A if i%prime!=0]
... | p02574 |
def main():
from math import gcd
MINFact = [-1] * (10**6 + 10)
MINFact[0] = 0
MINFact[1] = 1
def Eratosthenes(sup: int) -> set:
primes = [True for i in range(sup+1)]
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if primes[i]:
... | def main():
from math import gcd
_ = int(eval(input()))
A = [int(i) for i in input().split()]
class osa_k:
def __init__(self, sup):
if sup > 2 * 10**8:
raise RuntimeError("too big")
self.MINFact = [-1] * (sup + 1)
self.MINFact[0] = 0... | p02574 |
def main():
from math import gcd
_ = int(eval(input()))
A = [int(i) for i in input().split()]
maxA = max(A)
def Eratosthenes(sup: int) -> set:
primes = [True]*(sup+1)
primes[0] = False
primes[1] = False
for i in range(2, sup+1):
if primes[i]:
... | def main():
from math import gcd
_ = int(eval(input()))
A = [int(i) for i in input().split()]
def prime_factorize(n):
for i in range(2, n+1):
if i*i > n:
break
if n % i != 0:
continue
while n % i == 0:
... | p02574 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.