code1
stringlengths
17
427k
code2
stringlengths
17
427k
similar
int64
0
1
pair_id
int64
2
181,637B
question_pair_id
float64
3.7M
180,677B
code1_group
int64
1
299
code2_group
int64
1
299
[N,D],*li = [list(map(int,i.split())) for i in open(0)] D = D**2 ans = 0 for x,y in li: if x**2 + y**2 <= D:ans += 1 print(ans)
N = int(input()) if N%2 == 1 or N <= 9: print(0) else: t = 10 ans = 0 while N >= t: ans += N//t t *= 5 print(ans)
0
null
60,760,492,970,940
96
258
n = int(input()) A = list(map(int, input().split())) count = 0 def swap(a, b): t = a a = b b = t return [a, b] def selection_sort(l): global count for i in range(0, len(l)): mini = i for j in range(i, len(l)): if l[j] < l[mini]: mini = j if i != mini: count += 1 l[i], l[mini] = swap(l[i], l[mini]) return l l = selection_sort(A) print(' '.join(str(x) for x in l)) print(count)
def selection_Sort(A,N): count = 0 for i in range(N): minj = i for j in range(i,N): if A[j] < A[minj]: minj = j if i != minj: A[i],A[minj] = A[minj],A[i] count += 1 return (count) if __name__ == '__main__': n = int(input()) data = [int(i) for i in input().split()] result = selection_Sort(data,n) print(" ".join(map(str,data))) print(result)
1
20,046,539,744
null
15
15
#!python3 import sys iim = lambda: map(int, sys.stdin.readline().rstrip().split()) from operator import sub def resolve(): it = map(int, sys.stdin.read().split()) N = next(it) M = 10**9+1 data = [[M, -M], [M, -M]] for x, y in zip(it, it): for i, x in enumerate([x+y, x-y]): for j, f in enumerate([min, max]): data[i][j] = f(data[i][j], x) print(max(map(lambda x: abs(sub(*x)), data))) if __name__ == "__main__": resolve()
N=int(input()) zls=[0 for _ in range(N)] wls=[0 for _ in range(N)] for i in range(N): x,y=[int(s) for s in input().split()] zls[i]=x+y wls[i]=x-y print(max([max(zls)-min(zls),max(wls)-min(wls)]))
1
3,420,698,066,140
null
80
80
m1=m2=m3=0 for i in range(10): m3=max(m3,int(input())) if m3>m2:m2,m3=m3,m2 if m2>m1:m1,m2=m2,m1 print(m1) print(m2) print(m3)
s = input() if s == "RRR": x = 3 elif s == "RRS" or s == "SRR": x = 2 elif s == "SSS": x = 0 else: x = 1 print(x)
0
null
2,417,994,787,560
2
90
import math h,n = map(int,input().split()) sum = 0 li = list(map(int,input().split())) for val in li: sum += val if sum >= h: print("Yes") else: print("No")
import sys sys.setrecursionlimit(10 ** 8) input = sys.stdin.readline def main(): A, B, C = [int(x) for x in input().split()] K = int(input()) cnt = 0 while A >= B: cnt += 1 B *= 2 while B >= C: cnt += 1 C *= 2 if cnt <= K: print("Yes") else: print("No") if __name__ == '__main__': main()
0
null
42,391,951,915,602
226
101
import re s = input() s = re.sub('hi','0',s) s = re.sub('0','',s) if s == '': print('Yes') else: print('No')
a = input().strip() n = len(a) if(n&1 == 1): print("No") else: ans = "Yes" for i in range(0, n, 2): if(a[i:i+2] != "hi"): ans = "No" print(ans)
1
53,218,108,171,488
null
199
199
import sys N, K = map(int, input().split()) if K == 10: print(len(str(N))) sys.exit() p = 0 while True: num = K ** p if N < num: break p += 1 print(p)
def main(): n,k = map(int, input().split()) c = 0 while True: if n >= k ** c: c += 1 else: break print(c) return main()
1
64,208,767,504,760
null
212
212
def main(): n ,m = map(int, input().split(" ")) if n == m: print("Yes") else: print("No") if __name__ == "__main__": main()
# -*- coding:utf-8 -*- n = int(input()) import sys a = input() a = a.split() a = [int(i) for i in a] a.reverse() for i in range(n-1): print(a[i],end = ' ') print(a[n-1])
0
null
42,334,515,275,580
231
53
M1,D1 = list(map(int,input().split())) M2,D2 = list(map(int,input().split())) if (M1 != M2 and M2>M1) or M2 == 1 and M2<M1: print(1) else: print(0)
from sys import stdin m1, d1 = [int(_) for _ in stdin.readline().rstrip().split()] m2, d2 = [int(_) for _ in stdin.readline().rstrip().split()] if m1 == m2: print(0) else: print(1)
1
124,250,658,809,068
null
264
264
import bisect, collections, copy, heapq, itertools, math, string, sys input = lambda: sys.stdin.readline().rstrip() sys.setrecursionlimit(10**7) INF = float('inf') MOD = 998244353 def I(): return int(input()) def F(): return float(input()) def SS(): return input() def LI(): return [int(x) for x in input().split()] def LI_(): return [int(x)-1 for x in input().split()] def LF(): return [float(x) for x in input().split()] def LSS(): return input().split() def resolve(): N, K = LI() LR = [LI() for _ in range(K)] dp = [0] * (N + 1) dp[0] = 1 a = [0] * (N + 1) a[0] = 1 a[1] = -1 for i in range(N): for l, r in LR: left = min(i + l, N) right = min(i + r + 1, N) a[left] += dp[i] a[right] -= dp[i] dp[i+1] += dp[i] + a[i+1] dp[i+1] %= MOD # print(a) # print(dp) print(dp[-2]) if __name__ == '__main__': resolve()
n, m = map(int, input().split()) ab = [] for i in range (m): ab.append(list(map(int, input().split()))) par = [-1] * (n+1) #Union Find #xの根を求める def find(x): if par[x] < 0: return x else: tank = [] while par[x] >= 0: tank.append(x) x = par[x] for elt in tank: par[elt] = x return x #xとyの属する集合の併合 def unite(x,y): x = find(x) y = find(y) if x == y: return else: #sizeの大きいほうがx if par[x] > par[y]: x,y = y,x par[x] += par[y] par[y] = x return for j in range(m): unite(ab[j][0], ab[j][1]) m = -1*min(par) print(m)
0
null
3,343,200,669,672
74
84
k = int(input()) if 7 % k == 0: print(1) else: a = [] a.append(7 % k) t = 0 for i in range(2, k+1): x = (10 * a[i - 2] + 7) % k if x == 0: print(i) break else: a.append(x) t += 1 if t == k - 1: print(-1)
import sys #import time from collections import deque, Counter, defaultdict #from fractions import gcd import bisect import heapq #import math import itertools import numpy as np input = sys.stdin.readline sys.setrecursionlimit(10**8) inf = 10**18 MOD = 1000000007 ri = lambda : int(input()) rs = lambda : input().strip() rl = lambda : list(map(int, input().split())) k = ri() reses=[] cnt = 1 tmp = 7 for i in range(k+1): res = tmp % k if res==0: print(cnt) sys.exit(0) tmp = res * 10 + 7 cnt += 1 print(-1)
1
6,184,708,742,812
null
97
97
nums = input().split() print(int(nums[0]) * int(nums[1]))
s = input() l = s.split(" ") a,b = int(l[0]), int(l[1]) print(a*b)
1
15,788,599,004,696
null
133
133
N = int(input()) A = [(a, i) for i, a in enumerate(map(int, input().split()), start=1)] A.sort(reverse=True) dp = [[0] * (N + 1) for _ in range(N + 1)] for s, (a, i) in enumerate(A): for l in range(s + 1): r = s - l dp[l + 1][r] = max(dp[l + 1][r], dp[l][r] + a * (i - (l + 1))) dp[l][r + 1] = max(dp[l][r + 1], dp[l][r] + a * (N - r - i)) ans = 0 for i in range(N + 1): ans = max(ans, dp[i][N - i]) print(ans)
# スコアが高い順に右端 or 左端に置く事を考える # dp[i][l] : l番目まで左に子がいる状態でi番目の子を動かす時の最大値 n = int(input()) tmp = [int(x) for x in input().split()] aList=[] for i in range(n): aList.append([tmp[i],i]) aList.sort(reverse=True) dp=[[int(-1) for i in range(n+1)] for j in range(n+1)] dp[0][0] = 0 # スコアが高い順にi人動かす for i in range(n): # 左側に置いた人数。i番目のループでは0〜i人まで左端に置く可能性がある for l in range(i+1): activity = aList[i][0] pos = aList[i][1] # 右端の今のポジション # totalで置いた数-左側に置いた数(i-l)を計算し、右端(n-1)から引く r = n-1-(i-l) # 左に置いた場合 dp[i+1][l+1] = max(dp[i+1][l+1],dp[i][l] + abs(l-pos) * activity) # 右に置いた場合 dp[i+1][l] = max(dp[i+1][l],dp[i][l] + abs(r-pos) * activity) print(max(dp[n]))
1
33,466,039,296,040
null
171
171
h,w,k = map(int,input().split()) s = [list(map(int,input())) for _ in range(h)] ans = h*w for div in range(1<<(h-1)): row = 0 S = [[0]*w] S[row] = [s[0][i] for i in range(w)] for i in range(1,h): if 1&(div>>i-1): row += 1 S.append([s[i][j] for j in range(w)]) else: S[row] = [S[row][j]+s[i][j] for j in range(w)] count = [0]*(row+1) ans_ = row a = True for i in range(w): for j in range(row+1): if S[j][i] > k: a = False break count[j] += S[j][i] if count[j] > k: ans_+=1 count = [0]*(row+1) for l in range(row+1): count[l] += S[l][i] break if ans_ >= ans or a==False: break if a: ans = min(ans,ans_) print(ans)
n,k=map(int,input().split()) s=list(map(int,input().split())) z=0 for i in range(n): if s[i]>=k: z+=1 print(z)
0
null
113,444,080,606,830
193
298
S,T = [i for i in input().split()] print(T+S)
S, T = input().split() ans = T + S print(ans)
1
103,248,613,736,510
null
248
248
n = int(input()) a = list(map(int, input().split(" "))) for lil_a in a[-1:0:-1]: print("%d "%lil_a, end="") print("%d"%a[0])
n = input() list = raw_input().split(" ") list.reverse() print " ".join(list)
1
1,003,404,860,864
null
53
53
N,M = map(int,input().split()) ans = [-1]*N flg = 0 for i in range(M): s,c = map(int, input().split()) s -= 1 if ans[s] == -1 or ans[s] == c: ans[s] = c else: flg = 1 if flg == 0: if N == 1 and ans[0] == -1 or N == 1 and ans[0] == 0: print("0") elif ans[0] == 0: print("-1") else: if ans[0] == -1: ans[0] = 1 for i in range(1,N): if ans[i] == -1: ans[i] = 0 print(int("".join(map(str,ans)))) else: print("-1")
def Next(): return input() def NextInt(): return int(Next()) def NextInts(): return map(int,input().split()) def Nexts(): return map(str,input().split()) def NextIntList(): return list(map(int,input().split())) def RowInts(n): return [input() for i in range(n)] s = input() if s[-1] == 's': s = s + 'es' else: s = s + 's' print(s)
0
null
31,399,696,163,708
208
71
D=int(input()) c=[int(i) for i in input().split()] a=[] for i in range(D): a.append([int(i) for i in input().split()]) last=[0 for i in range(26)] zoku=0 for d in range(D): t=int(input()) zoku+=a[d][t-1] last[t-1]=d+1 for i in range(26): zoku-=c[i]*(d+1-last[i]) print(zoku)
#!/usr/bin/env python3 l = int(input()) q = l / 3 print(q ** 3)
0
null
28,332,392,104,322
114
191
import sys sys.setrecursionlimit(10**7) #再帰関数の上限,10**5以上の場合python import math from copy import copy, deepcopy from copy import deepcopy as dcp from operator import itemgetter from bisect import bisect_left, bisect, bisect_right#2分探索 #bisect_left(l,x), bisect(l,x)#aはソート済みである必要あり。aの中からx未満の要素数を返す。rightだと以下 from collections import deque #deque(l), pop(), append(x), popleft(), appendleft(x) ##listでqueの代用をするとO(N)の計算量がかかってしまうので注意 from collections import Counter#文字列を個数カウント辞書に、 #S=Counter(l),S.most_common(x),S.keys(),S.values(),S.items() from itertools import accumulate,combinations,permutations#累積和 #list(accumulate(l)) from heapq import heapify,heappop,heappush #heapify(q),heappush(q,a),heappop(q) #q=heapify(q)としないこと、返り値はNone #import fractions#古いatcoderコンテストの場合GCDなどはここからimportする from functools import lru_cache#pypyでもうごく #@lru_cache(maxsize = None)#maxsizeは保存するデータ数の最大値、2**nが最も高効率 from decimal import Decimal def input(): x=sys.stdin.readline() return x[:-1] if x[-1]=="\n" else x def printl(li): _=print(*li, sep="\n") if li else None def argsort(s, return_sorted=False): inds=sorted(range(len(s)), key=lambda k: s[k]) if return_sorted: return inds, [s[i] for i in inds] return inds def alp2num(c,cap=False): return ord(c)-97 if not cap else ord(c)-65 def num2alp(i,cap=False): return chr(i+97) if not cap else chr(i+65) def matmat(A,B): K,N,M=len(B),len(A),len(B[0]) return [[sum([(A[i][k]*B[k][j]) for k in range(K)]) for j in range(M)] for i in range(N)] def matvec(M,v): N,size=len(v),len(M) return [sum([M[i][j]*v[j] for j in range(N)]) for i in range(size)] def T(M): n,m=len(M),len(M[0]) return [[M[j][i] for j in range(n)] for i in range(m)] def main(): mod = 1000000007 #w.sort(key=itemgetter(1),reversed=True) #二個目の要素で降順並び替え N = int(input()) #N, K = map(int, input().split()) A = tuple(map(int, input().split())) #1行ベクトル #L = tuple(int(input()) for i in range(N)) #改行ベクトル #S = tuple(tuple(map(int, input().split())) for i in range(N)) #改行行列 def lcm(a,b): #return (a * b *pow(math.gcd(a, b),mod-2,mod))%mod return (a*b//math.gcd(a,b)) x=1 for a in A: x=lcm(a,x) #print(x) x%=mod ans=0 for a in A: ans=(ans+x*pow(a,mod-2,mod))%mod print(ans) if __name__ == "__main__": main()
N, M = map(int, input().split()) SC = [list(map(int, input().split())) for _ in range(M)] li = [-1] * N for s, c in SC: if li[s - 1] == -1: li[s - 1] = c else: if not li[s - 1] == c: print(-1) exit() ans = "" if N == 1: print(max(0, li[0])) exit() for i in range(N): if i == 0: if li[i] == 0: print(-1) exit() else: ans += str(max(li[i], 1)) else: ans += str(max(0, li[i])) print(ans)
0
null
74,501,625,597,798
235
208
A = list(map(int,input().split())) if A[0] < A[1]*2: print(0) else: print(A[0]-A[1]*2)
inp = list(map(int, input().split())) a, b = inp[0], inp[1] if a > b*2: print(a-b*2) else: print(0)
1
166,408,978,284,902
null
291
291
from math import sqrt, pow x1, y1, x2, y2 = list(map(float, input().split())) print(sqrt(pow(x1 - x2, 2) + pow(y1 - y2, 2)))
import math x1,y1,x2,y2 =map(float, input().split()) length = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) print("{0:04f}".format(length))
1
159,130,180,158
null
29
29
import sys def input(): return sys.stdin.readline().rstrip() import math X = int(input()) ans = False money = 100 year = 0 while money < X: money += money // 100 year += 1 print(year)
x=int(input()) cost=100 for i in range(1,10000000000): cost+=cost//100 if cost>=x: print(i) break
1
27,303,845,074,400
null
159
159
import itertools for i,j in itertools.product(xrange(1,10),repeat=2): print '{0}x{1}={2}'.format(i,j,i*j)
a = [x for x in range(9)] for i in a: for j in a: print("{}x{}={}".format(i+1,j+1,(i+1)*(j+1)))
1
1,064,988
null
1
1
import bisect import math N, D, A = map(int, input().split()) XH_array = [list(map(int, input().split())) for _ in range(N)] XH_array = sorted(XH_array, key=lambda x: x[0]) X_array = [xh[0] for xh in XH_array] # print(X_array) ans = 0 bomb_count = [0] * N now_bomb = 0 for i, xh in enumerate(XH_array): # print(now_bomb, bomb_count) x, h = xh remain = h - A * now_bomb if remain <= 0: now_bomb += bomb_count[i] continue bomb_add = math.ceil(remain / A) ans += bomb_add bomb_count[i] += bomb_add bomb_end = bisect.bisect_right(X_array, x + 2 * D) bomb_count[bomb_end - 1] -= bomb_add now_bomb += bomb_count[i] print(ans)
h,w,k = map(int, input().split()) s = [[int(c) for c in input()] for i in range(h)] ans = 114514893 for bit in range(1 << (h-1)): cut = [-1] for i in range(h-1): if bit & (1 << i) : cut.append(i) cut.append(h-1) l = len(cut)-1 count = l-1 suml = [0 for i in range(l)] ok = True for i in range(w): sumtemp = [0 for ii in range(l)] flag2 = True #kを超えないかどうか for j in range(l): for kk in range(cut[j]+1,cut[j+1]+1): sumtemp[j] = sumtemp[j] + s[kk][i] if sumtemp[j] > k: ok = False break if not ok : break for j in range(l): if suml[j]+sumtemp[j] > k:flag2 = False if flag2: for j in range(l): suml[j] = suml[j]+sumtemp[j] else: count += 1 suml = sumtemp[:] if not ok:continue ans = min(ans,count) print(ans)
0
null
65,347,063,170,432
230
193
N = int(input()) A = list(map(int, input().split())) A = sorted(A) L = [0] * (A[-1]+1) for a in A: L[a] = 1 for p in A: if not L[p]: continue L[p] += 1 n = 2 while p*n <= A[-1]: L[p*n] = 0 n += 1 ans = L.count(2) print(ans)
n = int(input()) lst = [int(i) for i in input().split()] lst.sort() #print(lst) if 1 in lst: count = 0 for i in range(n): if lst[i] == 1: count += 1 if count == 2: break if count == 1: print(1) else: print(0) else: tf_lst = [1] * lst[n - 1] count = 0 if n > 1: pre = 0 for i in range(n): tf_lst[pre:lst[i] - 1] = [0] * (lst[i] - pre - 1) pre = lst[i] if tf_lst[lst[i] - 1] == 0: continue if i <= n - 2: if lst[i] == lst[i + 1]: tf_lst[lst[i] - 1] = 0 for j in range(lst[i] * 2, lst[n - 1] + 1, lst[i]): tf_lst[j - 1] = 0 #print(tf_lst) for i in tf_lst: count += i else: count += 1 print(count)
1
14,576,819,504,620
null
129
129
def solve(): N = int(input()) A = list(map(int, input().split())) MOD = 1000000007 color = [0] * N can_use = [0] * (N + 1) can_use[0] = 3 for i in range(N): color[i] = can_use[A[i]] can_use[A[i]] -= 1 can_use[A[i] + 1] += 1 ans = 1 for c in color: ans = ans * c % MOD print(ans) if __name__ == '__main__': solve()
while True: try: a=map(int,raw_input().split()) print len(str(a[0]+a[1])) except: break
0
null
65,110,395,173,340
268
3
# B - Papers, Please N = int(input()) my_list = list(input().split()) j = 0 for i in range(0, N): if int(my_list[i]) % 2 == 0: if int(my_list[i]) % 3 != 0 and int(my_list[i]) % 5 != 0: j += 1 if j != 0: print('DENIED') else: print('APPROVED')
n = int(input()) ls = [] rs = [] for _ in range(n): x, y = map(int, input().split()) ls.append(x) rs.append(y) ls = sorted(ls) rs = sorted(rs) if n % 2 == 1: print(rs[len(rs)//2] - ls[len(ls)//2] + 1) else: a = (rs[len(rs)//2-1] * 10 + rs[len(rs)//2] * 10) // 2 b = (ls[len(ls)//2-1] * 10 + ls[len(ls)//2] * 10) // 2 print((a - b) // 5 + 1)
0
null
42,968,036,037,322
217
137
# -*- coding: utf-8 -*- def main(): n = int(input()) keihin_set = set() for i in range(n): s = input() if not s in keihin_set: keihin_set.add(s) print(len(keihin_set)) if __name__ == "__main__": main()
while True: number_of_input = int(raw_input()) if number_of_input == 0: break values = [float(x) for x in raw_input().split()] second_moment = sum([x * x for x in values]) / number_of_input first_moment = sum([x for x in values]) / number_of_input print(second_moment - first_moment ** 2.0) ** 0.5
0
null
15,118,189,463,748
165
31
i = map(str, raw_input()) def check(x): if x.islower(): return x.upper() else: return x.lower() ret = [] for x in i: ret += [check(x)] print ''.join(ret)
from string import ascii_lowercase as LOW from string import ascii_uppercase as UP a = {l:u for l,u in zip(list(LOW),list(UP))} b = {u:l for u,l in zip(list(UP),list(LOW))} a.update(b) data = input() data = [a[s] if s in a else s for s in data] data = ''.join(data) print(data)
1
1,526,853,643,920
null
61
61
def selection_sort(a,n): count=0 for i in range(n): ch=False minj=i for j in range(i,n): if a[j] < a[minj]: minj = j ch = True if(ch): count+=1 a[i],a[minj] = a[minj],a[i] return count if __name__ == "__main__": n=int(input()) a=list(map(int,input().split())) count=selection_sort(a,n) print(*a) print(count)
n = map(int, input().split()) print('bust' if sum(n) >= 22 else 'win')
0
null
59,215,748,114,300
15
260
import math a,b,c=map(float,input().split()) if c<90: e=c*math.pi/180 S=a*b*1/2*math.sin(e) t=a**2+b**2-2*a*b*math.cos(e) r=math.sqrt(t) L=a+b+r h=b*math.sin(e) print('{:.08f}'.format(S)) print('{:.08f}'.format(L)) print('{:.08f}'.format(h)) if c==90: e=c*math.pi/180 S=a*b*1/2*math.sin(e) t=a**2+b**2-2*a*b*math.cos(e) r=math.sqrt(t) L=a+b+r h=b print('{:.08f}'.format(S)) print('{:.08f}'.format(L)) print('{:.08f}'.format(h)) if c>90: e=c*math.pi/180 d=180*math.pi/180 f=d-e S=a*b*1/2*math.sin(e) t=a**2+b**2-2*a*b*math.cos(e) r=math.sqrt(t) L=a+b+r h=b*math.sin(f) print('{:.08f}'.format(S)) print('{:.08f}'.format(L)) print('{:.08f}'.format(h))
import math a, b, c = map(float, input().split()) s = a*b*math.sin(math.radians(c))/2 h = 2*s/a l = a + b + (a**2+b**2 - 2*a*b*math.cos(math.radians(c)))**0.5 print("{0:.5f} {1:.5f} {2:.5f}".format(s,l,h))
1
166,907,150,720
null
30
30
N,M = map(int,input().split()) ac = (N+1)*[0] wa = (N+1)*[0] pt = 0 for i in range(M): p,s = input().split() p = int(p) if ac[p] == 0 and s == "AC": ac[p] = 1 pt += wa[p] wa[p] += 1 print(sum(ac),pt)
# -*- coding: utf-8 -*- import sys from collections import deque, defaultdict from math import sqrt, factorial # def input(): return sys.stdin.readline()[:-1] # warning not \n # def input(): return sys.stdin.buffer.readline().strip() # warning bytes # def input(): return sys.stdin.buffer.readline().decode('utf-8') def solve(): n, m = [int(x) for x in input().split()] ac = set() pen = defaultdict(int) pp = 0 for _ in range(m): p, S = [x for x in input().split()] if p not in ac and S == 'AC': ac.add(p) pp += pen[p] else: if not p in ac: pen[p] += 1 print(len(ac), pp) t = 1 # t = int(input()) for case in range(1,t+1): ans = solve() """ """
1
93,506,756,440,900
null
240
240
input_line = input().split(" ") S = int(input_line[0]) W = int(input_line[1]) if S > W: print("safe") else: print("unsafe")
import sys n,m = map(int, input().split()) num = [0]*n al = [-1]*n Ans = 0 for i in range(m): s,c = map(int, input().split()) if num[s-1] != 0 and num[s-1] != c: print(-1) sys.exit() else: num[s-1] = c al[s-1] = c if al.count(0)==n and n >= 2: print(-1) sys.exit() if al[0] == 0and n >= 2: print(-1) sys.exit() if num[0] == 0 and n >= 2: num[0] = 1 for i in range(len(num)): Ans = Ans + num[i] * (10 ** (n-i-1)) if Ans == 0 and n >= 2: print(-1) else: print(Ans)
0
null
44,754,951,746,092
163
208
# -*- coding: utf-8 -*- l = input() S1, S2 = [], [] sum = 0 n = len(l) for i in range(n): if l[i] == "\\": S1.append(i) elif l[i] == "/" and S1: j = S1.pop() a = i - j sum += a while S2 and S2[-1][0] > j: a += S2.pop()[1] S2.append([j, a]) print(sum) print(len(S2), *(a for j, a in S2))
danmen = input() down = [] edge = [] pool = [] for (i, line) in enumerate(danmen): if line == "\\": down.append(i) elif down and line == "/": left = down.pop() area = i - left while edge: if edge[-1] > left: edge.pop() area += pool.pop() else: break edge.append(left) pool.append(area) print(sum(pool)) print(len(pool), *pool)
1
60,890,148,880
null
21
21
n = int(input()) T_point = 0 H_point = 0 for i in range(n): Taro, Hanako = input().split() if Taro > Hanako: T_point += 3 elif Hanako > Taro: H_point += 3 else: T_point += 1 H_point += 1 print(T_point, H_point)
from collections import deque n,u,v=map(int,input().split()) G=[[] for i in range(n)] dist_u=[-1]*n dist_v=[-1]*n for i in range(n-1): a,b=map(int,input().split()) G[a-1].append(b-1) G[b-1].append(a-1) u-=1 v-=1 dist_u[u]=0 q=deque([u]) while q: cur=q.popleft() for nx in G[cur]: if dist_u[nx]==-1: q.append(nx) dist_u[nx]=dist_u[cur]+1 dist_v[v]=0 q=deque([v]) while q: cur=q.popleft() for nx in G[cur]: if dist_v[nx]==-1: q.append(nx) dist_v[nx]=dist_v[cur]+1 ans=0 for i in range(n): if dist_u[i]<dist_v[i] and dist_v[i]>=ans: ans=dist_v[i] print(ans-1)
0
null
59,732,883,390,578
67
259
#import sys #import numpy as np import math #from fractions import Fraction import itertools from collections import deque from collections import Counter #import heapq #from fractions import gcd #input=sys.stdin.readline import bisect a,b,c=map(int,input().split()) if 4*a*b<(c-a-b)**2 and (c-a-b)>0: print("Yes") else: print("No")
from decimal import Decimal A,B,C=map(str,input().split()) if Decimal(A)**Decimal("0.5")+Decimal(B)**Decimal("0.5")<Decimal(C)**Decimal("0.5"): print("Yes") else: print("No")
1
51,546,360,404,954
null
197
197
n = int(input()) num_list = [int(i) for i in input().split(" ")] a = min(num_list) b = max(num_list) c = sum(num_list) print("{0} {1} {2}".format(a, b, c))
def main(): N = int(input()) A = [int(i) for i in input().split()] ma = A[0] ans = 0 for a in A: ma = max(ma, a) ans += ma - a print(ans) if __name__ == '__main__': main()
0
null
2,672,183,108,670
48
88
import sys def solve(): input = sys.stdin.readline N, M = map(int, input().split()) S = input().strip("\n") now = N ans = [] while now > 0: for i in reversed(range(1, M+1)): if now - i < 0: continue elif S[now - i] == "0": ans.append(i) now -= i break else: print(-1) break else: A = [int(ans[-1 - i]) for i in range(len(ans))] print(" ".join(map(str, A))) return 0 if __name__ == "__main__": solve()
import sys input = sys.stdin.readline def main(): N, M = map(int, input().split()) S = input() ans = [] check = [False] * (N+1) idx = N while 0 < idx: f = False for i in range(M, 0, -1): if idx-i < 0: continue if S[idx-i] == '1': if check[idx-i]: print(-1); sys.exit() else: check[idx-i] = True else: ans.append(i) idx -= i f = True break if not f: print(-1); sys.exit() for a in ans[::-1]: print(a) if __name__ == '__main__': main()
1
139,016,207,335,840
null
274
274
# http://judge.u-aizu.ac.jp/onlinejudge/description.jsp?id=ALDS1_10_A&lang=ja import sys read = sys.stdin.read readline = sys.stdin.readline readlines = sys.stdin.readlines def main(): n = int(readline()) dp = [0] * (n+1) dp[0] = 1 dp[1] = 1 for i in range(2,n+1): dp[i] = dp[i-1] + dp[i-2] print(dp[n]) if __name__ == "__main__": main()
def main(): k = int(input()) a, b = (int(i) for i in input().split()) for i in range(a, b+1): if i % k == 0: print('OK') return print('NG') main()
0
null
13,405,775,054,588
7
158
#!/usr/bin/env python3 # Generated by https://github.com/kyuridenamida/atcoder-tools from typing import * import collections import functools import itertools import math import sys INF = float('inf') def solve(H: int): return 1 if H == 1 else solve(H//2) * 2 + 1 def main(): sys.setrecursionlimit(10 ** 6) def iterate_tokens(): for line in sys.stdin: for word in line.split(): yield word tokens = iterate_tokens() H = int(next(tokens)) # type: int print(f'{solve(H)}') if __name__ == '__main__': main()
h=int(input()) num=1 cnt=0 while h!=1: h=h//2 cnt+=num num*=2 cnt+=num print(cnt)
1
79,972,575,959,088
null
228
228
s = input() s1, s2 = [], [] ans = 0 for i in range(len(s)): if s[i] == "\\": s1.append(i) if s[i] == "/" and s1: j = s1.pop() a = i - j ans += a while s2 and s2[-1][0] > j: a += s2.pop()[1] s2.append([j, a]) print(ans) print(len(s2), *(a for j, a in s2))
# coding: utf-8 s = list(input().rstrip()) ht = [] ponds=[] for i, ch in enumerate(s): if ch == "\\": ht.append(i) elif ch == "/": if ht: b = ht.pop() ap = i - b if not ponds: ponds.append([b, ap]) else: while ponds: p = ponds.pop() if p[0] > b: ap += p[1] else: ponds.append([p[0],p[1]]) break ponds.append([b,ap]) else: pass ans = "" area = 0 for point, ar in ponds: area += ar ans += " " ans += str(ar) print(area) print(str(len(ponds)) + ans)
1
56,095,624,928
null
21
21
W = list(input()) ans = [] a = 0 for i in W: if i == 'R': a += 1 else: ans.append(a) a = 0 ans.append(a) print(max(ans))
s = input() ans = 0 strek = 0 for i in range(3): if s[i] == 'R': tmp = "R" strek += 1 ans = max(strek, ans) else: strek = 0 print(ans)
1
4,883,843,062,688
null
90
90
# -*- config: utf-8 -*- if __name__ == '__main__': for i in range(int(raw_input())): nums = map(lambda x:x**2,map(int,raw_input().split())) flg = False for i in range(3): s = int(0) for j in range(3): if i == j : continue s += nums[j] if s == nums[i] : flg = True if flg == True : print "YES" else : print "NO"
import itertools n = int(input()) tastes = list(map(int, input().split())) ans_lists = [] for v in itertools.combinations(tastes, 2): cure = v[0]*v[1] ans_lists.append(cure) ans = 0 for i in ans_lists: ans += i print(ans)
0
null
84,252,511,727,388
4
292
# -*- coding: utf-8 -*- # E import sys from collections import defaultdict, deque from heapq import heappush, heappop import math import bisect input = sys.stdin.readline # 再起回数上限変更 # sys.setrecursionlimit(1000000) n = int(input()) d1 = [] * n d2 = [] * n for i in range(n): x, y = map(int, input().split()) d1.append(x+y) d2.append(x-y) print(max(max(d1) - min(d1), max(d2)-min(d2)))
N=int(input()) arr=[list(map(int,input().split())) for i in range(N)] za,wa=-10**10,-10**10 zi,wi=10**10,10**10 for i in range(N): z=arr[i][0]+arr[i][1] w=arr[i][0]-arr[i][1] za=max(z,za) zi=min(z,zi) wa=max(w,wa) wi=min(w,wi) print(max(za-zi,wa-wi))
1
3,420,397,483,214
null
80
80
a = "" while True: try: a += input().lower() except: break for i in range(ord("a"), ord("z")+1): print("{} : {}".format(chr(i), a.count(chr(i))))
N = int(input()) A = list(map(int, input().split())) node = 1 # 作成しなければならない葉の残りの数 leaf = sum(A) max_node = 1 judge = True ans = 0 for i, a in enumerate(A): ans += node leaf -= a if node < a+1 and leaf > 0: judge = False break # 次の深さのノード max_node = (node - a) * 2 node = min(leaf, max_node) if judge and max_node == 0: print(ans) else: print(-1)
0
null
10,280,458,174,028
63
141
s=1 while True: i=input() if i=='0': break print('Case '+str(s)+':', i) s+=1
i = 1 while True: a = int(input()) if(a == 0): break else : print(f'Case {i}: {a}') i += 1
1
488,284,300,000
null
42
42
H, W = map(int, input().split()) stage = [] scores = [] for _ in range(H): stage.append(list(input())) scores.append([float('inf')] * W) if stage[0][0] == '#': scores[0][0] = 1 else: scores[0][0] = 0 move = [[0, 1], [1, 0]] for y in range(H): for x in range(W): for dx, dy in move: nx, ny = x + dx, y + dy if H <= ny or W <= nx: continue if stage[ny][nx] == '#' and stage[y][x] == '.': scores[ny][nx] = min(scores[ny][nx], scores[y][x] + 1) else: scores[ny][nx] = min(scores[ny][nx], scores[y][x]) # print(*scores, sep='\n') print(scores[-1][-1])
#!/usr/bin/env python3 import sys def solve(H: int, W: int, s: "List[str]"): dp = [[0 for w in range(W)] for h in range(H)] # dp[h][w]はh,wに達するための回数 if s[0][0] == '#': dp[0][0] = 1 for w in range(W-1): # 0行目について if s[0][w+1] == '.': # 移動先が白だったら特に変わりなし dp[0][w+1] = dp[0][w] elif s[0][w] == '.' and s[0][w+1] == '#': # 移動元が白で先が黒ならば、新しく施行1回追加 dp[0][w+1] = dp[0][w] + 1 elif s[0][w] == '#' and s[0][w+1] == '#': # 移動元も先も黒だったとしたら、試行回数は変わらない dp[0][w+1] = dp[0][w] for h in range(H-1): # 1列目について if s[h+1][0] == '.': dp[h+1][0] = dp[h][0] elif s[h][0] == '.' and s[h+1][0] == '#': dp[h+1][0] = dp[h][0] + 1 elif s[h][0] == '#' and s[h+1][0] == '#': dp[h+1][0] = dp[h][0] for h in range(1, H): for w in range(W-1): if s[h][w+1] == '.': dp[h][w+1] = min(dp[h][w], dp[h-1][w+1]) elif s[h][w] == '.' and s[h][w+1] == '#': if s[h-1][w+1] == '.': dp[h][w+1] = min(dp[h][w]+1, dp[h-1][w+1]+1) elif s[h-1][w+1] == '#': dp[h][w+1] = min(dp[h][w]+1, dp[h-1][w+1]) elif s[h][w] == '#' and s[h][w+1] == '#': if s[h-1][w+1] == '.': dp[h][w+1] = min(dp[h][w], dp[h-1][w+1]+1) elif s[h-1][w+1] == '#': dp[h][w+1] = min(dp[h][w], dp[h-1][w+1]) print(dp[H-1][W-1]) return # Generated by 1.1.7.1 https://github.com/kyuridenamida/atcoder-tools (tips: You use the default template now. You can remove this line by using your custom template) def main(): def iterate_tokens(): for line in sys.stdin: for word in line.split(): yield word tokens = iterate_tokens() H = int(next(tokens)) # type: int W = int(next(tokens)) # type: int s = [next(tokens) for _ in range(H)] # type: "List[str]" solve(H, W, s) if __name__ == '__main__': main()
1
49,416,573,667,388
null
194
194
k = int(input()) a,b = map(int,input().split()) if b//k - (a-1)//k > 0: print("OK") else: print("NG")
K = int(input()) A, B = map(int, input().split()) for n in range(A, B+1): if n%K ==0: print("OK") exit() print("NG")
1
26,452,626,315,420
null
158
158
import sys N,K=map(int, sys.stdin.readline().split()) LR=[ map(int, sys.stdin.readline().split()) for _ in range(K) ] dp=[0]*(N+1) sum_dp=[0] mod=998244353 i=1 dp[i]=1 sum_dp.append(sum_dp[-1]+dp[i]) for i in range(2,N+1): for l,r in LR: dp[i]+=sum_dp[max(0,i-l)]-sum_dp[max(0,i-r-1)] dp[i]%=mod sum_dp.append( (sum_dp[-1]+dp[i])%mod ) print dp[-1]
import numpy as np N,K = list(map(int, input().split())) LRs = [list(map(int, input().split())) for _ in range(K)] dp = np.zeros(N+2, dtype = int) dp[1] = 1 dp[2] = -1 atai = 0 for i in range(1, N+2): atai += dp[i] for LR in LRs: if(i+LR[0] <= N): dp[i+LR[0]] = (dp[i+LR[0]] + atai) % 998244353 if(i+LR[1] <= N): dp[i+LR[1]+1] = (dp[i+LR[1]+1] -atai) % 998244353 # print(dp) #復元 ruisekiwa = [0] for hoge in dp: ruisekiwa.append(ruisekiwa[-1]+hoge) print(ruisekiwa[N+1] % 998244353)
1
2,682,443,397,408
null
74
74
a, op, b = input().split() a = int(a) b = int(b) L = [] while op != "?": L.append([a, b, op]) a, op, b = input().split() a = int(a) b = int(b) for (a, b, op) in L: if op == "+": print(str(a + b)) elif op == "-": print(str(a - b)) elif op == "*": print(str(a * b)) else: print(str(a // b))
import copy def bubble_sort(C, N): for i in range(N): for j in range(N-1, i, -1): if C[j][1] < C[j-1][1]: C[j], C[j-1] = C[j-1], C[j] def selection_sort(C, N): for i in range(N): minj = i for j in range(i+1, N): if C[j][1] < C[minj][1]: minj = j C[i], C[minj] = C[minj], C[i] def is_stable(in0, out0): for m in '123456789': in1 = list(filter(lambda e:e[1]==m, in0)) out1 = list(filter(lambda e:e[1]==m, out0)) #print(in1,out1) if in1 != out1: return 'Not stable' return 'Stable' N = int(input()) C = list(input().split()) C1 = copy.deepcopy(C) C2 = copy.deepcopy(C) bubble_sort(C1, N) selection_sort(C2, N) print(*C1) print(is_stable(C, C1)) print(*C2) print(is_stable(C, C2))
0
null
348,767,836,760
47
16
moji = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ' memo = {} for i in range(len(moji)): memo.setdefault(moji[i],i) #print(memo) n = int(input()) s = str(input()) ans = '' for i in range(len(s)): ans += moji[(memo[s[i]]+n)%26] print(ans)
#!/usr/bin/env python3 # Generated by https://github.com/kyuridenamida/atcoder-tools from typing import * import collections import functools import itertools import math import sys INF = float('inf') def solve(N: int, S: str): return "".join(chr((ord(c) - ord('A') + N) % 26 + ord('A')) for c in S) def main(): sys.setrecursionlimit(10 ** 6) def iterate_tokens(): for line in sys.stdin: for word in line.split(): yield word tokens = iterate_tokens() N = int(next(tokens)) # type: int S = next(tokens) # type: str print(f'{solve(N, S)}') if __name__ == '__main__': main()
1
134,485,762,899,820
null
271
271
t1,t2 = map(int,input().split()) a1,a2 = map(int,input().split()) b1,b2 = map(int,input().split()) sum_a = t1 * a1 + t2 * a2 sum_b = t1 * b1 + t2 * b2 if sum_a == sum_b: print('infinity') exit() if sum_a > sum_b: big_sum = sum_a big_1 = a1*t1 big_2 = a2*t2 sml_sum = sum_b sml_1 = b1*t1 sml_2 = b2*t2 else: big_sum = sum_b big_1 = b1*t1 big_2 = b2*t2 sml_sum = sum_a sml_1 = a1*t1 sml_2 = a2*t2 if sml_1 < big_1: print(0) exit() #print(big_sum,sml_sum) n = (big_1-sml_1) // (sml_sum-big_sum) if (big_1-sml_1) % (sml_sum-big_sum) == 0: print(n*2) else: print(n*2+1)
import sys input = sys.stdin.readline T = list(map(int, input().split())) a = list(map(int, input().split())) b = list(map(int, input().split())) p = (a[0] - b[0]) * T[0] q = (a[1] - b[1]) * T[1] if p > 0: p *= -1 q *= -1 if p + q < 0: print(0) elif p + q > 0: print(-p // (p + q) * 2 + ((-p % (p + q)) > 0)) else: print("infinity")
1
131,633,855,791,750
null
269
269
n,k=map(int,input().split()) if n<=9: print(k+(100*(10-n))) else: print(k)
import sys import math import itertools import bisect from copy import copy from collections import deque,Counter from decimal import Decimal def s(): return input() def i(): return int(input()) def S(): return input().split() def I(): return map(int,input().split()) def L(): return list(input().split()) def l(): return list(map(int,input().split())) def lcm(a,b): return a*b//math.gcd(a,b) sys.setrecursionlimit(10 ** 9) INF = 10**9 mod = 10**9+7 N,R = I() if N < 10: print(R+(10-N)*100) else: print(R)
1
63,604,588,007,470
null
211
211
import math N = int(input()) print(math.ceil(N / 1000) * 1000 - N)
N = int(input()) ans = 0 if N % 1000 == 0: print(ans) else: a = N // 1000 ans = (a+1)*1000 - N print(ans)
1
8,470,043,184,990
null
108
108
i = 0 x = int(input()) while x != 0: i += 1 print("Case ", i, ": ", x, sep="") x = int(input())
N, K = map(int, input().split()) mod = 10**9+7 gcd_l = [0]*K for i in range(K, 0, -1): n = pow((K//i), N, mod) for x in range(i, K+1, i): n -= gcd_l[K-x] gcd_l[K-i] = n%mod res = 0 for i in range(K): res += (gcd_l[i] * (K-i))%mod print(res%mod)
0
null
18,693,753,495,268
42
176
import math K=int(input()) ans=0 for a in range(1,K+1): for b in range(1,K+1): g=math.gcd(a,b) for c in range(1,K+1): ans+=math.gcd(g,c) print(ans)
import math k = int(input()) ans = 0 for q in range(1,k+1): for r in range(1,k+1): x = math.gcd(q,r) for s in range(1,k+1): ans += math.gcd(x,s) print(ans)
1
35,400,009,647,730
null
174
174
K = int(input()) cnt=1 Num=7%K while cnt<=K: if K%2==0: print('-1') break if Num%K==0: print(cnt) break else: Num = (10*Num + 7)%K cnt+=1 else: print('-1')
n = int(input()) ans = list() for i in range(n): line = input().split(" ") a = float(line[0]) b = float(line[1]) c = float(line[2]) if ((a**2 + b**2) == c**2) or ((b**2 + c**2) == a**2) or ((c**2 + a**2) == b**2): ans.append("YES") else: ans.append("NO") for j in range(n): print(ans[j])
0
null
3,070,215,659,110
97
4
n = int(input()) S=[] for i in range(n): S.append(input()) S.sort() c=1 for i in range(n-1): if S[i]!=S[i+1] : c+=1 print( c )
import sys input = sys.stdin.readline def main(): N = int(input()) S = set([input().rstrip() for _ in range(N)]) print(len(S)) if __name__ == '__main__': main()
1
30,187,965,421,054
null
165
165
def gcd(a,b): if b == 0: return a else: return gcd(b, a%b) k = int(input()) ans = 0 for a in range(1,k+1): for b in range(1,k+1): for c in range(1,k+1): ans += gcd(gcd(a,b),c) print(ans)
import sys read = sys.stdin.buffer.read #input = sys.stdin.readline #input = sys.stdin.buffer.readline #sys.setrecursionlimit(10**9) #from functools import lru_cache def RD(): return sys.stdin.read() def II(): return int(input()) def MI(): return map(int,input().split()) def MF(): return map(float,input().split()) def LI(): return list(map(int,input().split())) def LF(): return list(map(float,input().split())) def TI(): return tuple(map(int,input().split())) # rstrip().decode('utf-8') import math def main(): k=II() ans=0 li=[[0]*(k+1) for i in range(k+1)] for a in range(1,k+1): for b in range(1,k+1): li[a][b]=math.gcd(a,b) for a in range(1,k+1): for b in range(1,k+1): for c in range(1,k+1): ans+=math.gcd(li[a][b],c) print(ans) if __name__ == "__main__": main()
1
35,655,303,911,968
null
174
174
a,b = map(int,input().split()) ans = 0 if a - (2 * b) > 0: ans = a - (2 * b) print(ans)
A, B = map(int, input().split()) print(max([0, A-2*B]))
1
166,672,575,751,792
null
291
291
i = list(map(int, input().split())) N = i[0] R = i[1] if N <= 10: print(R + (100*(10 - N))) else: print(R)
import sys sys.setrecursionlimit(10 ** 7) rl = sys.stdin.readline def solve(): n, r = map(int,input().split()) if 10 > n: print(r + (100 * (10 - n))) else: print(r) if __name__ == '__main__': solve()
1
63,472,648,222,752
null
211
211
while 1: m,f,r=map(int,raw_input().split()) if (m==-1 and f==-1 and r==-1): break elif (m+f>=80): print "A" elif (m+f>=65 and m+f<80): print "B" elif (m+f>=50 and m+f<65 or r>=50): print "C" elif (m+f>=30 and m+f<50 and r<50 and m!=-1 and f!=-1): print "D" elif (m+f<30 or m==-1 or f==-1): print "F"
N, S = map(int, input().split()) A = list(map(int, input().split())) mod = 998244353 dp = [0] * (S+1) dp[0] = 1 for a in A: for j in range(S, -1, -1): if j-a >= 0: dp[j] = dp[j]*2 + dp[j-a] else: dp[j] = dp[j]*2 print(dp[S]%mod)
0
null
9,455,123,060,370
57
138
N,M,X=[int(s) for s in input().split()] Book=[[int(s) for s in input().split()] for _ in range(N)] INF=10**7 ans=set() ans.add(INF) for n in range(2**N): #Bit全探索 Xls=[0 for i in range(M)] cost=0 for i in range(N): if ((n>>i)&1)==1: cost+=Book[i][0] for b in range(M): Xls[b]+=Book[i][b+1] if min(Xls)>=X: ans.add(cost) if min(ans)==INF: print(-1) else: print(min(ans))
import sys n,m,x=map(int,input().split()) ac=[[0]*(m+1) for i in range(n)] a=[[0]*m for i in range(0,n)] c=[0 for i in range(n)] for i in range(n): ac[i]=list(map(int,input().split())) c[i]=ac[i][0] a[i]=ac[i][1:m+1]#sliceは上限+1を:の右に代入 cheap=[] kaukadouka=[0 for i in range(n)] def kau(i): global a,x,kaukadouka,cheap,c rikaido=[0 for i in range(m)]#初期化 for j in range(i+1,n): kaukadouka[j]=0 if i>=n: sys.exit() kaukadouka[i]=1 for j in range(n): for k in range(m): rikaido[k]+=kaukadouka[j]*a[j][k] value=0 if min(rikaido)>=x: for j in range(n): value+=c[j]*kaukadouka[j] cheap.append(value) if i<n-1: kau(i+1) kawanai(i+1) def kawanai(i): global kaukadouka for j in range(i,n): kaukadouka[j]=0 if i>=n: sys.exit() #print('i=',i,'のとき買わないで') #print('->',kaukadouka) if i<n-1: kau(i+1) kawanai(i+1) kau(0) kawanai(0) if len(cheap)>0: #print(cheap) print(min(cheap)) else: print('-1')
1
22,402,291,008,458
null
149
149
def kton(S): r = 0 m = 0 for s in S: r += 1 if s == '(' else -1 m = min(m, r) return r, m def main(): N = int(input()) RM = [kton(input()) for _ in range(N)] pos = 0 negp = [] negn = [] posn = [] for r, m in RM: if m < 0: if r >= 0: negp.append((-m, r)) else: negn.append((-(r-m), -r, m)) else: pos += r negp.sort() for m, r in negp: if pos - m < 0: return False pos += r negn.sort() for _, r, m in negn: if pos + m < 0: return False pos -= r return pos == 0 print('Yes' if main() else 'No')
import sys S = sys.stdin.readline().strip() ls = len(S) ans = 0 h = ls // 2 for i in range(h): if S[i] != S[ls - 1 - i]: ans += 1 print(ans)
0
null
72,161,498,543,820
152
261
n=int(input()) a=list(map(int,input().split())) cnt=[0]*(10**5+1) for i in a: cnt[i]+=1 xxx=sum(a) q=int(input()) for i in range(q): l,r=map(int,input().split()) pin=cnt[l] cnt[r]+=pin cnt[l]=0 xxx+=(r-l)*pin print(xxx)
N = int(input()) A = list(map(int,input().split())) tot = sum(A) D = {} for i in range(N): a = A[i] if a not in D: D[a] = 0 D[a] += 1 Q = int(input()) for _ in range(Q): b,c = map(int,input().split()) if b not in D: print(tot) else: d = c-b if c in D: n = D[b] D[c] += D[b] del D[b] else: n = D[b] D[c] = D[b] del D[b] tot += n*d print(tot)
1
12,271,044,907,342
null
122
122
a, v = map(int, input().split()) b, w = map(int, input().split()) t = int(input()) dist = abs(a - b) vd = v - w if vd > 0: if 0 <= dist/vd/t <= 1: print("YES") else: print("NO") elif vd == 0 and dist == 0: print("YES") else: print("NO")
n = int(input()) cnt = 0 for i in range(1,n+1): cnt += n//i if n%i == 0: cnt -= 1 print(cnt)
0
null
8,815,355,049,732
131
73
n,k = map(int,input().split()) a = list(map(int,input().split())) ans = [] for i in range(k,n): ans.append(a[i] - a[i-k]) for j in ans: if j > 0: print('Yes') else: print('No')
n, k = map(int, input().split()) a = list(map(int, input().split())) for r in range(k, n, 1): l = r - k print('Yes' if a[l] < a[r] else 'No')
1
7,114,109,789,530
null
102
102
if __name__ == '__main__': N = int(input()) D = [input() for i in range(N)] for i in range(2,N): if (D[i][0] == D[i][-1]) \ and (D[i-1][0] == D[i-1][-1]) \ and (D[i-2][0] == D[i-2][-1]): print('Yes') break if i == N-1: print('No')
n=int(input()) d={} m=1 for i in range(n): s=input() if s in d: d[s]+=1 m=max(m,d[s]) else: d[s]=1 se=set() for i in d: if d[i]==m: se.add(i) se=list(se) se.sort() print(*se)
0
null
36,281,739,289,682
72
218
N = int(input().rstrip()) A = list(map(int, input().rstrip().split())) flag = True c = 0 while flag: flag = False for j in reversed(range(1, N)): if A[j - 1] > A[j]: A[j - 1], A[j] = A[j], A[j - 1] c += 1 flag = True print(' '.join(map(str, A))) print(c)
q = int(input()) sort1 = list(map(int, input().split())) def bubblesort(ary): cnt = 0 for i in range(q): for j in range(q-1, i, -1): if ary[j] < ary[j-1]: ary[j-1], ary[j] = ary[j], ary[j-1] cnt += 1 return (ary, cnt) ary, cnt = bubblesort(sort1) print(" ".join(map(str, ary))) print(cnt)
1
17,813,941,630
null
14
14
s = input() t = input() max = 0 for i in range(len(s) -len(t) + 1): target = s[i:i+len(t)] matched = 0 for j in range(len(target)): if target[j] == t[j]: matched += 1 if matched > max: max = matched print(len(t) - max)
N=int(input()) D=[{} for _ in range(N+1)] for i in range(1,N+1): A=int(input()) for k in range(A): p,x=map(int,input().split()) D[i][p]=x Max=0 for x in range(2**N): y=x B=["*"]*(N+1) for i in range(N): B[i+1]=y%2 y>>=1 Flag=True for i in range(1,N+1): if B[i]==1: for k in D[i]: Flag&=(B[k]==D[i][k]) if Flag: Max=max(Max,B.count(1)) print(Max)
0
null
62,578,767,705,678
82
262
n = int(input()) L = sorted(list(map(int,input().split())),reverse = True) ans = 0 for i in L: for j in L: for k in L: if i<j<k: if i + j>k: ans += 1 print(ans)
import sys read = sys.stdin.read readlines = sys.stdin.readlines from itertools import combinations def main(): n, *a = map(int, read().split()) coma = combinations(a, 3) r = 0 for c in coma: if sum(c) > max(c)*2: if len(set(c)) > 2: r += 1 print(r) if __name__ == '__main__': main()
1
5,025,495,778,940
null
91
91
import math while True: try: n=input() x=100000 for i in xrange(n): x=math.ceil(x*1.05/1000)*1000 print(int(x)) except EOFError: break
import sys import numpy as np import math as mt read = sys.stdin.buffer.read readline = sys.stdin.buffer.readline readlines = sys.stdin.buffer.readlines n = int(readline()) cnt = 1 while n != 1: n = n//2 cnt += 1 print(sum(2**i for i in range(cnt)))
0
null
40,188,400,364,960
6
228
INF = float("inf") N, K = map(int, input().split()) P = list(map(int, input().split())) C = list(map(int, input().split())) ans = -INF for s in range(N): ### STEP1 cum = [] i = P[s] - 1 #s-> i cum.append(C[i]) while i != s: i = P[i] - 1 cum.append(cum[-1] + C[i]) # STEP2 if K <= len(cum): #1週未満しかできない score = max(cum[:K]) elif cum[-1] <= 0: #一周以上できるが、ループしたら損する場合 score = max(cum) else: # K//Length - 1回だけループし、最後は最適に止まる score1 = cum[-1] * (K//len(cum) - 1) score1 += max(cum) #ループをK//length回だけループする場合 score2 = cum[-1]*(K//len(cum)) resi = K % len(cum) #残り進める回数 if resi != 0: #まだ進めるなら score2 += max(0, max(cum[:resi])) score = max(score1, score2) ans = max(ans, score) print(ans)
from itertools import accumulate def max_from_acc(A, b): r = -10**9-1 acc = [0] + list(accumulate(A + A[:b])) for i in range(len(A)): for j in range(1, b+1): r = max(r, acc[i+j]-acc[i]) return r n, k = map(int, input().split()) P = list(map(int, input().split())) C = list(map(int, input().split())) P = [p - 1 for p in P] checked = [False] * n loops = [] for i in range(n): if checked[i]: continue checked[i] = True tmp = [i] next = P[i] while next != i: tmp.append(next) checked[next] = True next = P[next] loops.append(tmp) # print(loops) ans = -10**9-1 for loop in loops: t =len(loop) div, mod = divmod(k, t) if mod == 0: mod = t div -= 1 C_loop = [C[p] for p in loop] loop_score = sum(C_loop) if t >=k: ans = max(ans, max_from_acc(C_loop, k)) else: if loop_score > 0: ans = max(ans, max_from_acc(C_loop, mod)+loop_score*div) else: ans = max(ans, max_from_acc(C_loop, t)) print(ans)
1
5,368,368,937,530
null
93
93
X,Y,Z=input().split() # X,Y,Z=41,59,31 A,B,C=X,Y,Z A,B,C=Z,X,Y print(A,B,C)
def ABC_swap(): # 入力 X, Y, Z = map(int, input().split()) A = X B = Y C = Z # 入れ替え処理 A, B = B, A A, C = C, A # 表示 print(A, B, C) ABC_swap()
1
38,034,281,580,808
null
178
178
from math import floor, ceil s = input() k = int(input()) def f(s): b = '' ret = 0 for i in s: if i==b: b = '' ret += 1 continue b = i return ret b = f(s*2) - f(s*1) c = f(s*3) - f(s*2) print(f(s) + b*floor(k/2) + c*ceil(k/2-1))
import numpy as np s=input() k=int(input()) cnt=1 a=[] ss=s+"." for i in range(len(s)): if ss[i]==ss[i+1]: cnt+=1 else: a.append(cnt) cnt=1 pp=0 if s[0]==s[len(s)-1]: pp=a[0]+a[-1] b=[] if len(a)>1: b.append(pp) b+=a[1:len(a)-1] else: a=[len(s)*k] b=[] else: b=a arr=np.array(a) arr2=np.array(b) a=arr//2 b=arr2//2 if len(s)>=2: print(np.sum(a)+int((k-1)*np.sum(b))) else: print(k//2)
1
175,755,737,603,780
null
296
296
N = int(input()) c = input() W = 0 R = c.count('R') if R == 0 or R == N: print(0) exit() ans = N t = 0 for i in range(N): if c[i] == 'W': W += 1 else: R -= 1 t = max(R,W) ans = min(ans, t) print(ans)
def main(): n = int(input()) ans = 0 for k in range(1,n+1): ans += k * (n//k) * (n//k+1) //2 print(ans) if __name__ == "__main__": main()
0
null
8,612,739,810,300
98
118
import sys import heapq input = sys.stdin.readline n, k, s = map(int, input().split()) for i in range(n): if i < k: print(s) else: if s >= 10**9: print(1) else: print(s+1)
n = int(input()) if n >= 30 : print("Yes") else: print('No')
0
null
48,447,700,269,110
238
95
a, b, x = map(int, input().split()) if x >= a**2*b/2: t = 2*(b*a**2-x)/(a**3) else: t = (a*b**2)/(2*x) import math p = math.atan(t) p = math.degrees(p) print(p)
import math a, b, x = [int(i) for i in input().split()] if a**2 * b / 2 <= x: y = 2 * x / a**2 - b tntheta = (b - y) / a else: y = a - 2 * x / (a * b) tntheta = b / (a - y) print(math.degrees(math.atan(tntheta)))
1
163,464,818,871,760
null
289
289
N, S=list(map(int,input().split())) A=list(map(int,input().split())) A=[0]+A dp=[[0 for j in range(S+1)] for i in range(N+1)] dp[0][0]=1 for i in range(1,N+1): for j in range(S+1): dp[i][j]=(dp[i][j]+2*dp[i-1][j]) %998244353 # x[i]を入れないが、大きい方に入れるか入れないかが二通り for j in range(S-A[i]+1): dp[i][j+A[i]]=(dp[i][j+A[i]]+dp[i-1][j]) %998244353 # x[i]を入れる print(dp[N][S])
n = int(input()) L = [] for x in range(3,n+1): if x % 3 == 0: L.append(x) else: i = x while i != 0: if i % 10 == 3: L.append(x) break else : i /= 10 print "", while L != []: print L.pop(0),
0
null
9,267,583,768,130
138
52
import math from decimal import * import random mod = int(1e9)+7 s = str(input()) n =len(s) if(n%2==0): s1, s2 = s[:n//2], s[n//2:][::-1] ans =0 for i in range(len(s1)): if(s1[i]!= s2[i]): ans+=1 print(ans) else: s1, s2 = s[:(n-1)//2], s[(n-1)//2:][::-1] ans = 0 for i in range(len(s1)): if(s1[i]!= s2[i]): ans+=1 print(ans)
a,b,c,d = map(int, input().split()) i = 0 while a > 0 and c > 0: if i%2 == 0: c -= b else: a -= d i += 1 if a > c: print('Yes') else: print('No')
0
null
75,256,678,905,442
261
164
import copy from collections import deque n, st, sa = map(int,input().split()) st -= 1 sa -= 1 e = [[] for i in range(n)] for i in range(n-1): a, b = map(int, input().split()) a -= 1 b -= 1 e[a].append(b) e[b].append(a) visited = [False] * n visited[st] = True d = deque() d.append([st, 0]) tx = {} if len(e[st]) == 1: tx[st] = 0 cnt = 0 while d: f, cnt = d.popleft() flg = True for t in e[f]: if not visited[t]: flg = False d.append([t, cnt+1]) visited[t] = True if flg: tx[f] = cnt visited = [False] * n visited[sa] = True d = deque() d.append([sa, 0]) ax = {} if len(e[sa]) == 1: ax[sa] = 0 cnt = 0 while d: f, cnt = d.popleft() flg = True for t in e[f]: if not visited[t]: flg = False d.append([t, cnt+1]) visited[t] = True if flg: ax[f] = cnt ax = sorted(ax.items(), key=lambda x:x[1], reverse=True) for i in range(len(ax)): x, d = ax[i][0], ax[i][1] if d > tx[x]: ans = d - 1 break print(ans)
def main(): N = int(input()) print((N-1)//2) if __name__ == '__main__': main()
0
null
134,893,910,390,004
259
283
import re s = input() if re.sub(r'hi', '', s) == '': print('Yes') else: print('No')
from sys import stdin import math import re import queue input = stdin.readline MOD = 1000000007 INF = 122337203685477580 def solve(): str = (input().rstrip()) str = str.replace("hi","") if(len(str) == 0): print("Yes") else: print("No") if __name__ == '__main__': solve()
1
53,429,626,614,860
null
199
199
def main(): M = int(input()) n, r = M // 1000, M % 1000 if r == 0: print(0) return print((n+1)*1000-M) if __name__ == '__main__': main()
Nin = int(input()) noguchi = (Nin // 1000) if (Nin % 1000): noguchi += 1 print(noguchi*1000 - Nin)
1
8,355,121,807,842
null
108
108
n = int(input()) s = str(input()) s_new = s[0] for i in range(1,len(s)): if s_new[-1] != s[i]: s_new = s_new + s[i] print(len(s_new))
N = int(input()) S = input() count = 1 check = S[0] for c in S: if c != check: count += 1 check = c print(count)
1
169,990,917,218,230
null
293
293
import itertools n, m, q = map(int, input().split()) lst = [] for _ in range(q): l = [int(i) for i in input().split()] lst.append(l) lists = list(itertools.combinations_with_replacement(range(1, m+1), n)) #print(lists) max_point = 0 for each in lists: point = 0 for i in range(q): l = lst[i] a = l[0] - 1 b = l[1] - 1 c = l[2] if each[b] - each[a] == c: point += l[3] if point > max_point: max_point = point print(max_point)
n, m, q = map(int, input().split()) query = [tuple(map(int, input().split())) for _ in range(q)] def score(A): ret = 0 for a, b, c, d in query: if A[b-1] - A[a-1] == c: ret += d return ret def dfs(pre, _min): if len(pre) == n: return score(pre) ret = 0 for i in range(_min, m+1): new = pre + [i] ret = max(ret, dfs(new, i)) return ret print(dfs([], 1))
1
27,527,575,837,180
null
160
160
N,K = map(int,input().split()) A = list(map(int,input().split())) for i in range(N-K): if A[i]<A[i+K]: print("Yes") elif A[i]>=A[i+K]: print("No")
N, K = [int(v) for v in input().strip().split(" ")] A = [int(v) for v in input().strip().split(" ")] for i in range(N - K): if A[i+K] > A[i]: print("Yes") else: print("No")
1
7,169,495,626,368
null
102
102
# Take both input K & S, then compare the length of S with K and assign it to length # If the length is <= K print all # And if length is >K print some of the character K = int(input()) S = input() x = 0 length = len(S) if length <= K: print(S) else: while x < K: print(S[x], end=("")) x += 1 print("...")
import sys from collections import deque, defaultdict, Counter from itertools import accumulate, product, permutations, combinations from operator import itemgetter from bisect import bisect_left, bisect_right from heapq import heappop, heappush from math import ceil, floor, sqrt, gcd, inf from copy import deepcopy import numpy as np import scipy as sp INF = inf MOD = 1000000007 k = int(input()) s = input() tmp = 0 res = 0 if len(s) <= k: res = s else: res = s[:k] + "..." print(res)
1
19,605,075,810,442
null
143
143
K = int(input()) num = 0 for i in range(0,K+1): num = (num*10+7)%K if num==0: print(i+1,'\n') break if num: print("-1\n")
K=int(input()) A=0 for i in range(K): A=(A*10+7)%K if A%K==0: print(i+1) break if i==K-1:print(-1)
1
6,144,875,529,700
null
97
97
a,b=map(int,input().split()) while b: a,b=b,a%b print(a)
def cgd(x,y): while(True): r=x%y if r==0: m=y break x=y y=r return m a,b=map(int,input().split()) if a>b: m=cgd(a,b) elif a<b: m=cgd(b,a) else: m=a print(m)
1
7,678,182,610
null
11
11
n = int(input()) graph = [[0 for i in range(n)] for j in range(n)] d = [0] * n f = [0] * n g = [0] * n time = 0 for i in range(n): a = list(map(int, input().split())) for j in range(0, a[1], 1): graph[a[0] - 1][a[2 + j] - 1] = 1 def search(i): global time time = time + 1 d[i] = time g[i] = 1 for j in range(n): if (graph[i][j] == 1) & (g[j] == 0): search(j) time = time + 1 f[i] = time for i in range(n): if g[i] == 0: search(i) [print(i+1, d[i], f[i]) for i in range(n)]
N, K, C = map(int, input().split()) S = input().rstrip() P = [0]*(N+1) cl, l, cr, r = 0, 1, 0, 1 for i in range(N): if cl > C and S[i] != "x": cl = 0; l += 1 cl += 1 P[i+1] += l if cr > C and S[-1-i] != "x": cr = 0; r += 1 cr += 1 P[N-2-i] += r for i in range(N): if P[i] < K and S[i] == "o": print(i+1)
0
null
20,361,328,468,272
8
182
import sys def lcm(a, b): a, b = max(a, b), min(a, b) c = a * b while a % b > 0: a, b = b, a % b return c // b def solve(): input = sys.stdin.readline X = int(input()) L = lcm(360, X) print(L // X) return 0 if __name__ == "__main__": solve()
if __name__ == "__main__": S = (input()).split() n = int(S[0]) q = int(S[1]) head = 0 tail = n-1 que = [] runtime = 0 fin = [] for i in range(0, n): que.append((input()).split()) while head <= tail: nowjob = que[head] jobtime = int(nowjob[1]) if jobtime > q : jobtime = jobtime -q jobname = nowjob[0] que.append([jobname, jobtime]) runtime = runtime + q head = head + 1 tail = tail + 1 else : runtime = runtime + jobtime fin.append([(que[head])[0], runtime]) head = head + 1 for i in range(0,n): print("{} {}".format((fin[i])[0], (fin[i])[1]))
0
null
6,507,540,278,810
125
19
line = input() q = int(input()) for _ in range(q): cmd = input().split() a = int(cmd[1]) b = int(cmd[2]) if cmd[0] == "print": print(line[a:b + 1]) elif cmd[0] == "replace": line = line[:a] + cmd[3] + line[b + 1:] else: line = line[:a] + line[a:b + 1][::-1] + line[b + 1:]
k = "a", for _ in range(int(input()) - 1): k = {a + b for a in k for b in a + chr(ord(max(a)) + 1)} print(*sorted(k))
0
null
27,215,144,917,170
68
198
# 169 B N = int(input()) A = list(map(int, input().split())) A.sort() ans = 1 for i in range(N): ans *= A[i] if ans > 10**18: print(-1) break else: print(ans)
from sys import exit n = int(input()) num_list = [int(i) for i in input().split()] if 0 in num_list: print(0) exit() ans = 1 for i in range(n): ans *= num_list[i] if ans > 10**18: print(-1) exit() print(ans)
1
16,104,814,911,938
null
134
134
data = [ [[0 for k in range(10)] for j in range(3)] for i in range(4) ] count = int(input()) for x in range(count): (b,f,r,v) = [int(i) for i in input().split()] data[b - 1][f - 1][r - 1] += v for b in range(4): for f in range(3): print(' ',end='') for r in range(10): if r == 9: print(data[b][f][r], end='') else: print(data[b][f][r], '', end='') print() if b == 3: break for x in range(20): print('#',end='') print()
n=int(input()) data=[[int(num)for num in input().split(' ')] for i in range(n)] state=[[[0 for i in range(10)]for j in range(3)]for k in range(4)] for datum in data: state[datum[0]-1][datum[1]-1][datum[2]-1]+=datum[3] for i in range(4): for j in range(3): s="" for k in range(10): s+=' '+str(state[i][j][k]) print(s) if i!=3: print("####################")
1
1,109,107,747,968
null
55
55
class Saikoro: def sai(self,one,two,three,four,five,six): self.s1=int(one) self.s2=int(two) self.s3=int(three) self.s4=int(four) self.s5=int(five) self.s6=int(six) def turnE(self): e=[self.s4,self.s2,self.s1,self.s6,self.s5,self.s3] self.s1=e[0] self.s2=e[1] self.s3=e[2] self.s4=e[3] self.s5=e[4] self.s6=e[5] def turnN(self): n=[self.s2,self.s6,self.s3,self.s4,self.s1,self.s5] self.s1=n[0] self.s2=n[1] self.s3=n[2] self.s4=n[3] self.s5=n[4] self.s6=n[5] def turnS(self): s=[self.s5,self.s1,self.s3,self.s4,self.s6,self.s2] self.s1=s[0] self.s2=s[1] self.s3=s[2] self.s4=s[3] self.s5=s[4] self.s6=s[5] def turnW(self): w=[self.s3,self.s2,self.s6,self.s1,self.s5,self.s4] self.s1=w[0] self.s2=w[1] self.s3=w[2] self.s4=w[3] self.s5=w[4] self.s6=w[5] l=input().split() m=list(input()) sai1=Saikoro() sai1.sai(l[0],l[1],l[2],l[3],l[4],l[5]) n=len(m) i=0 while i<n: if m[i]=="E": sai1.turnE() elif m[i]=="N": sai1.turnN() elif m[i]=="S": sai1.turnS() else: sai1.turnW() i+=1 print(sai1.s1)
n = int(input()) boss = list(map(int, input().split())) subordinate = {} for b in boss: subordinate[b] = subordinate.get(b, 0) + 1 for i in range(1, n+1): print(subordinate.get(i, 0))
0
null
16,406,057,612,588
33
169
S = input() T = input() Nmax = len(T) for i in range(len(S)-len(T)+1): diff = 0 for j in range(len(T)): if(S[i+j] != T[j]): diff += 1 Nmax = min(diff, Nmax) print(Nmax)
"""B.""" import sys input = sys.stdin.readline # noqa: A001 S = input()[:-1] T = input()[:-1] S_L = len(S) T_L = len(T) ans = T_L for i in range(S_L - T_L + 1): S_2 = S[i:i + T_L] match = 0 for v1, v2 in zip(S_2, T): match += bool(v1 != v2) ans = min(ans, match) print(ans) exit(0)
1
3,696,972,759,910
null
82
82
k = int(input()) a, b = map(int, input().split()) if a % k == 0: print("OK") exit() nex = k * ((a // k) + 1) if nex <= b: print("OK") else: print("NG")
# A We Love Golf K = int(input()) A, B = map(int, input().split()) for i in range(A, B+1): if i % K == 0: print("OK") exit() else: print("NG")
1
26,597,154,169,312
null
158
158
N,K=map(int,input().split()) A=list(map(int,input().split())) score=1 for i in range(K): score+=A[i] for i in range(K,N): pre=score score-=A[i-K] score+=A[i] if score>pre: print("Yes") else: print("No")
N,K = map(int,input().split()) A = [int(a) for a in input().split()] n = 0 for i in range(K,N): if A[i] > A[n] : print("Yes") else: print("No") n+=1
1
7,122,157,840,490
null
102
102
n = int(input()) x = 100000 for i in range(n): x = x*1.05 if x % 1000 == 0: pass else: x = x//1000 x = x+1 x = x*1000 print('{:.0f}'.format(x))
K = int(input()) A, B = map(int, input().split()) cnt = 0 while 1: cnt+=K if A <= cnt <= B: print("OK") break if B < cnt: print("NG") break
0
null
13,273,795,904,100
6
158
N = input()[::-1] l = len(N) dp = [[0,0] for i in range(l+1)] for i in range(l): dp[i+1][0] = min(dp[i][0] + int(N[i]), dp[i][1] + int(N[i]) + 1) if i == 0: dp[i+1][1] = 10 - int(N[i]) else: dp[i+1][1] = min(dp[i][0] + 10 - int(N[i]), dp[i][1] + 9 - int(N[i])) print(min(dp[-1][0],dp[-1][1]+1))
def s_in(): return input() def n_in(): return int(input()) def l_in(): return list(map(int, input().split())) class Interval(): def __init__(self, li): self.li = li self.n = len(li) self.sum_li = [li[0]] for i in range(1, self.n): self.sum_li.append(self.sum_li[i-1] + li[i]) def sum(self, a, b=None): if b is None: return self.sum(0, a) res = self.sum_li[min(self.n-1, b-1)] if a > 0: res -= self.sum_li[a-1] return res N = s_in()[::-1] n = len(N) dp1 = [0 for _ in range(n)] dp1[0] = int(N[0]) # dp1[i] は i桁目を同じ値だけ使ったとしたときの最小値 dp2 = [0 for _ in range(n)] dp2[0] = 10 - int(N[0]) # dp2[i] は i桁目を繰り上げたとしたときの最小値 for i, s in enumerate(N[1:]): i += 1 m = int(s) dp1[i] = min(dp1[i-1] + m, dp2[i-1] + (m+1)) dp2[i] = min(dp1[i-1] + (10-m), dp2[i-1] + (10-m-1)) # print(dp1) # print( dp2) print(min(dp1[n-1], dp2[n-1]+1))
1
70,963,116,166,360
null
219
219