BFS N,M=map(int,input().split()) ab=[] for i in range(M): tmp=list(map(int,input().split())) ab.append(tmp) from collections import defaultdict,deque graph=defaultdict(list) for i in range(M): l=ab[i][0] r=ab[i][1] graph[l].append(r) #grap…

N,M=map(int,input().split()) ab=[] for i in range(M): tmp=list(map(int,input().split())) ab.append(tmp) from collections import defaultdict graph=defaultdict(list) for i in range(M): l=ab[i][0] r=ab[i][1] graph[l].append(r) graph[r].append…

N=int(input()) H=list(map(int,input().split())) inf=1000 ans=0 def func(L,R): global H,ans if L>=R: return mi=inf for i in range(L,R): mi=min(mi,H[i]) ans+=mi for i in range(L,R): H[i]-=mi zero=[] zero.append(-1) for i in range(L,R): if H[…

from itertools import groupby N=int(input()) h=list(map(int,input().split())) g=[] for i,j in enumerate(h): if i==0: pass else: if h[i]-h[i-1]>0: g.append(False) else: g.append(True) ans=0 for k,g in groupby(g): if k==True: moji=len(list(g…

from itertools import groupby S=list(input()) ans="" for k,g in groupby(S): moji=list(g) kosu=len(moji) char=moji[0] ans+=str(char)+str(kosu) print(ans)

from itertools import groupby N=int(input()) S=list(input()) count=0 for k,g in groupby(S): count+=1 print(count)

N,K=map(int,input().split()) a=list(map(int,input().split())) buk=[0 for i in range(1,200001)] for i in a: buk[i]+=1 count=0 for i in buk: if i!=0: count+=1 buk=[i for i in buk if i>0] delete=count-K if delete<=0: print(0) else: div=sorted…

コード N=int(input()) a=list(map(int,input().split())) mod=200 b=[i%200 for i in a] from collections import defaultdict di=defaultdict(int) for i in b: di[i]+=1 result=0 for i in range(200): n=di[i] result+=n*(n-1)//2 print(result) 考え方 …

コード from collections import defaultdict N=int(input()) s=[] for i in range(N): tmp=list(input()) s.append(tmp) data=[] for i in s: tmp=defaultdict(int) for j in i: tmp[j]+=1 data.append(tmp) setset=[set() for i in range(len(data))] for …

コード from collections import defaultdict N=int(input()) a=[] for i in range(N): tmp=int(input()) a.append(tmp) di=defaultdict(int) for i in a: di[i]=1-di[i] count=0 for k,v in di.items(): if v==1: count+=1 print(count) 考え方 defaultdict…

from collections import defaultdict N=int(input()) a=list(map(int,input().split())) di=defaultdict(int) for i in a: di[i]+=1 lost=0 for key,kosu in di.items(): #print(key,kosu) if kosu

N,M,Q=map(int,input().split()) uv=[[0,0]] for i in range(M): tmp=list(map(int,input().split())) uv.append(tmp) color=[0]+list(map(int,input().split())) s=[0] for i in range(Q): tmp=list(map(int,input().split())) s.append(tmp) class Point()…

N,x,y=map(int,input().split()) A=list(map(int,input().split())) M=10000 dp1=[False for i in range(-10000,10001)] dp2=[False for i in range(-10000,10001)] dp3=[0 for i in range(-10000,10001)] dp1[A[0]]=True dp2[0]=True for i in range(1,N): …

s=[] for i in range(9): tmp=list(input()) s.append(tmp) def nagasa(r1,r2): res=(r1[0]-r2[0])**2+(r1[1]-r2[1])**2 ans=pow(res,0.5) return ans zahyou=[] for i in range(9): for j in range(9): if s[i][j]=="#": zahyou.append((i,j)) from itertoo…

N=int(input()) p=list(map(int,input().split())) def prev_permutation(a: list, l: int = 0, r: int = None) -> bool: if r is None: r = len(a) - 1 for i in range(r - 1, l - 1, -1): if a[i] > a[i + 1]: for j in range(r, i, -1): if a[i] > a[j]: …

N,M=map(int,input().split()) ab=[] for i in range(M): tmp=list(map(int,input().split())) ab.append(tmp) ab.insert(0,[0,0]) data=[[] for i in range(N+1)] for i in range(1,M+1): l=ab[i][0] r=ab[i][1] data[l].append(r) data[r].append(l) del d…

S=list(input()) count=-1 for i,j in enumerate(S): if j=="a": count=i+1 print(count)

提出コード N=int(input()) a=list(map(int,input().split())) from functools import reduce import math def my_gcd(*numbers): return reduce(math.gcd, numbers) gcd=my_gcd(*a) a=[i/gcd for i in a] def prime_factorize(n): a = [] while n % 2 == 0:…