input stringlengths 20 127k | target stringlengths 20 119k | problem_id stringlengths 6 6 |
|---|---|---|
_ = eval(input())
seq = list(map(int,input().split()))
seq1 = seq[::2]
seq2 = seq[1::2]
if len(set(seq)) == 1:
print((min(len(seq1),len(seq2))))
exit()
def count_dictonary(seq):
ret_dict={}
for item in seq:
if item not in ret_dict:
ret_dict[item] = 1
e... | _ = eval(input())
seq = list(map(int,input().split()))
seq1 = seq[::2]
seq2 = seq[1::2]
if len(set(seq)) == 1:
print((len(seq2)))
exit()
def count_dictonary(seq):
ret_dict={}
for item in seq:
if item not in ret_dict:
ret_dict[item] = 1
else:
... | p03244 |
_ = eval(input())
seq = list(map(int,input().split()))
seq1 = seq[::2]
seq2 = seq[1::2]
if len(set(seq)) == 1:
print((len(seq2)))
exit()
def count_dictonary(seq):
ret_dict={}
for item in seq:
if item not in ret_dict:
ret_dict[item] = 1
else:
... | def count_char_occurrence(seq):
# count how many times characters occur and return results as a dictionary
ret = {}
for char in seq:
if char in ret:
ret[char] += 1
else:
ret[char] = 1
return ret
def accum_char_frequency(seq):
"""
accumulate ... | p03244 |
# coding: utf-8
# hello worldと表示する
#dpでできないかな？
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_left,bisect_right... | # coding: utf-8
# hello worldと表示する
#float型を許すな
#numpyはpythonで
import sys
input = sys.stdin.readline
sys.setrecursionlimit(10**7)
from collections import Counter, deque
from collections import defaultdict
from itertools import combinations, permutations, accumulate, groupby, product
from bisect import bisect_l... | p03244 |
import collections
n = int(eval(input()))
odd = []
even = []
for i, j in enumerate(map(int, input().split())):
if i % 2 == 0:
even += [j]
else:
odd += [j]
odd = sorted(list(collections.Counter(odd).items()), reverse=True, key=lambda x: x[1])
even = sorted(list(collections.Counter(eve... | import collections
n = int(eval(input()))
odd = []
even = []
for i,j in enumerate(map(int,input().split())):
if i % 2 == 0:
even += [j]
else:
odd += [j]
odd = sorted(list(collections.Counter(odd).items()),key=lambda x:(x[1]),reverse=True)
even = sorted(list(collections.Counter(even... | p03244 |
def main():
from collections import Counter
n = int(eval(input()))
V = list(map(int,input().split()))
odds = []
evens = []
for i,v in enumerate(V):
if i & 1:
evens.append(v)
else:
odds.append(v)
odds_counter = list(Counter(odds).items(... | def main():
from collections import Counter
n = int(eval(input()))
V = list(map(int,input().split()))
odds = []
evens = []
for i,v in enumerate(V):
if i & 1:
evens.append(v)
else:
odds.append(v)
odds_modes= Counter(odds).most_common(2)... | p03244 |
n = int(eval(input()))
v = list(map(int, input().split()))
v1 = v[0::2]
v2 = v[1::2]
m1, m2 = {}, {}
for vi in v1:
if vi in m1:
m1[vi] += 1
else:
m1[vi] = 1
for vi in v2:
c = m2[vi] if vi in m2 else 0
m2[vi] = c + 1
p1 = [(k, m1[k]) for k in list(m1.keys())]
p2 = [(k,... | n = int(eval(input()))
v = list(map(int, input().split()))
va = v[0::2]
vb = v[1::2]
ma, mb = {None: 0}, {None: 0}
for vi in va:
c = ma[vi] if vi in ma else 0
ma[vi] = c + 1
for vi in vb:
c = mb[vi] if vi in mb else 0
mb[vi] = c + 1
# items() is [(k, m[k]) for k in m.keys()]
pa = list(... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
odd = v[::2]
even = v[1::2]
c_even = Counter(even).most_common(2)
c_odd = Counter(odd).most_common(2)
if(c_even[0][0] != c_odd[0][0]):
print((n - c_even[0][1] - c_odd[0][1]))
else:
if(len(c_e... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
odd = v[::2]
even = v[1::2]
c_even = Counter(even).most_common(2)
c_odd = Counter(odd).most_common(2)
if(c_even[0][0] != c_odd[0][0]):
print((n - c_even[0][1] - c_odd[0][1]))
else:
if(len(c_e... | p03244 |
# ABC111C - /\/\/\/
from collections import Counter
def main():
N, *V = list(map(int, open(0).read().split()))
even, odd = Counter(V[::2]).most_common(2), Counter(V[1::2]).most_common(2)
if even[0][0] != odd[0][0]: # replace except the modes of both parities
ans = N - even[0][1] - odd[0][... | # ABC111C - /\/\/\/
from collections import Counter
def main():
N, *V = open(0).read().split()
N = int(N)
even, odd = Counter(V[::2]).most_common(2), Counter(V[1::2]).most_common(2)
if even[0][0] != odd[0][0]: # replace except the modes of both parities
ans = N - even[0][1] - odd[0][... | p03244 |
def main():
n = int(eval(input()))
v = input_list()
evens = []
odds = []
vs = v[:]
kind = len(set(vs))
if kind == 1:
print((n//2))
exit(0)
for i, vv in enumerate(v):
if i % 2 == 0:
evens.append(vv)
else:
odds.append(vv)
ec = collections.Counter(evens)
... | import math
import fractions
from functools import reduce
def main():
n = int(eval(input()))
a = input_list()
if len(set(a)) == 1:
print((n//2))
exit(0)
evens = {}
odds = {}
for i, v in enumerate(a):
if i % 2 == 0:
if v in evens:
... | p03244 |
import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
a = []
b = []
for i in range(N):
if i & 1:
a.append(V[i])
else:
b.append(V[i])
ac = Counte... | import sys
input = sys.stdin.readline
from collections import Counter
def main():
N = int(eval(input()))
V = [int(x) for x in input().split()]
ac = Counter()
bc = Counter()
for i in range(N):
if i & 1:
ac[V[i]] += 1
else:
bc[V[i]] += 1
... | p03244 |
from collections import Counter
n = int(eval(input()))
li = list(map(int,input().split()))
a = [l for i,l in enumerate(li) if i % 2 == 0]
b = [l for i,l in enumerate(li) if i % 2 == 1]
se_a = list(set(a))
se_b = list(set(b))
all_lis = []
for aa in se_a:
tmp_cnt = len(a) - Counter(a)[aa]
#print(tmp_c... | from collections import Counter
n = int(eval(input()))
li = list(map(int,input().split()))
a = [l for i,l in enumerate(li) if i % 2 == 0]
b = [l for i,l in enumerate(li) if i % 2 == 1]
se_a = list(set(a))
se_b = list(set(b))
if Counter(a).most_common()[0][0] != Counter(b).most_common()[0][0]:
a_change = len... | p03244 |
n = int(eval(input()))
l = list(map(int, input().split()))
a = []
b = []
ca = []
cb = []
for i in range(n // 2):
a.append(l[i * 2])
b.append(l[i * 2 + 1])
while (len(a) > 0):
ca.append([a[0], a.count(a[0])])
a = [s for s in a if not(s == a[0])]
while (len(b) > 0):
cb.append([b[0], b.cou... | n = int(eval(input()))
l = list(map(int, input().split()))
a = {}
b = {}
for i in range(n // 2):
key_a = l[i * 2]
key_b = l[i * 2 + 1]
if key_a in a:
a[key_a] = a[key_a] + 1
else:
a[l[i * 2]] = 1
if key_b in b:
b[key_b] = b[key_b] + 1
else:
b[key_b] ... | p03244 |
n = int(eval(input()))
l = list(map(int, input().split()))
a = {}
b = {}
for i in range(n // 2):
key_a = l[i * 2]
key_b = l[i * 2 + 1]
if key_a in a:
a[key_a] = a[key_a] + 1
else:
a[l[i * 2]] = 1
if key_b in b:
b[key_b] = b[key_b] + 1
else:
b[key_b] ... | n = int(eval(input()))
l = list(map(int, input().split()))
a = {}
b = {}
for i in range(n // 2):
key_a = l[i * 2]
key_b = l[i * 2 + 1]
if key_a in a:
a[key_a] = a[key_a] + 1
else:
a[l[i * 2]] = 1
if key_b in b:
b[key_b] = b[key_b] + 1
else:
b[key_b] ... | p03244 |
n = int(eval(input()))
V = list(map(int, input().split()))
A = V[::2]
B = V[1::2]
set_A = set(A)
set_B = set(B)
max_a = 0
max_b = 0
for a in set_A:
cnt_a = A.count(a)
max_a = max(max_a, cnt_a)
for b in set_B:
cnt_b = B.count(b)
max_b = max(max_b, cnt_b)
ans = (len(A) - max_a) + (len(B) - max_b)
... | n = int(eval(input()))
V = list(map(int, input().split()))
A = {}
B = {}
for i in range(n):
if i % 2 == 0:#A
A[V[i]] = A.get(V[i], 0) + 1
else:#B
B[V[i]] = B.get(V[i], 0) + 1
A = sorted(list(A.items()), key=lambda x:x[1], reverse=True)
B = sorted(list(B.items()), key=lambda x:x[1], reverse=True)... | p03244 |
n = int(eval(input()))
l = list(input().split())
ll,lr = l[::2],l[1::2]
dl,dr = {},{}
for i in ll: dl[i] = dl.get(i,0)+1
for j in lr: dr[j] = dr.get(j,0)+1
ltl = sorted(list(dl.items()),key=lambda k:-k[1])
ltr = sorted(list(dr.items()),key=lambda k:-k[1])
if ltl[0][0] != ltr[0][0]:
print((n-ltl[0][1]-ltr[0][... | n = int(eval(input()))
v = list(input().split())
def f(b):
h = v[b::2]
d = {0:0}
for i in h: d[i] = d.get(i,0)+1
return sorted(list(d.items()),key=lambda k:-k[1])
l,r = f(0),f(1)
print((n-l[0][1]-[r[0][1],max(l[1][1],r[1][1])][l[0][0] == r[0][0]])) | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
gu = v[::2]
ki = v[1::2]
ans = 0
k,g = False,False
if v.count(v[0]) == n:#全部同じ
ans += n // 2
else:
kic = Counter(ki)
guc = Counter(gu)
k1 = kic.most_common(2)
g1 = guc.most_common(2)
if k1[... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
gu = v[::2]
ki = v[1::2]
ans = 0
k,g = False,False
###全部同じなら全長の半分,
# 最頻値が同じなら2番目を比べる
if v.count(v[0]) == n:
ans += n // 2
else:
kic = Counter(ki)
guc = Counter(gu)
k1 = kic.most_common(2)
g1 =... | p03244 |
import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
vvv = na()
d = {}
for i in range(n):
if vvv[i] not in list(d.keys()):
d[vvv[i]] = 1
else:
d[vvv[i]... | import sys
stdin = sys.stdin
ni = lambda: int(ns())
na = lambda: list(map(int, stdin.readline().split()))
ns = lambda: stdin.readline().rstrip() # ignore trailing spaces
n = ni()
vvv = na()
even = vvv[::2]
odd = vvv[1::2]
d_even = {}
d_odd = {}
for i in range(n//2):
if even[i] not in list(d_even.... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int ,input().split()))
o = Counter(v[::2]).most_common() # 偶数列の最頻値の順に並べる
e = Counter(v[1::2]).most_common() # 奇数列の最頻値の順に並べる
if o[0][0] == e[0][0]: # 最頻値が偶数列と奇数列で同じかどうか判定
if len(o) == 1: print((n//2)) # 値のバリエーションが最頻値のみの場合は片方の数列を書き換えて終わり
e... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
o = Counter(v[::2]).most_common()
e = Counter(v[1::2]).most_common()
if o[0][0] == e[0][0]:
if len(o) == 1: print((e[0][1]))
else:
o1,o2 = e[0][1], e[1][1]
e1,e2 = o[0][1], o[1][1]
ans = min(n-o1-o... | p03244 |
from collections import Counter
n = int(eval(input()))
lis = list(map(int, input().split()))
a = Counter(lis[::2])
b = Counter(lis[1::2])
aa = sorted(list(a.items()), key=lambda x:x[1], reverse=True)
bb = sorted(list(b.items()), key=lambda x:x[1], reverse=True)
if aa[0][0] == bb[0][0]:
if len(aa) > 1 ... | from collections import Counter
n = int(eval(input()))
lis = list(map(int, input().split()))
a = Counter(lis[::2])
b = Counter(lis[1::2])
aa = sorted(list(a.items()), key=lambda x:x[1], reverse=True)
bb = sorted(list(b.items()), key=lambda x:x[1], reverse=True)
aa.append((0, 0))
bb.append((0, 0))
if aa... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[0::2]
v2 = v[1::2]
count1 = Counter(v1)
count2 = Counter(v2)
count1[0] = 0
MAX = 0
for i in list(count1.keys()):
for j in list(count2.keys()):
if i != j and MAX < count1[i] + count2[j]:
M... | from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[0::2]
v2 = v[1::2]
count1 = Counter(v1)
count2 = Counter(v2)
count1[0] = 0
count2[0] = 0
items1 = []
items2 = []
key1 = max(list(count1.keys()), key = count1.get)
items1.append([key1, count1[key1]])
del count1[... | p03244 |
#!/usr/bin/env python3
#ABC111 C
import sys
import math
import bisect
sys.setrecursionlimit(1000000000)
from heapq import heappush, heappop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from collections import deque
from operator import itemgetter
fro... | #!/usr/bin/env python3
import sys
import math
from bisect import bisect_right as br
from bisect import bisect_left as bl
sys.setrecursionlimit(2147483647)
from heapq import heappush, heappop,heappushpop
from collections import defaultdict
from itertools import accumulate
from collections import Counter
from... | p03244 |
from collections import defaultdict
ODD = defaultdict(int)
EVEN = defaultdict(int)
ALL = set([])
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(N):
ALL.add(A[i])
if i%2 == 0:
EVEN[A[i]] += 1
else:
ODD[A[i]] += 1
if len(ALL) == 1:
ans = N//2
print(ans)
exit(... | from collections import defaultdict
ODD = defaultdict(int)
EVEN = defaultdict(int)
ALL = set([])
N = int(eval(input()))
A = list(map(int,input().split()))
for i in range(N):
ALL.add(A[i])
if i%2 == 0:
EVEN[A[i]] += 1
else:
ODD[A[i]] += 1
if len(ALL) == 1:
ans = N//2
print(ans)
exit(... | p03244 |
from collections import defaultdict
n = int(eval(input()))
v = [int(x) for x in input().split()]
even_ocr = defaultdict(int) # v[0], v[2], ..., で各数が何回現れるか
odd_ocr = defaultdict(int) # v[1], v[3], ..., で各数が何回現れるか
for i in range(n // 2):
even_ocr[v[2 * i]] += 1
odd_ocr[v[2 * i + 1]] += 1
even_max_n... | from collections import defaultdict, Counter
n = int(eval(input()))
v = [int(x) for x in input().split()]
cnt_even = Counter(v[0::2])
cnt_odd = Counter(v[1::2])
# [(要素, 出現回数), (要素, 出現回数), ....]
common_even = cnt_even.most_common()
common_odd = cnt_odd.most_common()
if len(common_even) == 1: # 1種類の数しかない
... | p03244 |
#!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(n: int, v: "List[int]"):
e = [(len(v[0::2]) - vv, k, 0) for k, vv in list(Counter(v[0:... | #!/usr/bin/env python3
import sys
from math import *
from itertools import *
from collections import *
from functools import *
try:
from math import gcd
except Exception:
from fractions import gcd
def solve(n: int, v: "List[int]"):
e = v[0::2]
o = v[1::2]
ec = sorted([(vv, k) for ... | p03244 |
# -*- coding: utf-8 -*-
import collections
def search_b(a_char, a_count, b_most_common, fixed_count):
thres = fixed_count - a_count
for (b_char, b_count) in [b for b in b_most_common if b[1] > thres]:
if a_char != b_char:
return a_count + b_count
return fixed_count
def search(a_most_co... | # -*- coding: utf-8 -*-
import collections
def search_b(a_char, a_count, b_most_common, fixed_count):
thres = fixed_count - a_count
for (b_char, b_count) in [b for b in b_most_common if b[1] > thres]:
if a_char != b_char:
return a_count + b_count
return fixed_count
def search(a_most_co... | p03244 |
n = int(eval(input()))
v = list(map(int,input().split()))
b = []
c = []
for i, vv in enumerate(v):
if i%2 == 0:
b.append(vv)
else:
c.append(vv)
b_set = []
c_set = []
for bb in set(b):
b_set.append((b.count(bb), bb))
for cc in set(c):
c_set.append((c.count(cc), cc))
... | n = int(eval(input()))
v = list(map(int,input().split()))
b = []
c = []
for i, vv in enumerate(v):
if i%2 == 0:
b.append(vv)
else:
c.append(vv)
b_set = {}
c_set = {}
for bb in b:
if not bb in list(b_set.keys()):
b_set[bb] = 1
else:
b_set[bb] += 1
f... | p03244 |
from collections import Counter
n, *v = list(map(int, open(0).read().split()))
vo = Counter(v[::2])
ve = Counter(v[1::2])
vo_mc = vo.most_common()[0]
ve_mc = ve.most_common()[0]
if vo_mc[0] == ve_mc[0]:
if vo_mc[1] > ve_mc[1]:
ans = n//2 - vo_mc[1]
if ve_mc[1] != n//2:
ans +=... | from collections import Counter
n, *v = list(map(int, open(0).read().split()))
vo = Counter(v[::2])
ve = Counter(v[1::2])
vo_mc = vo.most_common()[0]
ve_mc = ve.most_common()[0]
if vo_mc[0] == ve_mc[0]:
ans = n
if ve_mc[1] != n//2:
ans = min(n//2 - vo_mc[1] + n//2 - ve.most_common()[1][1], an... | p03244 |
# 2019-11-10 17:11:42(JST)
import sys
import collections
# import math
# from string import ascii_lowercase, ascii_uppercase, digits
# from bisect import bisect_left as bi_l, bisect_right as bi_r
# import itertools
# from functools import reduce
import operator as op
# from scipy.misc import comb # float
# im... | import sys
from collections import Counter
n, *v = list(map(int, sys.stdin.read().split()))
def main():
c1 = sorted(list(Counter(v[::2]).items()), reverse=True, key=lambda x: x[1])
c2 = sorted(list(Counter(v[1::2]).items()), reverse=True, key=lambda x: x[1])
if c1[0][0] != c2[0][0]:
... | p03244 |
import collections
N = int(eval(input()))
v = list(map(int, input().split()))
if len(set(v)) == 1:
print((int(len(v)/2)))
exit()
ov = [v[i] for i in range(1,len(v),2)]
ev = [v[i] for i in range(0, len(v), 2)]
cov = collections.Counter(ov)
cev = collections.Counter(ev)
mov = cov.most_common()[0][0]
mev ... | import collections
N = int(eval(input()))
v = list(map(int, input().split()))
if len(set(v)) == 1:
print((int(len(v)/2)))
exit()
cov = collections.Counter(v[1::2])
cev = collections.Counter(v[::2])
mov = cov.most_common()[0][0]
mev = cev.most_common()[0][0]
ans = len(v) - cov[mov] - cev[mev]
if mov == ... | p03244 |
from collections import Counter
from collections import deque
if __name__ == '__main__':
n = int(eval(input()))
vs0 = []
vs1 = []
for i,v in enumerate(map(int, input().split())):
if i % 2 == 0:
vs0.append(v)
else:
vs1.append(v)
vs0 = deque(sorted(... | from collections import Counter
if __name__ == '__main__':
n = int(eval(input()))
vs = [int(s) for s in input().split()]
counter0 = list(Counter(vs[0::2]).items()) + [(100001, 0)]
counter1 = list(Counter(vs[1::2]).items()) + [(100001, 0)]
v0, c0 = max(counter0, key=lambda t: t[1])
v1, c... | p03244 |
n = int(eval(input()))
V = list(map(int,input().split()))
a = [0]*10000000
b = [0]*10000000
v1=[]
v2=[]
if len(set(V)) == 1:
print((n//2))
else:
for i in range(n):
if i%2 == 0:
a[V[i]-1] += 1
v1.append(V[i])
else:
b[V[i]-1] += 1
... | n = int(eval(input()))
V = list(map(int,input().split()))
a = [0]*100000
b = [0]*100000
v1=[]
v2=[]
if len(set(V)) == 1:
print((n//2))
else:
for i in range(n):
if i%2 == 0:
a[V[i]-1] += 1
v1.append(V[i])
else:
b[V[i]-1] += 1
v2.a... | p03244 |
n = int(eval(input()))
V = list(map(int,input().split()))
a = [0]*100000
b = [0]*100000
v1=[]
v2=[]
if len(set(V)) == 1:
print((n//2))
else:
for i in range(n):
if i%2 == 0:
a[V[i]-1] += 1
v1.append(V[i])
else:
b[V[i]-1] += 1
v2.a... | from collections import Counter
N = int(eval(input()))
V = list(map(int,input().split()))
zero = Counter(V[::2]).most_common()
one = Counter(V[1::2]).most_common()
if zero[0][0] != one[0][0]:
print((N-zero[0][1]-one[0][1]))
else:
if len(zero) == 1 and len(one) == 1:
print((N//2))
elif len(... | p03244 |
import collections
n = int(eval(input()))
v = list(map(int, input().split()))
v_odd = []
v_even = []
for i, v in enumerate(v):
if i % 2:
v_even.append(v)
else:
v_odd.append(v)
# Counterに入れて、valueの降順にソート
v_odd_c = collections.Counter(v_odd)
v_odd_c = sorted(list(v_odd_c.items(... | import collections
n = int(eval(input()))
v = list(map(int, input().split()))
v_odd = []
v_even = []
for i, v in enumerate(v):
if i % 2:
v_even.append(v)
else:
v_odd.append(v)
# Counterに入れて、valueの降順にソート
v_odd_c = collections.Counter(v_odd)
v_odd_c = sorted(list(v_odd_c.items(... | p03244 |
from collections import Counter
N = int(eval(input()))
a = list(map(int,input().split()))
even = [[0,0]] + sorted([v,k] for k,v in list(Counter(a[1::2]).items()))
odd = [[0,0]] + sorted([v,k] for k,v in list(Counter(a[0::2]).items()))
if even[-1][1] != odd[-1][1]:
print((N - even[-1][0] - odd[-1][0]))
else... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
a = [v[i] for i in range(n) if i % 2]
b = [v[i] for i in range(n) if i % 2 == 0]
aa = Counter(a)
bb = Counter(b)
ans = 0
aas = sorted(list(aa.keys()), key=lambda key:aa[key], reverse=True)
bbs = sorted(list(bb.keys()... | p03244 |
import collections
def main():
n = int(eval(input()))
v = list(map(int,input().split()))
if len(set(v)) == 1:
print((n//2))
elif len(set(v)) == 2:
cnt1 = 0
cnt2 = 0
tmp1 = list(set(v))
tmp2 = [tmp1[1], tmp1[0]]
# even = v[::2]
# odd =... | import collections
def main():
n = int(eval(input()))
v = list(map(int,input().split()))
even = v[::2]
odd = v[1::2]
count_e = collections.Counter(even)
count_o = collections.Counter(odd)
ce = count_e.most_common()
co = count_o.most_common()
if ce[0][0] != co[0][0]:
... | p03244 |
from collections import Counter
n = int(eval(input()))
array = list(map(int,input().split()))
if len(set(array)) == 1:
print((n//2))
exit()
gu = []
ki = []
for i in range(n):
if i % 2 == 0:
gu.append(array[i])
else:
ki.append(array[i])
gu_c = Counter(gu)
ki_c = Counter(ki)
... | from collections import Counter
n = int(eval(input()))
array = list(map(int,input().split()))
if len(set(array)) == 1:
print((n//2))
exit()
gu = []
ki = []
for i in range(n):
if i % 2 == 0:
gu.append(array[i])
else:
ki.append(array[i])
gu_c = Counter(gu)
ki_c = Counter(ki)
... | p03244 |
import collections
N=int(eval(input()))
V=list(map(int,input().split()))
l=N//2
V_odd=[]
V_eve=[]
for i in range(N):
if i%2==0:
V_odd.append(V[i])
else:
V_eve.append(V[i])
p_odd = list(collections.Counter(V_odd).most_common())
p_eve = list(collections.Counter(V_eve).most_common())
p_odd.appen... | import collections
N=int(eval(input()))
V=list(map(int,input().split()))
l=N//2
V_odd=[]
V_eve=[]
for i in range(N):
if i%2==0:
V_odd.append(V[i])
else:
V_eve.append(V[i])
p_odd = list(collections.Counter(V_odd).most_common())
p_eve = list(collections.Counter(V_eve).most_common())
p_odd.appen... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[::2]
v2 = v[1::2]
v1_n = Counter(v1)
v1_N =v1_n.most_common()
v2_n = Counter(v2)
v2_N = v2_n.most_common()
if len(v1_N) == 1 and len(v2_N) == 1 and v1_N[0][0] == v2_N[0][0]:
print((int(n/2)))
elif len(([k[0... | from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
v1 = v[::2]
v2 = v[1::2]
v1_N = Counter(v1).most_common()
v2_N = Counter(v2).most_common()
if len(v1_N) == 1 and len(v2_N) == 1 and v1_N[0][0] == v2_N[0][0]:
print((int(n/2)))
elif v1_N[0] == v2_N[0]:
print((mi... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1 = sorted(list(Counter(v[::2]).items()), key=lambda x: x[1], reverse=True)
v2 = sorted(list(Counter(v[1::2]).items()), key=lambda x: x[1], reverse=True)
v1.append((0, 0))
v2.append((0, 0))
if v1[0][0] != v2[0][0]:
... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1 = Counter(v[::2]).most_common()
v2 = Counter(v[1::2]).most_common()
v1.append((0, 0))
v2.append((0, 0))
if v1[0][0] != v2[0][0]:
print((n - v1[0][1] - v2[0][1]))
else:
print((min(n - v1[0][1] - v2[1][1], n ... | p03244 |
N=int(eval(input()))
*V,=list(map(int,input().split()))
from collections import*
C1=Counter(V[::2])
C1=sorted(list(C1.items()),key=lambda x:x[1])
C2=Counter(V[1::2])
C2=sorted(list(C2.items()),key=lambda x:x[1])
K1=C1[-1][0]
V1=C1[-1][1]
K2=C2[-1][0]
V2=C2[-1][1]
if V1>V2:
if K1==K2:
V2=C2[... | N=int(eval(input()))
*V,=list(map(int,input().split()))
from collections import*
C1=Counter(V[::2]).most_common()+[(0,0)]
C2=Counter(V[1::2]).most_common()+[(0,0)]
K1=C1[0][0]
V1=C1[0][1]
K2=C2[0][0]
V2=C2[0][1]
if K1==K2:
if V1>V2:
V2=C2[1][1]
elif V2>V1:
V1=C[1][1]
else:
... | p03244 |
n = int(eval(input()))
vl = list(map(int,input().split()))
v1 = vl[::2]
v2 = vl[1::2]
def count(a):
d = dict()
for i in a:
if i not in d:
d[i] = 1
else:
d[i] += 1
l = []
for i in d:
l.append([d[i],i])
l.append([0,0])
l.sort(reverse=1)
return l
v1 = count(v1)
v... | n = int(eval(input()))
vl = list(map(int,input().split()))
v1 = vl[::2]
v2 = vl[1::2]
def count(a):
d = dict()
for i in a:
if i not in d:
d[i] = 1
else:
d[i] += 1
l = []
for i in d:
l.append([d[i],i])
l.append([0,0])
l.sort(reverse=1)
return l
v1 = count(v1)
v... | p03244 |
from collections import Counter
n = int(eval(input()))
lst_v = list(map(int, input().split()))
lst_o = lst_v[::2]
lst_e = lst_v[1::2]
cnt_o = Counter(lst_o).most_common() + [(0, 0)]
cnt_e = Counter(lst_e).most_common() + [(0, 0)]
if cnt_o[0][0] == cnt_e[0][0]:
rem_number = max(cnt_o[0][1] + cnt_... | from collections import Counter
n = int(eval(input()))
ls = list(map(int, input().split()))
ac = Counter(ls[::2]).most_common(2)
bd = Counter(ls[1::2]).most_common(2)
if ac[0][0] != bd[0][0]:
print((n-ac[0][1]-bd[0][1]))
else:
if len(ac) == 1 or len(bd) == 1:
print((n//2))
else:
... | p03244 |
import sys
input = sys.stdin.readline
from collections import Counter
from operator import itemgetter
def mpsort(m):
ary = sorted([[k, v] for (k, v) in list(m.items())], key=itemgetter(1), reverse=True)
if len(ary) == 1:
return ary[0], [0, 0]
return ary[0], ary[1]
def main():
n = int(input().strip()... | import sys
input = sys.stdin.readline
from collections import Counter
from operator import itemgetter
def mpsort(m):
ary = sorted([[k, v] for (k, v) in list(m.items())], key=itemgetter(1), reverse=True)
if len(ary) == 1:
return ary[0], [0, 0]
return ary[0], ary[1]
def main():
n = int(input().strip()... | p03244 |
#!/usr/bin/env python3
n = int(eval(input()))
a = list(map(int,input().split()))
cnt_odd = [0]*(10**5+1)# a[2k]での個数
cnt_even = [0]*(10**5+1)
for i in range(n):
if i %2: cnt_odd[a[i]] += 1
else: cnt_even[a[i]] += 1
odd,idx_odd=list(zip(*sorted(zip(cnt_odd,list(range(10**5+1))))))
even,idx_even=list(z... | n = int(eval(input()))
v = list(map(int, input().split()))
freq_odd = [0] * (10 ** 5 + 1)
freq_even = [0] * (10 ** 5 + 1)
for i in range(n // 2):
freq_odd[v[2 * i]] += 1
freq_even[v[2 * i + 1]] += 1
# print(freq_odd[:10], freq_even[:10])
freq_even, id_even = list(zip(*sorted(zip(freq_even, list(range(10... | p03244 |
n=int(eval(input()))
V=list(map(int,input().split()))
from collections import Counter
V_1=V[::2]
V_2=V[1::2]
V_1_counter=Counter(V_1).most_common()
V_2_counter=Counter(V_2).most_common()
c1 = V_1_counter
c2 = V_2_counter
if c1[0][0]!=c2[0][0]:
print((n-c1[0][1]-c2[0][1]))
if c1[0][0]==c2[0][0]:
... | N=int(eval(input()))
V=list(map(int,input().split()))
from collections import Counter
V_1=V[::2]
V_2=V[1::2]
V_1_counter=Counter(V_1).most_common()
V_2_counter=Counter(V_2).most_common()
# print(V_1_counter,V_2_counter)
V_1_max_1 = V_1_counter[0]
V_1_max_2=(0,0)
if len(V_1_counter)>1:
V_1_max_2 = V... | p03244 |
N=int(eval(input()))
lv=list(map(int,input().split()))
dev={}
dod={}
#cev=0#devの種類数
#cod=0#dodの種類数
max1_ev=[0,0]#数字,個数
max2_ev=[0,0]
max1_od=[0,0]#数字,個数
max2_od=[0,0]
for i in range(N):
if i%2==0:#even
#max1_ev=[0,0]#数字,個数
#max2_ev=[0,0]
#毎回初期化していた！！
if lv[i] in de... | N=int(eval(input()))
lv=list(map(int,input().split()))
dev={}
dod={}
for i in range(N):
if i%2==0:#even
if lv[i] in dev:
dev[lv[i]]+=1
else:
dev[lv[i]]=1
else:#odd
if lv[i] in dod:
dod[lv[i]]+=1
else:
dod[lv[i]]=1
m... | p03244 |
import collections
N = int(eval(input()))
V = [int(x) for x in input().split()]
Va, Vb = [], []
for i in range(N):
if i % 2 == 0:
Va.append(V[i])
else:
Vb.append(V[i])
Va_most = collections.Counter(Va).most_common()
Vb_most = collections.Counter(Vb).most_common()
if N == colle... | import itertools
from collections import Counter
N = int(eval(input()))
V = [int(x) for x in input().split()]
EV_cnt = Counter(V[::2])
OD_cnt = Counter(V[1::2])
EV_cnt[-1] = 0
OD_cnt[-2] = 0
EV = EV_cnt.most_common(2)
OD = OD_cnt.most_common(2)
ans = N
for (k1,v1), (k2,v2) in itertools.product(EV,OD)... | p03244 |
import collections
n = int(eval(input()))
V = [int(i) for i in input().split()]
E,O = [],[]
E_cnt2,O_cnt2 = 0,0
for i in range(n):
if i%2:
E.append(V[i])
else:
O.append(V[i])
e = collections.Counter(E)
tmp = e.most_common()
E_mode,E_cnt = tmp[0][0],tmp[0][1]
if len(tmp)>=2:
E_c... | import collections
n = int(eval(input()))
v = [int(i) for i in input().split()]
kisu = []
gusu = []
kisu = v[::2]
gusu = v[1::2]
kisu_cnt = collections.Counter(kisu)
gusu_cnt = collections.Counter(gusu)
kisu_cnt = kisu_cnt.most_common(2)#引数にnを用意すると，出現回数の多い順にn子だけ呼び出せる
gusu_cnt = gusu_cnt.most_common(2)
... | p03244 |
# coding: utf-8
# Your code here!
n=int(eval(input()))
v=[int(x) for x in input().split()]
if len(set(v))==1:
print((n//2))
import sys
sys.exit()
from collections import Counter
v1=[]
v2=[]
for i in range(n):
if i%2==0:
v1.append(v[i])
else:
v2.append(v[i])
v1=Counter... | # coding: utf-8
# Your code here!
n=int(eval(input()))
v=[int(x) for x in input().split()]
if len(set(v))==1:
print((n//2))
import sys
sys.exit()
from collections import Counter
v1=[]
v2=[]
for i in range(n):
if i%2==0:
v1.append(v[i])
else:
v2.append(v[i])
v1=Counter... | p03244 |
from collections import Counter
n = int(input())
V = list(map(int, input().split()))
Odd, Evn = [], []
for i in range(n):
Evn.append(V[i]) if i%2 == 0 else Odd.append(V[i])
Evn = sorted( dict(Counter(Evn)).items(), key = lambda x:x[1])
Odd = sorted( dict(Counter(Odd)).items(), key = lambda x:x[1])
cnt =... | from collections import Counter
n = int(input())
V = list(map(int, input().split()))
Odd, Evn = [], []
for i in range(n):
Evn.append(V[i]) if i%2 == 0 else Odd.append(V[i])
Evn = sorted( dict(Counter(Evn)).items(), key = lambda x:x[1], reverse=True)
Odd = sorted( dict(Counter(Odd)).items(), key = lambda x:... | p03244 |
n = int(eval(input()))
v = list(map(int,input().split()))
v_odd = []
v_even = []
for i in range(n//2):
v_odd.append(v[2*i])
v_even.append(v[2*i+1])
p1 = 0
p2 = 0
q1 = 0
q2 = 0
o_max = -1
e_max = -1
for i in range(n//2):
a = v_odd[i]
b = v_even[i]
x = v_odd.count(a)
y = v_even.co... | n = int(eval(input()))
v = list(map(int,input().split()))
v_odd = []
v_even = []
d_odd = {}
d_even = {}
o = []
e = []
for i in range(n//2):
a = v[2*i]
b = v[2*i+1]
if a in d_odd:
d_odd[a] += 1
else:
d_odd[a] = 1
o.append(a)
if b in d_even:
d_even[b] +... | p03244 |
from collections import Counter
from operator import itemgetter
n = int(eval(input()))
v = tuple(map(int, input().split()))
evens = Counter(v[::2])
odds = Counter(v[1::2])
evens = list(sorted(list(evens.items()), key=itemgetter(1), reverse=True))
odds = list(sorted(list(odds.items()), key=itemgetter(1), re... | from collections import Counter
from itertools import product
NUM = 0
CNT = 1
n = int(eval(input()))
v = tuple(map(int, input().split()))
c_odd = Counter(v[1::2])
c_even = Counter(v[0::2])
odd_12 = c_odd.most_common()[:2]
even_12 = c_even.most_common()[:2]
# [(num, cnt),(num, cnt)]
ans = n
for o, ... | p03244 |
import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: 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(): retur... | import sys
sys.setrecursionlimit(10 ** 6)
# input = sys.stdin.readline ####
int1 = lambda x: 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(): retur... | p03244 |
from collections import Counter
from itertools import product
N=int(eval(input()))
V=list(map(int,input().split()))
# 出現回数
O_cnt,E_cnt=Counter(V[::2]),Counter(V[1::2])
O_cnt[-1]=0
E_cnt[-2]=0
# 出現回数順
O_key,E_key=O_cnt.most_common(2),E_cnt.most_common(2)
ans=float('inf')
for O_k,E_k in product(O_key... | from collections import Counter
N=int(eval(input()))
V=list(map(int,input().split()))
v1=V[::2]
v2=V[1::2]
cntV1,cntV2=Counter(v1),Counter(v2)
cntV1,cntV2=cntV1.most_common(2),cntV2.most_common(2)
cntV1.append((0,0))
cntV2.append((0,0))
if cntV1[0][0]!=cntV2[0][0]:
ans=N-(cntV1[0][1]+cntV2[0][1])
... | p03244 |
from collections import Counter
n = int(eval(input()))
v=list(map(int,input().split()))
a=Counter(v[0::2]).most_common()
b=Counter(v[1::2]).most_common()
a.append([0,0])
b.append([0,0])
if a[0][0]!=b[0][0]:
print((n-(a[0][1]+b[0][1])))
else:
print((min(n-(a[1][1]+b[0][1]),n-(a[0][1]+b[1][1])))) |
from collections import Counter
def resolve():
N = int(eval(input()))
A = list(map(int, input().split()))
O = Counter(A[::2])
E = Counter(A[1::2])
most_O = O.most_common(2)
most_E = E.most_common(2)
# 番兵
most_O.append((0, 0))
most_E.append((0, 0))
cnt = 0
... | p03244 |
# -*- coding: utf-8 -*-
N = int(eval(input()))
vN = list(map(int, input().split()))
even = {}
odd = {}
# 奇数番目と偶数番目に分けて集計
for i in range(N):
if i % 2 == 0:
even[vN[i]] = even.get(vN[i], 0) + 1
else:
odd[vN[i]] = odd.get(vN[i], 0) + 1
# 集計数の多い順ソート
even_sorted = sorted(list(even.i... | # -*- coding: utf-8 -*-
N = int(eval(input()))
vN = list(map(int, input().split()))
even = {}
odd = {}
# 奇数番目と偶数番目に分けて集計
for i in range(N):
if i % 2 == 0:
even[vN[i]] = even.get(vN[i], 0) + 1
else:
odd[vN[i]] = odd.get(vN[i], 0) + 1
# 集計数の多い順ソート
even_sorted = sorted(list(even.i... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1, v2 = [], []
for i in range(n):
if i%2:
v1.append(v[i])
else:
v2.append(v[i])
vv1 = Counter(v1).most_common()
vv2 = Counter(v2).most_common()
if vv1[0] != vv2[0]:
print((n - vv1[0][1] - ... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v1, v2 = v[::2], v[1::2]
vv1 = Counter(v1).most_common()
vv2 = Counter(v2).most_common()
if len(set(v)) == 1:
print((n//2))
elif vv1[0] != vv2[0]:
print((n - vv1[0][1] - vv2[0][1]))
else:
print((n - max(v... | p03244 |
from collections import Counter
N = int(eval(input()))
V = list(map(int, input().split()))
if len(set(V)) == 1:
print((len(V)//2))
exit()
V_odd = [i for i in V[::2]]
V_even = [i for i in V[1::2]]
V_odd_counter = Counter(V_odd)
V_even_counter = Counter(V_even)
vodd = V_odd_counter.most_common()... | from collections import Counter
N = int(eval(input()))
V = list(map(int, input().split()))
if len(set(V)) == 1:
print((len(V)//2))
exit()
V_odd = [i for i in V[::2]]
V_even = [i for i in V[1::2]]
V_odd_counter = Counter(V_odd)
V_even_counter = Counter(V_even)
vodd = V_odd_counter.most_common()... | p03244 |
from collections import Counter
N = int(eval(input()))
V = list(map(int, input().split()))
s1 = Counter(V).most_common(2)[0]
s2 = Counter(V).most_common(2)[0]
V1 = V[0::2]
V2 = V[1::2]
c1 = c2 = c3 = c4 = 0
Z1 = Counter(V1)
Z2 = Counter(V2)
x1, c1 = Z1.most_common(1)[0]
x2, c2 = Z2.most_common(1)[0]
if ... | # coding: utf-8
import sys
from collections import Counter
sr = lambda: sys.stdin.readline().rstrip()
ir = lambda: int(sr())
lr = lambda: list(map(int, sr().split()))
# 奇数番目の最頻値と偶数番目の最頻値が同じ時に注意
N = ir()
V = lr()
odd = V[::2]
even = V[1::2]
cnt_odd = Counter(odd)
cnt_even = Counter(even)
cnt_odd_most = ... | p03244 |
from bisect import bisect_left as bl
from bisect import bisect_right as br
n = int(eval(input()))
v = list(map(int, input().split()))
ev = []
od = []
for i in range(n):
if i % 2 == 0:
ev.append(v[i])
else:
od.append(v[i])
ev.sort()
od.sort()
m = 0
oo = [[0, 0]]
ii = [[0, 0]]
whil... | n = int(eval(input()))
v = list(map(int, input().split()))
ev = [0]*(max(v)+1)
od = [0]*(max(v)+1)
for i in range(n):
if i % 2 == 0:
ev[v[i]-1] += 1
else:
od[v[i] - 1] += 1
e = sorted(ev)
o = sorted(od)
if ev.index(e[-1]) == od.index(o[-1]) and e[-2] != e[-1] and o[-2] != o[-1]:
... | p03244 |
from collections import Counter
N = int(eval(input()))
a = list(map(int,input().split()))
E = []
O = []
for k in range(N):
if k%2 == 0:
E.append(a[k])
else:
O.append(a[k])
e = Counter(E).most_common()
o = Counter(O).most_common()
if e[0][0] != o[0][0]:
print((N-e[0][1]-o[0][1]... | from collections import Counter
n = int(eval(input()))
a = list(map(int,input().split()))
e = [a[k] for k in range(0,n,2)]
o = [a[k] for k in range(1,n,2)]
C = Counter(e).most_common()
D = Counter(o).most_common()
if C[0][0] != D[0][0]:
print((n-C[0][1]-D[0][1]))
else:
if len(C) == len(D) == 1:
... | p03244 |
n = int(eval(input()))
li = list(map(int,input().split()))
li2 = li[::2]
li3 = li[1::2]
max2,max22,max3,max33 = [0,0,0,0]
for i in li2:
a = li2.count(i)
if a > max2:
max22 = max2
max2 = a
b = i
elif a > max22 and i != b:
max22 = a
for i in li3:
a = li3... | n = int(eval(input()))
v = list(map(int,input().split()))
cnt1 = {}
cnt2 = {}
for i in range(n):
if i % 2 == 0:
if v[i] in cnt1:
cnt1[v[i]] += 1
else:
cnt1[v[i]] = 1
else:
if v[i] in cnt2:
cnt2[v[i]] += 1
else:
cnt... | p03244 |
N=int(eval(input()))
*V,=list(map(int,input().split()))
import collections
import collections
c1=collections.Counter(V[0::2])
c1=sorted(list(c1.items()), key=lambda x: x[1], reverse=True)
e=c1[0][0]
c2=collections.Counter(V[1::2])
c2=sorted(list(c2.items()), key=lambda x: x[1], reverse=True)
o=c2[0][0]
... | N=int(eval(input()))
*V,=list(map(int,input().split()))
import collections
c1=collections.Counter(V[0::2]).most_common()
c2=collections.Counter(V[1::2]).most_common()
c1.append([0,0])
c2.append([0,0])
if c1[0][0]!=c2[0][0]:
print((N-c1[0][1]-c2[0][1]))
else:
print((min(N-c1[0][1]-c2[1][1],N-c1[1][1]... | p03244 |
import sys
from collections import Counter
readline = sys.stdin.readline
readlines = sys.stdin.readlines
ns = lambda: readline().rstrip() # input string
ni = lambda: int(readline().rstrip()) # input int
nm = lambda: list(map(int, readline().split())) # input multiple int
nl = lambda: list(map(int, readline().... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
odd = Counter(v[0::2])
even = Counter(v[1::2])
odd["$"] = 0
even["#"] = 0
ans = 0
if odd.most_common()[0][0] == even.most_common()[0][0]:
if odd.most_common()[1][1] > even.most_common()[1][1]:
ans = n - od... | p03244 |
import collections
def main():
n = int(eval(input()))
*v, = list(map(int, input().split()))
v0 = count(v[::2])
v1 = count(v[1::2])
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
... | import collections
def main():
n = int(eval(input()))
*v, = list(map(int, input().split()))
v0 = count(v[::2])
v1 = count(v[1::2])
if len(v0) == 1 and len(v1) == 1:
if v0[0][0] == v1[0][0]:
print((n // 2))
else:
print((0))
return
... | p03244 |
import math,fractions
from collections import Counter
n = int(eval(input()))
v = [int(i) for i in input().split()]
a = [v[i] for i in range(n) if i%2]
b = [v[i] for i in range(n) if i%2==0]
cnt_a = Counter(a)
cnt_b = Counter(b)
max_a = cnt_a.most_common()[0][1]
max_b = cnt_b.most_common()[0][1]
str_a = cnt_... | import math,fractions
from collections import Counter
n = int(eval(input()))
v = [int(i) for i in input().split()]
a = Counter(v[1::2]).most_common()
b = Counter(v[0::2]).most_common()
a.append((0,0))
b.append((0,0))
if a[0][0] != b[0][0]:
print((n//2 - a[0][1] + n//2 - b[0][1]))
else:
tmp_x = n//2... | p03244 |
import collections as coll
n = int(eval(input()))
v = list(map(int,input().split()))
even = []
odd = []
for i in range(n):
if i % 2 == 0:
even.append(v[i])
else:
odd.append(v[i])
oddc = coll.Counter(odd).most_common()[:2]
evenc = coll.Counter(even).most_common()[:2]
if(len(oddc) == 1):
oddc.... | import collections as coll
n = int(eval(input()))
v = list(map(int,input().split()))
even = v[0::2]
odd = v[1::2]
oddc = coll.Counter(odd).most_common()[:2]
evenc = coll.Counter(even).most_common()[:2]
if(len(oddc) == 1):
oddc.append((0,0))
if(len(evenc) == 1):
evenc.append((0,0))
if(oddc[0][0] !... | p03244 |
import itertools
from collections import Counter
N = int(eval(input()))
V = [int(x) for x in input().split()]
EV_counter = Counter(V[::2])
OD_counter = Counter(V[1::2])
# 1種類しかないとき対策
EV_counter[-1] = 0
OD_counter[-2] = 0
# 上位2種しか使う必要がない
EV = EV_counter.most_common(2)
OD = OD_counter.most_common(2)
a... | from collections import Counter
n=int(eval(input()))
v=list(map(int,input().split()))
a=Counter(v[0::2]).most_common()
b=Counter(v[1::2]).most_common()
a.append([0,0])
b.append([0,0])
if a[0][0]!=b[0][0]:
print((n-(a[0][1]+b[0][1])))
else:
print((min(n-(a[1][1]+b[0][1]),n-(a[0][1]+b[1][1]))))
| p03244 |
# -*- coding: utf-8 -*-
from collections import defaultdict
from operator import itemgetter
def solve():
n = int(eval(input()))
V = list(map(int, input().split()))
l = defaultdict(int)
u = defaultdict(int)
for i in range(0,n,2):
l[V[i]] += 1
u[V[i+1]] += 1
l = sorted... | # -*- coding: utf-8 -*-
from collections import Counter
from operator import itemgetter
def solve():
eval(input())
V = list(map(int, input().split()))
l = sorted(list(Counter(V[::2]).items())+[(0,0)], key=itemgetter(1), reverse=True)
u = sorted(list(Counter(V[1::2]).items())+[(0,0)], key=itemgett... | p03244 |
import itertools
import math
import fractions
import functools
import copy
n = int(eval(input()))
v = list(map(int, input().split()))
kisu = [0]*(10**6)
gusu = [0]*(10**6)
for i in range(n):
if i % 2 == 0:
gusu[v[i]] += 1
else:
kisu[v[i]] += 1
count = 0
gusu_m = gusu.index(m... |
n = int(eval(input()))
v = list(map(int, input().split()))
kisu = [0]*(10**6)
gusu = [0]*(10**6)
for i in range(n):
if i % 2 == 0:
gusu[v[i]] += 1
else:
kisu[v[i]] += 1
count = 0
gusu_m = gusu.index(max(gusu))
kisu_m = kisu.index(max(kisu))
if gusu_m == kisu_m:
gusu[gu... | p03244 |
n = int(eval(input()))
v = list(map(int, input().split()))
kisu = [0]*(10**6)
gusu = [0]*(10**6)
for i in range(n):
if i % 2 == 0:
gusu[v[i]] += 1
else:
kisu[v[i]] += 1
count = 0
gusu_m = gusu.index(max(gusu))
kisu_m = kisu.index(max(kisu))
if gusu_m == kisu_m:
gusu[gu... | def main():
n = int(eval(input()))
# n, k = map(int, input().split())
v = list(map(int, input().split()))
# s = input()
even = [0] * (10 ** 5 + 100)
odd = [0] * (10 ** 5 + 100)
for i in range(n):
if i % 2 == 0:
even[v[i]] += 1
else:
odd[... | p03244 |
from collections import Counter
import heapq
N = int(eval(input()))
Vs = list(map(int,input().split()))
if len(set(Vs)) == 1:
print((N//2))
exit()
Veve, Vodd = [],[]
idx = 0
for v in Vs:
if idx%2 == 0: Veve.append(v)
else: Vodd.append(v)
idx += 1
Veve_cnt, Vodd_cnt = [], []
[heapq.heappu... | N = int(eval(input()))
V = list(map(int, input().split()))
even_idx_cnt = {}
odd_idx_cnt = {}
for idx, v in enumerate(V):
if idx % 2 == 0:
if v not in even_idx_cnt:
even_idx_cnt[v] = 0
even_idx_cnt[v] += 1
else:
if v not in odd_idx_cnt:
odd_idx_cnt[v]... | p03244 |
N = int(eval(input()))
V = list(map(int,input().split()))
from collections import Counter
def get_counter(X):
counter = Counter(X)
X = sorted(list(counter.items()), key = lambda x:x[1], reverse = True)
X.append((0,0))
return X
V1 = get_counter(V[::2])
V2 = get_counter(V[1::2])
if V1[0][0] != V... | N = int(eval(input()))
V = list(map(int,input().split()))
from collections import Counter
def get_counter(X):
counter = Counter(X)
X = counter.most_common()
X.append((0,0))
return X
V1 = get_counter(V[::2])
V2 = get_counter(V[1::2])
if V1[0][0] != V2[0][0]:
print((N - (V1[0][1] + V2[0][1]))... | p03244 |
from collections import*
n,*v=list(map(int,open(0).read().split()))
a,b=[Counter(i).most_common()+[(0,0)]for i in(v[::2],v[1::2])]
i,j=a[0][1],b[0][1]
print((min(n-i-b[1][1],n-a[1][1]-j)*(a[0][0]==b[0][0])or n-i-j)) | from collections import*;n,*v=list(map(int,open(0).read().split()));a,b=[Counter(v[i::2]).most_common()+[(0,0)]for i in(0,1)];i,x=a[0];j,y=b[0];print((n-[x+y,max(x+b[1][1],y+a[1][1])][i==j])) | p03244 |
import collections
import itertools
n = int(eval(input()))
v = list(map(int,input().split()))
#n = len(v)
c = collections.Counter(v).most_common()
if len(c) == 1:
print((n//2))
exit()
values, counts = list(zip(*c))
k = sorted(list(set(counts)),reverse=True)[:2]
pairs = []
for vcnt in c:
val = v... | from collections import Counter
n = int(eval(input()))
v = list(map(int,input().split()))
o = Counter(v[::2]).most_common()
o.append((0,0))
e = Counter(v[1::2]).most_common()
e.append((0,0))
if o[0][0] == e[0][0]:
ans = min(n - o[0][1] - e[1][1], n - o[1][1] - e[0][1])
else:
ans = n - o[0][1] - e[0][1... | p03244 |
import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return list(map(int, sys.stdin.readline().split()))
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): ret... | p03244 |
from collections import Counter
n = int(eval(input()))
V = list(map(int,input().split()))
E = []
O = []
for i,v in enumerate(V):
if i%2==0:
O.append(v)
else:
E.append(v)
cO = Counter(O).most_common(); cO.append((-1,0))
cE = Counter(E).most_common(); cE.append((-1,0))
if cO[0][0]==c... | from collections import Counter
n = int(eval(input()))
V = list(map(int,input().split()))
cv1 = Counter(V[::2]).most_common()
cv2 = Counter(V[1::2]).most_common()
cv1.append((-1,0)); cv2.append((-1,0))
if cv1[0][0] != cv2[0][0]:
print((n-cv1[0][1]-cv2[0][1]))
else:
print((min(n-cv1[1][1]-cv2[0][1], n-c... | p03244 |
from collections import Counter
N = int(eval(input()))
V = list(map(int,input().split()))
c1 = Counter(V[::2])
c2 = Counter(V[1::2])
m1 = c1.most_common()
m2 = c2.most_common()
t2 = N//2
t1 = N - t2
if len(m1) == len(m2) == 1:
print((N//2 if m1[0][0] == m2[0][0] else 0))
elif len(m1) == 1:
if m1... | from collections import Counter
N = int(eval(input()))
V = list(map(int,input().split()))
c1 = Counter(V[::2])
c2 = Counter(V[1::2])
n1 = N//2 + N%2
n2 = N//2
if len(c1)==1 and len(c2)==1:
if V[0]==V[1]:
print(n2)
else:
print((0))
elif len(c1)==1:
mc = c2.most_common()
if... | p03244 |
import collections
n = int(eval(input()))
v = list(map(int, input().split()))
a = v[::2]
b = v[1::2]
ac = collections.Counter(a)
bc = collections.Counter(b)
ac = sorted(list(ac.items()), key=lambda x: x[1], reverse=True)
bc = sorted(list(bc.items()), key=lambda x: x[1], reverse=True)
if ac[0][0] == bc[0][0]:... | import collections
n = int(eval(input()))
v = list(map(int, input().split()))
a = v[::2]
b = v[1::2]
ac = collections.Counter(a).most_common(2)
bc = collections.Counter(b).most_common(2)
if ac[0][0] != bc[0][0]:
print((n - ac[0][1] - bc[0][1]))
else:
if len(ac) == 1:
print((n // 2))
el... | p03244 |
#python3
from collections import Counter
n = int(eval(input()))
a = list(map(int, input().split()))
odd = [a[i] for i in range(n) if i%2==0]
even = [a[i] for i in range(n) if i%2!=0]
cntOdd = Counter(odd).most_common(2)
cntEven = Counter(even).most_common(2)
if cntOdd[0][0] != cntEven[0][0]:
pri... | import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines
from collections import Counter
from collections import defaultdict
def main():
n = int(readline())
a = [int(i) for i in readline().split()]
odd = Counter(a[::2]).most_common(2)
... | p03244 |
from collections import Counter
n = int(eval(input()))
*v, = list(map(int, input().split()))
odds = v[1::2]
evens = v[::2]
o = Counter(odds)
e = Counter(evens)
omx, *ol = sorted(list(o.items()), reverse=True, key=lambda x: x[1])
emx, *el = sorted(list(e.items()), reverse=True, key=lambda x: x[1])
if omx[0]... | from collections import Counter
from itertools import product
n = int(eval(input()))
*v, = list(map(int, input().split()))
o = Counter(v[1::2])
e = Counter(v[::2])
o[0] = 0
e[0] = 0
o_ls = o.most_common(2)
e_ls = e.most_common(2)
ans = n
for (k1, v1), (k2, v2) in product(o_ls, e_ls):
if k1 == k2:
... | p03244 |
from collections import *
N = int(eval(input()))
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_list = v_list[::2]
v2_list = v_list[1::2]
v1_count_list = Counter(v1_list).most_common()
v2_count_list = Counter(v2_list).most_common()
if v1_count_list[0][... | from collections import *
N = int(eval(input()))
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common()
v2_count_list = Counter(v_list[1::2]).most_common()
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_va... | p03244 |
from collections import *
N = int(eval(input()))
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common()
v2_count_list = Counter(v_list[1::2]).most_common()
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_va... | from collections import *
N = eval(input())
v_list = input().split()
if len(set(v_list)) == 1:
print((len(v_list) // 2))
exit()
v1_count_list = Counter(v_list[::2]).most_common(2)
v2_count_list = Counter(v_list[1::2]).most_common(2)
if v1_count_list[0][0] != v2_count_list[0][0]:
leave_value... | p03244 |
def main():
n, *v = list(map(int, open(0).read().split()))
be = [0] * int(1e5)
bo = [0] * int(1e5)
for e, o in zip(*[iter(v)] * 2):
be[e - 1] += 1
bo[o - 1] += 1
if be.index(max(be)) == bo.index(max(bo)):
ve = max(be)
vo = max(bo)
be[be.index(ve)] = ... | def main():
n, *v = list(map(int, open(0).read().split()))
be = [0] * int(1e5)
bo = [0] * int(1e5)
for e, o in zip(*[iter(v)] * 2):
be[e - 1] += 1
bo[o - 1] += 1
ve = max(be)
vo = max(bo)
ke = be.index(ve)
ko = bo.index(vo)
if ke == ko:
be[ke] = 0
... | p03244 |
from collections import Counter
n = int(eval(input()))
s = list(map(int, input().split()))
evenL = []
oddL = []
for i, v in enumerate(s):
if i % 2 == 0:
evenL.append(v)
else:
oddL.append(v)
evenLc = Counter(evenL)
oddLc = Counter(oddL)
evenLcs = sorted(list(evenLc.items()), key=lambda x:... | from collections import Counter as C
n = int(eval(input()))
V = list(input().split())
V1 = C(V[::2]).most_common()
V2 = C(V[1::2]).most_common()
if V1[0][0] != V2[0][0]:
ans = n - (V1[0][1] + V2[0][1])
else:
l = V1[0][1] + V2[1][1] if len(V2) > 1 else V1[0][1]
r = V1[1][1] + V2[0][1] if len(V1) > 1 e... | p03244 |
n = int(eval(input()))
V = list(map(int, input().split()))
E = {}
O = {}
n = 1
for i, v in enumerate(V):
if n:
if v in list(E.keys()):
E[v] += 1
else:
E[v] = 1
else:
if v in list(O.keys()):
O[v] += 1
else:
O[v] = 1
... | n = int(eval(input()))
V = list(map(int, input().split()))
E = {}
O = {}
now = 1
for i, v in enumerate(V):
if now:
if v in list(E.keys()):
E[v] += 1
else:
E[v] = 1
else:
if v in list(O.keys()):
O[v] += 1
else:
O[v] = ... | p03244 |
import collections
N = int(eval(input()))
V = [int(_) for _ in input().split()]
def calc(vs):
r = dict(collections.Counter(vs))
r[0] = 0
ri = list(r.items())
return sorted(ri, key=lambda x:-x[1])
ve = calc(V[::2])
vo = calc(V[1::2])
result = 0
if ve[0][0] != vo[0][0]:
result = ... | import collections
N = int(eval(input()))
V = [int(_) for _ in input().split()]
def calc(vs):
cs = collections.Counter(vs)
cs[0] = 0
return cs.most_common()
ve = calc(V[::2])
vo = calc(V[1::2])
result = 0
if ve[0][0] != vo[0][0]:
result = N - ve[0][1] - vo[0][1]
else:
result =... | p03244 |
import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
from operator import itemgetter
def main():
n=int(eval(input()))
V=[int(_) for _ in input().split()]
even=V[0::2]
odd=V[1::2]
even_c=Counter(even)
odd_c=Counter(odd)
even_ci,odd_ci=list(ev... | import sys
def input(): return sys.stdin.readline().rstrip()
from collections import Counter
from operator import itemgetter
def main():
n=int(eval(input()))
V=[int(_) for _ in input().split()]
even,odd=V[0::2],V[1::2]
even_c,odd_c=Counter(even),Counter(odd)
even_ci,odd_ci=list(even_c.items... | p03244 |
import collections
n = int(eval(input()))
v = list(map(int, input().split()))
even_odd_length = n / 2
replace_total = 0
list_odd = v[0::2]
list_even = v[1::2]
dict_c_odd = dict(collections.Counter(list_odd))
dict_c_even = dict(collections.Counter(list_even))
dict_c_even_bk = dict_c_even.copy()
dict_c_od... | import collections
n = int(eval(input()))
v = list(map(int, input().split()))
even_odd_length = n / 2
replace_total = 0
list_odd = v[0::2]
list_even = v[1::2]
dict_c_odd = dict(collections.Counter(list_odd))
dict_c_even = dict(collections.Counter(list_even))
dict_c_even_bk = dict_c_even.copy()
replace... | p03244 |
from collections import Counter
n=int(eval(input()))
l=list(map(int,input().split()))
f=l[0::2]
s=l[1::2]
ans=[]
if len(list(Counter(l).values())) == 1:
ans.append(len(f))
elif len(list(Counter(f).values())) == len(list(Counter(s).values())) == 1:
ans.append(0)
else:
for fk,fv in list(Counter(f).items(... | from collections import Counter
n=int(eval(input()))
l=list(map(int,input().split()))
f=l[0::2]
s=l[1::2]
fn=sorted(list(Counter(f).items()),key=lambda x:x[1],reverse=True) + [(0, 0)]
sn=sorted(list(Counter(s).items()),key=lambda x:x[1],reverse=True) + [(0, 0)]
if fn[0][0]!=sn[0][0]:
ans=n-fn[0][1]-sn[0][1]
... | p03244 |
n = int(eval(input()))
v = list(map(int, input().split()))
va, ve = v[0::2], v[1::2]
add, even = va[0], ve[0]
for a in set(va):
add = a if va.count(add) < va.count(a) else add
for e in set(ve):
even = e if ve.count(even) < ve.count(e) else even
print((len(v)-va.count(add)-ve.count(even) if add!=even els... | n = int(eval(input()))
v = list(map(int, input().split()))
va, ve = v[0::2], v[1::2]
da, de = {}, {}
for a in va:
da[a] = da.get(a, 0)+1
for e in ve:
de[e] = de.get(e, 0)+1
add = sorted([(k,v) for k,v in list(da.items())], key=lambda x:-x[1])+[(0,0)]
even = sorted([(k,v) for k,v in list(de.items())], key... | p03244 |
from collections import Counter
iN = int(eval(input()))
aV = [int(_) for _ in input().split()]
oV0 = Counter(aV[0::2]).most_common(2)
oV1 = Counter(aV[1::2]).most_common(2)
oV0 += [(0,0)]
oV1 += [(0,0)]
if oV0[0][0] != oV1[0][0] :
print((iN - oV0[0][1] - oV1[0][1]))
else:
print((iN - max(oV0[0][... | from collections import Counter
def fParse(iN,aV):
oV0 = Counter(aV[0::2]).most_common(2)
oV1 = Counter(aV[1::2]).most_common(2)
oV0 += [(0,0)]
oV1 += [(0,0)]
if oV0[0][0] != oV1[0][0] :
return iN - oV0[0][1] - oV1[0][1]
else:
return iN - max(oV0[0][1],oV1[0][1]) - m... | p03244 |
N = int(eval(input()))
V = list(map(int,input().split()))
even = [0]*(10**5+10)
odd = [0]*(10**5+10)
for v in V[::2]:
odd[v] += 1
for v in V[1::2]:
even[v] += 1
omax = max(odd)
emax = max(even)
if(even.index(emax) != odd.index(omax)):
print((N - emax - omax))
else:
even.sort()
odd.sort()
prin... | def ans():
N = int(eval(input()))
V = list(map(int,input().split()))
even = [0]*100001
odd = [0]*100001
for v in V[1::2]:
even[v] += 1
for v in V[::2]:
odd[v] += 1
me = max(even)
mo = max(odd)
if(even.index(me) != odd.index(mo)):
print((N - me - mo))
else:
even.sort()
... | p03244 |
from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v_former = sorted([(v, k) for k, v in list(Counter(v[::2]).items())], reverse=True) + [(0, 0)]
v_latter = sorted([(v, k) for k, v in list(Counter(v[1::2]).items())], reverse=True) + [(0, 0)]
if v_former[0][1] != v_latter... | from collections import Counter
n = int(eval(input()))
v = list(map(int, input().split()))
v_former = Counter(v[::2]).most_common() + [(0, 0)]
v_latter = Counter(v[1::2]).most_common() + [(0, 0)]
if v_former[0][0] != v_latter[0][0]:
print((n - v_former[0][1] - v_latter[0][1]))
else:
print((n - max(v... | p03244 |
'''
問題文
数列 a1,a2,...,anが以下の条件を満たすとき、 /\/\/\/ と呼ぶことにします。
・各 i=1,2,...,n−2について、ai=ai+2
・数列に現れる数はちょうど 2種類
偶数長の数列 v1,v2,...,vnが与えられます。 要素をいくつか書き換えることでこの数列を /\/\/\/ にしたいです。
書き換える要素の数は最小でいくつになるか求めてください。
制約
2≤n≤105
nは偶数
1≤vi≤105
viは整数
'''
n=int(eval(input()))
v=input().split()
vodd=[]
veven=[]
for i i... | n=int(eval(input()))
v=list(map(int,input().split()))
vodd={-1:0}
veven={-1:0}
for i,vi in enumerate(v):
if i%2:
if(vi in veven):
veven[vi]+=1
else:
veven[vi]=1
else:
if(vi in vodd):
vodd[vi]+=1
else:
vodd[vi]=1
veven... | p03244 |
from collections import Counter
n = int(eval(input()))
lst_v = list(map(int, input().split()))
if len(set(lst_v)) == 1:
ans = n // 2
else:
lst_odd = lst_v[::2]
lst_even = lst_v[1::2]
cnt_odd = sorted(list(Counter(lst_odd).items()), key=lambda x: -x[1])
cnt_even = sorted(list(Counter... | # C
import collections
n = int(eval(input()))
lst = list(map(int, input().split()))
lst1 = lst[::2]
lst2 = lst[1::2]
dct1 = sorted(list(dict(collections.Counter(lst1)).items()), key=lambda x:-x[1])
dct2 = sorted(list(dict(collections.Counter(lst2)).items()), key=lambda x:-x[1])
ans = 0
if (len(dct1) == 1 a... | p03244 |
from collections import Counter
n=int(eval(input()))
V=list(map(int,input().split()))
V_1=[(0,0)]+sorted(list(Counter([V[i] for i in range(n) if i%2==0]).items()), key=lambda x:x[1])
V_2=[(0,0)]+sorted(list(Counter([V[j] for j in range(n) if j%2==1]).items()), key=lambda x:x[1])
a,b=V_1[-1][0],V_2[-1][0]
if... | from collections import Counter
n=int(eval(input()))
V=list(map(int,input().split()))
even=[(0,0)]+sorted(list(Counter(V[::2]).items()), key=lambda x:x[1])
odd=[(0,0)]+sorted(list(Counter(V[1::2]).items()), key=lambda x:x[1])
if even[-1][0]==odd[-1][0]:
if even[-2][1]>odd[-2][1]:even=even[-2][0];odd=odd[-... | p03244 |
from collections import Counter
n = eval(input())
V = list(map(int, input().split(" ")))
v1 = V[0::2]
v2 = V[1::2]
f1 = Counter(v1).most_common(2)
f2 = Counter(v2).most_common(2)
ans = 0
if len(set(v1)) == len(set(v2)) == 1:
if v1 == v2:
ans = min(len(v1), len(v2))
else:
if f1[0][0] ... | from collections import Counter
n = eval(input())
V = list(map(int, input().split(" ")))
"""
9
1 1 1 1 2 2 2 4
1 1 1 1 3 3 4 4
"""
#V = [1, 1, 1, 1, 1, 1, 1, 1, 2, 3, 2, 3, 2, 4, 4, 4]
v1 = V[0::2]
v2 = V[1::2]
f1 = Counter(v1).most_common(2)
f2 = Counter(v2).most_common(2)
ans = 0
if len(set... | p03244 |
from collections import Counter
n = int(eval(input()))
v = [int(x) for x in input().split()]
odd = sorted(list(Counter(v[0:n:2]).items()), reverse=True, key=lambda x: x[1])
even = sorted(list(Counter(v[1:n+1:2]).items()), reverse=True, key=lambda x: x[1])
if odd[0][0] != even[0][0]:
res = n - odd[0][1] ... | from collections import Counter
n = int(eval(input()))
v = [int(x) for x in input().split()]
v1 = Counter(v[0::2]).most_common() + [(0, 0)]
v2 = Counter(v[1::2]).most_common() + [(0, 0)]
if v1[0] != v2[0]:
res = n - v1[0][1] - v2[0][1]
else:
res = min(n - v1[0][1] - v2[1][1], n - v1[1][1] - v2[0][... | p03244 |
from collections import Counter
n = int(eval(input()))
v_tmp = input().split()
v = [int(_) for _ in v_tmp]
v_count = Counter(v_tmp)
# print(v_count)
if len(v_count) == 1:
print((n//2))
else:
# print("hoge")
v_keys = list(v_count.keys())
tmps = []
# print(v_keys)
for _ in v_keys:
... | from collections import Counter
n = int(eval(input()))
v = [int(_) for _ in input().split()]
v1 = []
v2 = []
for i in range(n):
if i % 2 == 0:
v1.append(v[i])
else:
v2.append(v[i])
v_count = Counter(v)
v1_count = Counter(v1)
v2_count = Counter(v2)
# print("v1_count", v1_count)
# pr... | p03244 |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.