problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p03475 | s943594143 | Accepted | import math
N = int(input())
CSF = [()]
for _ in range(N-1):
CSF.append(tuple(map(int, input().split())))
#print(CSF)
for start in range(1, N):
time = CSF[start][0] + CSF[start][1]
for transit in range(start+1, N):
temp = math.ceil(time / CSF[transit][2]) * CSF[transit][2]
time = max(temp, CSF[transit][1]) + CSF[transit][0]
print(time)
print(0)
|
p02897 | s556925281 | Wrong Answer | #Coding:Utf-8
N=int(input())
print('{:.10f}'.format(2/N))
|
p02771 | s051548105 | Accepted | a, b, c = map(int, input().split())
if a == b == c or (a != b and b != c and a != c):
print('No')
else:
print('Yes')
|
p03623 | s632621952 | Accepted | import sys
x, a, b = map(int, sys.stdin.readline().split())
def main():
db = abs(b - x)
da = abs(a - x)
ans = 'A' if da < db else 'B'
print(ans)
if __name__ == '__main__':
main() |
p03493 | s988524970 | Wrong Answer | s = input()
c = 0
for i in range(len(s)):
if s[1] == '1':
c += 1
print(c) |
p02742 | s011954942 | Accepted | H,W = map(int,input().split())
x = H//2
ans = (H*W+1)//2
if H == 1:
ans = 1
if W == 1:
ans = 1
print(ans) |
p03106 | s005957051 | Accepted | A,B,K=map(int,input().split())
ans=[]
for i in range(1,min(A,B)+1):
if A%i==0 and B%i==0:
ans.append(i)
print(ans[-K]) |
p04031 | s004293457 | Accepted | def pow_k(x, n):
"""
O(log n)
"""
if n == 0:
return 1
K = 1
while n > 1:
if n % 2 != 0:
K *= x
x *= x
n //= 2
return K * x
N=int(input())
L=list(map(int,input().split()))
import sys
ans = sys.maxsize
for i in range(-100,101):
m_diffs = 0
for j in range(N):
m_diffs += pow_k((L[j] - i),2)
ans = min(ans, m_diffs)
print(ans)
|
p03773 | s473373445 | Accepted | A,B=map(int,input().split())
print((A+B)%24) |
p02594 | s233549332 | Accepted |
X = int(input())
if(X>=30):
print("Yes")
else:
print("No")
|
p02613 | s517690647 | Accepted | def INT():
return int(input())
def MI():
return map(int, input().split())
def LI():
return list(map(int, input().split()))
from collections import Counter
N = INT()
S = [input() for _ in range(N)]
S = Counter(S)
print(f"AC x {S['AC']}")
print(f"WA x {S['WA']}")
print(f"TLE x {S['TLE']}")
print(f"RE x {S['RE']}") |
p02571 | s505948324 | Wrong Answer | s=input()
t=input()
ans=float('inf')
for i in range(len(s)-len(t)):
a=s[i:i+len(t)]
tans=0
for i in range(len(t)):
tans+=(t[i]!=a[i])
ans=min(ans,tans)
print(ans) |
p04011 | s319666851 | Accepted | N,K,X,Y=map(int, open(0).read().split());print(N*X if N<=K else K*X+(N-K)*Y) |
p03659 | s019894778 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
ans = 9999999
for i in range(n - 1):
x = sum(a[:i+1])
y = sum(a[i+1:n])
ans = min(ans, abs(x - y))
print(ans)
|
p02712 | s310957134 | Wrong Answer | n = int(input())
sum = 0
for i in range(n):
if (i%3)!=0 and (i%5)!=0:
sum += i
print(sum) |
p03408 | s662288931 | Accepted | n=int(input())
card={}
card_key=set([])
for _ in range(n):
temp=input()
if temp in card_key:
card[temp]+=1
else:
card_key.add(temp)
card[temp]=1
m=int(input())
for _ in range(m):
temp=input()
if temp in card_key:
card[temp]-=1
else:
card_key.add(temp)
card[temp]=-1
#print(card)
result=0
for item in card_key:
result=max(result,card[item])
print(result)
|
p03385 | s089775473 | Accepted | print("Yes" if ''.join(sorted(input())) == "abc" else "No")
|
p03814 | s621885113 | Accepted | s = input()
a = s.index("A")
zList = [i for i , name in enumerate(s) if name == "Z"]
z = zList[-1]
print(z - a + 1) |
p03076 | s538853902 | Wrong Answer | time = []
rem = []
for _ in range(5):
n = int(input())
time.append(n)
if n % 10 != 0:
rem.append(10 - n % 10)
rem.sort()
ans = sum(time) + sum(rem[:4])
# print(time, rem)
print(ans)
|
p03095 | s533583094 | Wrong Answer | from collections import Counter
n = int(input())
S = input()
counts = Counter(S)
ans = 1
for count in counts.values():
ans *= (count + 1)
ans -= 1
print(ans)
|
p03239 | s864508495 | Wrong Answer | N,T = map(int, input().split())
m=1001
for i in range(N):
c,t = map(int, input().split())
if t<T:m=min(m,c)
print("TLE" if m==1001 else m) |
p02779 | s037605728 | Wrong Answer | def has_duplicates(seq):
return len(seq) != len(set(seq))
N=int(input())
A=list(map(int,input().split()))
if has_duplicates(A):
print('No')
else:
print('Yes') |
p02687 | s191869824 | Accepted | contest = input()
if contest == "ABC":
print("ARC")
else:
print("ABC")
|
p02684 | s130059845 | Accepted | n, k = map(int, (input().split()))
a = [0] + [int(i) for i in input().split()]
path = [1]
chk = {1}
idx = 1
loop_s = 1
loop_e = n
for i in range(1, n + 1):
if a[idx] not in chk:
idx = a[idx]
path.append(idx)
chk.add(idx)
else:
loop_s = path.index(a[idx])
loop_e = i
break
if k <= loop_s:
print(path[k])
else:
print(path[loop_s + (k - loop_s) % (loop_e - loop_s)]) |
p02778 | s716381178 | Wrong Answer | print('x'for i in range(len(input()))) |
p02900 | s521895264 | Accepted | import sys
import math
stdin = sys.stdin
nm = lambda: map(int, stdin.readline().split())
a, b = nm()
n = math.gcd(a,b)
count = 1 # 1
for i in range(2, int(n**(1/2))+1):
if n%i ==0:
count +=1
while n%i == 0:
n = n/i
if n ==1:
break
if n != 1:
count += 1
print(count) |
p03556 | s483525398 | Accepted | n = int(input())
for i in range(10 ** 5):
if n == (i * i):
print(i * i)
exit()
if n <= (i * i):
break
print((i - 1) * (i - 1)) |
p02993 | s264660169 | Accepted | s = input()
for i in range(3):
if s[i] == s[i+1]:
print('Bad')
exit()
print('Good') |
p03011 | s771627394 | Wrong Answer | print(sum(sorted(list(map(int,input().split()))[:1])))
|
p03796 | s559225104 | Accepted | import math
N = int(input())
print((math.factorial(N)) % (10**9+7))
|
p02947 | s438901842 | Wrong Answer | N=int(input())
s=[]
for _ in range(N):
tmp=list(input())
s.append(sorted(tmp))
total=0
while (s):
cnt=0
comp=s.pop(0)
for word in (s):
if(comp==word):
cnt+=1
s.remove(comp)
total+=(1+cnt)*cnt//2
print(total)
|
p03351 | s964628267 | Wrong Answer | a,b,c,d = map(int,input().split())
print(["No","Yes"][abs(a-c)<=d or (abs(a-b)<d and abs(b-c)<d)]) |
p02768 | s164749583 | Wrong Answer | from math import factorial
n,a,b=map(int,input().split())
total=0
for _ in range(n):
if not _==a and not _==b:
x=factorial(n)%(10**9+7)
y=factorial(_)%(10**9+7)
z=factorial(n-_)%(10**9+7)
total+=factorial(n)//(factorial(_)*factorial(n-_))
print(total) |
p02576 | s593348808 | Wrong Answer | import math
N,X,T=list(map(int,input().split()))
print(N,X,T)
print(math.ceil(N/X)*T) |
p03416 | s752837329 | Accepted | import sys
read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 9)
INF = 1 << 60
MOD = 1000000007
def main():
A, B = map(int, readline().split())
ans = 0
for n in range(A, B + 1):
n = str(n)
if n == n[::-1]:
ans += 1
print(ans)
return
if __name__ == '__main__':
main()
|
p03479 | s786747406 | Accepted | X, Y = map(int, input().split())
ans = 1
n = 1
a = X
while a <= Y:
a = X * (2 ** n)
if a <= Y:
ans += 1
n += 1
else:
break
print(ans) |
p03438 | s034579914 | Accepted | n = int(input())
a = list(map(int, input().split()))
b = list(map(int, input().split()))
cnt = sum(b) - sum(a)
ans1, ans2 = 0, 0
for ai, bi in zip(a, b):
ans1 += max(0, ai - bi)
ans2 += max(0, (bi - ai + 1) // 2)
print('Yes' if max(ans1, ans2) <= cnt else 'No')
|
p03699 | s345475227 | Accepted | N = int(input())
s = []
for i in range(N):
s.append(int(input()))
s.sort()
res = sum(s)
if res%10 != 0:
print(res)
exit()
else:
for i in range(N):
if s[i]%10 != 0:
print(res-s[i])
exit()
print(0) |
p03327 | s190184956 | Accepted | if int(input())>999:
print("ABD")
else:
print("ABC") |
p02595 | s092708319 | Accepted | import math
n, d = map(int, input().split())
e = 0
for i in range(n):
a, b = map(int, input().split())
c = math.sqrt(a**2 + b**2)
if(c <= d):
e += 1
print(e)
|
p03544 | s350854732 | Wrong Answer | n=int(input())
l=[]
l.append(2)
l.append(1)
if n==1:
print(n)
exit()
for i in range(2,n+1):
l.append(l[i-2]+l[i-1])
print(i,l[i])
if n==i:
print(l[i])
exit()
|
p03565 | s656309071 | Accepted | s = input()
s = s[::-1]
t = input()
t = t[::-1]
tmp = -1
l = len(t)
ls = len(s)
for i in range(ls-l+1):
for j in range(l):
if s[i+j] != t[j] and s[i+j] != '?':
break
if j == l-1 and tmp == -1:
tmp = i
if tmp == -1:
print("UNRESTORABLE")
exit()
s = s[:tmp] + t + s[tmp+len(t):]
s = s[::-1]
print(s.replace('?','a'))
|
p02946 | s655853939 | Accepted | K, X = map(int, input().split())
array = []
for x in range(X - K + 1, X + K, 1):
array.append(str(x))
print(" ".join(array))
|
p03106 | s618350959 | Accepted | a,b,c= input().split()
x,y,z=(int(a),int(b),int(c))
ans_list =[]
for i in range(min(x,y)):
if x % (i+1) == 0 and y % (i+1) == 0:
ans_list.append(i+1)
print(ans_list[len(ans_list)-z]) |
p02988 | s681315259 | Accepted | n=int(input())
p=list(map(int,input().split()))
def ju(a,b,c):
return b==(a+b+c)-min(a,b,c)-max(a,b,c)
ans=0
for i in range(1,n-1):
if ju(p[i-1],p[i],p[i+1]):
ans+=1
print(ans) |
p03239 | s866594808 | Accepted |
if __name__ == '__main__':
b, c = map(int, input().split())
min = 9999
for i in range(b):
a = [int(i) for i in input().split()]
if a[1]<= c and a[0] < min:
min = a[0]
if min == 9999:
print("TLE")
else:
print(min) |
p03814 | s143459317 | Wrong Answer | s = str.upper(input())
for i in range(len(s)):
if s[i] == 'A':
a = i
break
for i in range(len(s)):
if s[i] == 'Z':
b = i + 1
break
print(b-a) |
p02612 | s028911206 | Accepted | x = int(input())
e=x%1000
r=1000-e
if r==1000:
print(0)
else:
print(r) |
p02706 | s740223335 | Accepted | N, M = map(int, input().split())
A = list(map(int, input().split()))
ans = N
for i in range(M):
ans -= A[i]
if ans > -1:
print(ans)
else:
print(-1) |
p03241 | s288491606 | Wrong Answer | n, m = map(int, input().split())
li = []
for i in range(int(m**0.5) + 1, 0, -1):
if m%i==0:
li.append(i)
for i in li:
if n <= m//i:
print(i)
break |
p03285 | s670851664 | Wrong Answer | n = int(input())
a = n // 4
b = n // 7
print("Yes" if any([(n - 4*i) % 7 == 0 for i in range(a)] + [(n - 7*i) % 4 == 0 for i in range(b)]) else "No") |
p02554 | s274009699 | Wrong Answer | n=int(input())
cnt=(10**n+8**n-2*(9**n))//(10**9+7) |
p03339 | s065579346 | Accepted | n=int(input())
s=list(input())
#i番目の人がリーダーとして
l=[0] #リーダーより左で向きを変える必要がある人数
for i in range(1,n):
w=l[-1]
if s[i-1]=='W':
w+=1
l.append(w)
r=[0] #リーダーより右で向きを変える必要がある人数
for i in reversed(range(n-1)):
e=r[-1]
if s[i+1]=='E':
e+=1
r.append(e)
r.reverse()
# print(l)
# print(r)
ans=n
for i in range(n):
ans=min(r[i]+l[i],ans)
print(ans) |
p03328 | s662474002 | Accepted | a,b=map(int,input().split())
s=0
for i in range(1,b-a+1):
s+=i
print(s-b) |
p02767 | s827533963 | Wrong Answer | n = int(input())
x = [int(i) for i in input().split()]
x.sort()
ans = 10000
for p in range(1,x[-1]*2):
sum =0
for i in range(n):
sum += (x[i]-p)**2
ans = min(ans,sum)
print(ans)
|
p03254 | s748267214 | Accepted | n,x=map(int,input().split())
a=list(map(int,input().split()))
ans=0
a.sort()
for i in a:
x-=i
if x>0:
ans+=1
continue
elif x==0:
ans+=1
break
else:
break
if ans==n:
if x!=0:
ans-=1
print(ans)
|
p03146 | s929630930 | Accepted | def f(n):
if n %2 == 0:return n//2
else: return 3*n+1
s = int(input())
nums = [s] + [0]*10**6
for i in range(1000000):
if f(nums[i]) in nums:
print(i+2)
break
else:
nums[i+1] = f(nums[i])
|
p03657 | s419885471 | Accepted | def main():
A, B = map(int, input().split())
if A % 3 == 0:
print("Possible")
elif B % 3 == 0:
print("Possible")
elif (A + B) % 3 == 0:
print("Possible")
else:
print("Impossible")
main() |
p03998 | s971754982 | Wrong Answer | PA = list(input())
PB = list(input())
PC = list(input())
t = PA[0]
ans = "A"
while PA != [] and PB != [] and PC != []:
if t == "a":
PA = PA[1:]
if len(PA): t = PA[0]
ans = "A"
elif t == "b":
PB = PB[1:]
if len(PB): t = PB[0]
ans = "B"
elif t == "c":
PC = PC[1:]
if len(PC): t = PC[0]
ans = "C"
print(ans) |
p03556 | s653456297 | Wrong Answer | n = int(input())
ans = 0
for i in range(n):
a = i*i
if a<=n:
ans = max(ans, a)
print(ans) |
p03417 | s863524343 | Wrong Answer | N, M = [int(i) for i in input().split()]
if N == 1 and M == 1 :
print(1)
elif N == 1 and M > 1 :
print(M-2)
elif N > 1 :
print((N-2) * (M-2)) |
p03282 | s374491214 | Wrong Answer | S=input()
K=int(input())
ans=0
mod=5*(10**15)
for i in range(len(S)):
a=int(S[i])
if a==1:
ans+=1
else:
ans+=a*mod
if ans>=K:
print(a)
break |
p03289 | s544019279 | Wrong Answer | S = input()
if S[0]=="A" and S[2:-1].count("C")==1:
if S[1:].replace("C","c").islower:
print("AC")
else:
print("WA") |
p03086 | s155108561 | Wrong Answer | s=input()
le=len(s)
lis=[]
for i in range(0,le):
if s[i]!="A" and s[i]!="" and s[i]!="T" and s[i]!="G":
lis.append(i)
lo=0
for j in range(0,len(lis)-1):
if lis[j+1]-lis[j]-1>=lo:
lo=lis[j+1]-lis[j]-1
print(lo) |
p03852 | s866036071 | Accepted | c = input()
if c in "aeiou":
print("vowel")
else:
print("consonant") |
p03962 | s251451470 | Accepted | list = (input().split())
print(len(set(list)))
|
p03379 | s818345807 | Accepted | N = int(input())
X = list(map(int,input().split()))
x = sorted(X)
ms = x[N//2-1]
for i in range(N):
if X[i] > ms:
print(ms)
else:
print(x[N//2]) |
p03607 | s528935282 | Accepted | n = int(input())
dic = {}
for _ in range(n):
a = int(input())
if a in dic:
dic[a] += 1
else:
dic[a] = 1
ans = 0
for i in dic:
if dic[i]%2 == 1:
ans += 1
print(ans)
|
p02835 | s900955608 | Accepted | sums = sum([int(s) for s in input().split()])
if sums < 22:
print('win')
else:
print('bust') |
p02817 | s813234620 | Wrong Answer | a,b = input().split()
print(a+b, sep = "") |
p04033 | s284682138 | Accepted | a,b = map(int,input().split())
if a > 0:
ans = 1
elif a <= 0 and b >= 0:
ans = 0
else:
if (b-a+1)%2 == 0:
ans = 1
else:
ans = -1
if ans == 1:
print("Positive")
elif ans == 0:
print("Zero")
else:
print("Negative") |
p02963 | s512320727 | Accepted | S = int(input())
v = 10 ** 9
x = (v - S % v) % v
y = (S + x) // v
print(0, 0, 10 ** 9, 1, x, y) |
p02952 | s565786285 | Accepted | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
N = int(input())
ans = 0
for i in range(1, N+1):
if len(str(i))%2==1:
ans += 1
print(ans) |
p02748 | s583187602 | Accepted | import sys
readline=sys.stdin.readline
A,B,M=map(int,readline().split())
a=list(map(int,readline().split()))
b=list(map(int,readline().split()))
ans=min(a)+min(b)
for i in range(M):
x,y,c=map(int,readline().split())
x,y=x-1,y-1
if a[x]+b[y]-c<ans:
ans=a[x]+b[y]-c
print(ans)
|
p03323 | s958735418 | Accepted | a,b = map(int,input().split())
if a<=8 and b<=8:
print("Yay!")
else:
print(":(") |
p02730 | s669073851 | Accepted | S = input()
n = len(S)
tmp = (n - 1) // 2
tmp2 = (n + 3) // 2
S2 = S[:tmp]
S3 = S[tmp2 - 1:]
ans = S == S[::-1] and S2 == S2[::-1] and S3 == S3[::-1]
print('Yes' if ans else 'No')
|
p02766 | s525953816 | Accepted | N,K = list(map(int,input().split()))
a = 1
for i in range (1000000000):
N = N//K
if N == 0:
print(a)
break
else:
a = a + 1 |
p02946 | s047314375 | Accepted | K, X = map(int, input().split())
ans = [i for i in range(max(X - K + 1, -1000000), min(X + K, 1000000))]
print(*ans) |
p03030 | s200274673 | Wrong Answer | N = int(input())
L = []
D = {}
for _ in range(N):
k, v = input().split()
v = int(v)
L.append((k, v))
if k not in D.keys():
D[k] = [v]
else:
D[k].append(v)
print(D)
for v in D.values():
v.sort(reverse=True)
D = sorted(D.items(), key=lambda x: x[0])
print(D)
for d in D:
for i in range(len(d[1])):
print(L.index((d[0], d[1][i]))+1) |
p02602 | s293919806 | Accepted | N, K = map(int, input().strip().split(" "))
scores = input().strip().split(" ")
for i in range(K, N):
if (int(scores[i]) > int(scores[i-K])):
print("Yes")
else:
print("No") |
p02995 | s596207055 | Accepted | A, B, C, D = map(int, input().split())
def gcd(a, b):
if b == 0:
return a
return gcd(b, a % b)
lcm = C * D // gcd(C, D)
def get_num(X):
num_c = X // C
num_d = X // D
common = X // lcm
return X - (num_c + num_d) + common
print(get_num(B) - get_num(A - 1))
|
p02897 | s281171376 | Accepted | n = int(input())
sum = 0
for i in range(1, n + 1):
if i % 2 != 0:
sum += 1
print(sum / n)
|
p02796 | s424480581 | Accepted | N = int(input())
A = []
for i in range(N):
x, l = map(int, input().split())
A.append([x+l, x-l])
A.sort()
ans = 1
check1 = A[0]
for i in range(1, N):
check2 = A[i]
if check1[0] <= check2[1]:
ans += 1
check1 = check2
print(ans) |
p02743 | s690569170 | Accepted | a, b, c = map(int, input().split())
print('Yes' if c-a-b > 0 and 4*a*b < (c-a-b) ** 2 else 'No' ) |
p02860 | s396127560 | Wrong Answer | n = int(input())
s = input()
t = s[:n//2 - 1]
if n % 2 == 0:
# flg = t in s[n//2:]
if t == s[n//2:]:
print("Yes")
else:
print("No")
else:
print("No") |
p03860 | s087168950 | Accepted | A, s, C = input().split()
print('A{}C'.format(s[0])) |
p02842 | s328439598 | Accepted | n = int(input())
ans = ":("
for i in range(1,50001):
if (i*1.08)//1 == n:
ans = i
break
print(ans) |
p02939 | s581999864 | Accepted | s = input()
ans = 0
tmp = ''
c = ''
for i in s:
c += i
if c!=tmp:
ans +=1
tmp = c
c=''
print(ans) |
p03438 | s438703489 | Wrong Answer | import sys
N = int(sys.stdin.readline().rstrip())
A = list(map(int, sys.stdin.readline().rstrip().split()))
B = list(map(int, sys.stdin.readline().rstrip().split()))
if N == 1:
if A[0] <= B[0]:
print("Yes")
else:
print("No")
diff = [a - b for a, b in zip(A, B)]
minus = 0
plus = 0
for d in diff:
if d < 0:
minus += d
else:
plus += d
if plus * 2 + minus > 0:
print("No")
else:
print("Yes") |
p02684 | s452020789 | Accepted | n,k=map(int,input().split())
a=list(map(int,input().split()))
visited = [-1]*(n+1)
pos = 1
visited[pos] = 0
loop = 0
root=[1]
for i in range(1,n+1):
pos = a[pos-1]
if visited[pos] == -1:
visited[pos] = i
root.append(pos)
else:
loop = i - visited[pos]
mae = visited[pos]
break
if k < mae:
print(root[k])
else:
index=(k-mae)%loop
print(root[index+mae]) |
p02720 | s184493919 | Accepted | #161_D
import heapq
que = [i for i in range(1, 10)]
cnt = 0
k = int(input())
for i in range(k):
x = heapq.heappop(que)
if (x % 10) > 0:
heapq.heappush(que, x * 10 + (x % 10) - 1)
if (x % 10) < 9:
heapq.heappush(que, x * 10 + (x % 10) + 1)
heapq.heappush(que, x * 10 + (x % 10))
print(x) |
p02570 | s331583980 | Wrong Answer | d,t,s=list(map(int,input().split()))
if t*s>d:
print("Yes")
exit()
print("No") |
p02783 | s379667267 | Accepted | h,a = input().split()
h = int(h)
a = int(a)
ans = h//a
if(h%a!=0):
ans+=1
print(ans) |
p03030 | s595441166 | Accepted | n=int(input())
a=[[""]*3 for ii in range(n)]
for ii in range(n):
s=input().split()
#print(s)
a[ii][0]=s[0]
a[ii][1]=100-int(s[1])
a[ii][2]=ii
a.sort()
for ii in range(n):
print(a[ii][2]+1) |
p03137 | s600233806 | Wrong Answer | n,m = map(int,input().split())
if n >= m :
print(0)
else:
ls=[int(s) for s in input().split()]
ls.sort()
d=[ls[i+1]-ls[i] for i in range(m-1)]
d.sort()
print(sum(d[:n-m]))
|
p02838 | s634606238 | Wrong Answer | mod = 10**9+7
N = int(raw_input())
num0 = [0]*61
num1 = [0]*61
A = map(int, raw_input().split())
for i in range(N):
ai = A[i]
for j in range(61):
if ai & 1 << j:
num1[j] += 1
else:
num0[j] += 1
ans = 0
for i in range(61):
ans = ans + num0[i]*num1[i]*2**i % mod
print int(ans)
|
p02910 | s982525499 | Accepted | S = input()
for i in range(len(S)):
c = S[i]
if (i % 2 == 0 and c == 'L'):
print('No')
exit(0)
if (i % 2 == 1 and c == 'R'):
print('No')
exit(0)
print('Yes')
|
p02773 | s887752438 | Wrong Answer | from collections import Counter
n = int(input())
s = [input() for _ in range(n)]
c = Counter(s)
csort = sorted(c.items(), key=lambda x:x[1],reverse=True)
maxc = csort[0][1]
for s,v in csort:
if v == maxc:
print(s) |
p03623 | s510254237 | Accepted | x, a, b = map(int,input().split())
if abs(x - a) < abs(x - b):
print('A')
else:
print('B') |
p02555 | s422039490 | Accepted | s = int(input())
MOD = int(1e9 + 7)
def c(k, r):
n = 1
for i in range(r):
n = n * (k - i) * pow(i + 1, MOD - 2, MOD) % MOD
return n
ans = sum([c(s - 3 * i + i - 1, i - 1) for i in range(1, s // 3 + 1)]) % MOD
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.