problem_id stringclasses 428 values | submission_id stringlengths 10 10 | status stringclasses 2 values | code stringlengths 5 816 |
|---|---|---|---|
p02789 | s479034991 | Accepted | n,m=map(int,input().split())
print('Yes' if n==m else 'No') |
p02982 | s070164092 | Accepted | N, D = map(int, input().split())
X = [0]*N
for i in range(0, N):
X[i] = list(map(int, input().split()))
s = 0
for i in range(0, N):
for j in range(i, N):
t = 0
for k in range(0, D):
t = t+(X[i][k]-X[j][k])**2
for l in range(1, t+1):
if l**2 == t:
s = s+1
break
print (s) |
p03106 | s257363922 | Wrong Answer | a,b,k=map(int,input().split())
d=[]
for i in range(k+1):
d.append(1)
for i in range(1,100):
if a%i==0 and b%i==0:
d.append(i)
print(d[-1*k]) |
p02556 | s524722611 | Accepted | N = int(input())
que= [[]for i in range(2)]
for i in range(N):
x,y = map(int,input().split())
que[0].append(x-y)
que[1].append(x+y)
que[0].sort()
que[1].sort()
ans = max(que[0][-1]-que[0][0],que[1][-1]-que[1][0])
print(ans)
|
p04019 | s068270181 | Accepted | import sys
input = sys.stdin.readline
from collections import Counter
def main():
S = input().rstrip()
C = Counter(S)
n = C['N']
s = C['S']
w = C['W']
e = C['E']
if (n != 0 and s != 0) or (n == 0 and s == 0):
if (w != 0 and e != 0) or (w == 0 and e == 0):
print('Yes')
else:
print('No')
else:
print('No')
if __name__ == '__main__':
main() |
p02596 | s242014908 | Accepted | k = int(input())
kkk = [0] * k
kkk[0] = 7 % k
ans = -1
for i in range(1, k):
kkk[i] = (kkk[i - 1] * 10 + 7) % k
for j in range(k):
if kkk[j] == 0:
ans = j + 1
break
print(ans)
|
p03103 | s149199971 | Wrong Answer | n,m=map(int,input().split())
dic={}
doll=0
for i in range(n):
a,b=map(int,input().split())
dic[a]=b
con=sorted(dic.items())
for k,v in con:
if v<m:
doll+=k*v
m-=v
else:
doll+=k*m
print(doll)
exit() |
p02748 | s570706735 | Wrong Answer | a,b,m = map(int,input().split())
a = list(map(int,input().split()))
b = list(map(int,input().split()))
lists = [list(map(int,input().split())) for i in range(m)]
a.sort()
b.sort()
Min = min(a) + min(b)
for x,y,c in lists:
x -= 1
y -= 1
Min = min(Min,a[x] + b[y] - c)
print(Min)
|
p03145 | s571099916 | Accepted | a,b,c=map(int,input().split())
print(a*b//2) |
p02947 | s527316047 | Accepted | from collections import Counter
n = int(input())
count_list = []
for i in range(n):
s = input()
c = sorted(Counter(s).items(), key = lambda x:x[0])
tmp = ""
for j in range(len(c)):
tmp += c[j][0]
tmp += str(c[j][1])
count_list.append(tmp)
c = Counter(count_list)
ans = 0
for i in c.values():
if i >= 2:
ans += i * (i - 1) // 2
print(ans)
|
p02780 | s268881466 | Wrong Answer | N , K = map(int, input().split())
p = list(map(int, input().split()))
Etop = 0
E = 0
q = []
for j in p:
q.append((j+1) / 2)
print(q)
for i in range(N-K+1):
E = 0
for n in range(K):
E += q[n+i]
if E > Etop:
Etop = E
print(Etop) |
p02730 | s603351645 | Accepted | s=input()
n=len(s)
x=(n-1)//2
i=0
while i<x:
if s[i]!=s[n-1-i] or s[i]!=s[x-1-i]:
print('No')
break
i=i+1
else:
print('Yes') |
p03774 | s257085304 | Accepted | n, m = map(int, input().split())
ab = list(map(int, input().split()) for i in range(n))
cd = list(list(map(int, input().split())) for i in range(m))
for a, b in ab:
md = 1001001001
res = 0
for i in range(m):
tmp = abs(a - cd[i][0]) + abs(b - cd[i][1])
if tmp < md:
md = tmp
res = i + 1
print(res)
|
p02801 | s733980456 | Wrong Answer | C = input()
if C == "z":
pass
else:
print(C) |
p03416 | s173165326 | Wrong Answer | a,b = input().split()
count = 0
anum = int(a)
bnum = int(b)
# a = list(a)
# b = list(b)
for i in range(anum,bnum):
stra = str(i)
if stra[0:2] == stra[3:5]:
print(stra[0:2])
print(stra[3:])
count += 1
print(count)
|
p02700 | s747821931 | Accepted | A,B,C,D = map(int,input().split())
while A > 0 or C > 0:
C = C-B
if C <= 0:
print('Yes')
break
A = A-D
if A <= 0:
print('No')
break
|
p02631 | s509833566 | Accepted | n = int(input())
arr = [int(i) for i in input().split()]
left = [0]*n
xor = arr[0]
for i in range(1, n):
left[i] = xor
xor ^= arr[i]
right = [0]*n
xor = arr[n-1]
for i in range(n-2, -1, -1):
right[i] = xor
xor ^= arr[i]
for i in range(n):
arr[i] = left[i] ^ right[i]
print(*arr) |
p04019 | s636292136 | Accepted | s = list(input())
ew = []
sn = []
for i in s:
if i == "E" or i == "W":
ew.append(i)
else:
sn.append(i)
if len(set(ew)) == 1 or len(set(sn)) == 1:
print("No")
else:
print("Yes") |
p03161 | s716431781 | Wrong Answer | N,K=map(int,input().split())
H=list(map(int,input().split()))
cost =200000
DP=[0]*(N+10)
DP[0]=0
DP[1]=abs(H[1]-H[0])
for i in range(2,N):
cost=200000
for k in range(max(i-K,0),i):
cost=min(cost,(abs(H[i]-H[k])+DP[k]))
DP[i]=cost
print(DP[N-1]) |
p03286 | s715444601 | Accepted | import itertools
N = int(input())
if N == 0:
print(0)
exit()
ans = []
while N !=0:
ans.append(N%2)
N = -(N-N%2)//2
ans.reverse()
print("".join(list(map(str,ans)))) |
p03494 | s265543823 | Accepted | N = int(input())
A = list(map(int, input().split()))
res = 10 ** 9
for a in A:
t = 0
while a % 2 == 0:
t += 1
a //= 2
res = min(res, t)
print(res) |
p03449 | s553185808 | Accepted | N = int(input())
query = [list(map(int, input().split())) for _ in range(2)]
ans = []
for i in range(N):
ans.append(sum(query[0][:i+1])+sum(query[1][i:]))
print(max(ans)) |
p02554 | s951076511 | Accepted | n = int(input())
mod = 10**9+7
ans = pow(10,n,mod)-pow(9,n,mod)*2+pow(8,n,mod)
print(ans%mod) |
p02687 | s812391751 | Wrong Answer | import itertools
s = input()
if s =="ABC":
print("ARC")
else:
print("ARC") |
p03814 | s902226141 | Wrong Answer | s = input()
i, j = 0, len(s)-1
while(1):
if s[i] == "A":
start = i
break
i += 1
while(1):
if s[j] == "Z":
end = j + 1
break
j -= 1
print(s[start:end]) |
p04044 | s826881710 | Accepted | n,l=map(int,input().split())
s=[""]*n
for i in range(n):
s[i]=input()
s=sorted(s)
ans=""
for i in range(n):
ans=ans+s[i]
print(ans) |
p03000 | s930341729 | Accepted | n,x=map(int,input().split())
l=list(map(int,input().split()))
b=0
cnt=0
for i in l:
b+=i
cnt+=1
if b>x:
print(cnt)
exit()
print(n+1) |
p02583 | s490514826 | Accepted | from itertools import combinations
n = int(input())
lst = list(map(int, input().split()))
comb = combinations(lst, 3)
count = 0
for i in comb:
if i[0] != i[1] and i[1] != i[2] and i[0] != i[2]:
if i[0] + i[1] > i[2] and i[1] + i[2] > i[0] and i[0] + i[2] > i[1]:
count += 1
print(count)
|
p02817 | s101741059 | Wrong Answer | s,t = input().split()
print(s+t) |
p02622 | s019465210 | Accepted | S = input()
T = input()
cnt = 0
for i in range(0,len(S)):
if S[i]!=T[i]:
cnt += 1
print(cnt) |
p02621 | s872402910 | Wrong Answer | def cal():
a = str(input())
n = a + a**2 + a**3
print(n)
|
p03106 | s205535768 | Accepted | a,b,k=map(int,input().split())
cnt=0
for i in range(100,0,-1):
if a%i==0 and b%i==0:
cnt+=1
if cnt==k:
print(i)
break |
p02993 | s033311645 | Wrong Answer | S = list(input())
for i in range(2):
if S[i] == S[i+1]:
print("Bad")
exit()
print("Good") |
p03760 | s005134845 | Accepted | #abc058 b
O=input()
E=input()
ans=""
for i in range(len(E)):
ans+=O[i]+E[i]
if len(O)!=len(E):
ans+=O[-1]
print(ans)
|
p03627 | s883036734 | Accepted | from collections import Counter
n=int(input())
a=list(map(int,input().split()))
c=Counter(a)
l4,l2=[],[]
for k,v in c.items():
if v>=4:l4.append(k)
if v>=2:l2.append(k)
l4.sort(reverse=True)
l2.sort(reverse=True)
if len(l4)<=2:l4+=[0,0]
if len(l2)<=2:l2+=[0,0]
print(max(l4[0]*l4[1],l4[0]*l2[0],l2[0]*l2[1]))
|
p03457 | s591571855 | Wrong Answer | N = int(input())
nx = 0
ny = 0
nt = 0
for _ in range(N):
t, x, y = map(int, input().split())
k = abs(nx-x)+abs(ny-y)
if k > t:
print("No")
break
if (k-t)%2 != 0:
print("No")
break
nx = x
ny = y
nt = t
else:
print("Yes") |
p02783 | s113741465 | Accepted | from math import ceil
h, a = map(int, input().split())
print(ceil(h/a))
|
p03309 | s071374303 | Accepted | import math
n = int(input())
lst = list(map(int, input().split()))
res = 0
lst2 = [0]*n
for i in range(n):
lst2[i] = lst[i] - i
lst2.sort()
p = lst2[n//2]
q = lst2[n//2-1]
ps = qs = 0
for i in range(n):
ps += abs(lst[i] - (p+i))
qs += abs(lst[i] - (q+i))
print(min(ps, qs)) |
p02582 | s647834681 | Accepted | s = input()
w = ["R","RR","RRR"]
ans = 0
for i in range(3):
if w[i] in s:
ans = i + 1
print(ans) |
p02862 | s562890335 | Wrong Answer | def product(n, r):
S = max(r, 1)
while n > r:
S *= n
n -= 1
return S
def C(n,r):
return(product(n,r)//product(n-r,1))
X, Y = map(int, input().split())
k = (X + Y) % 3
if k != 0:
print(0)
else:
k = (X + Y) // 3
l = abs(X-2*k)
print(C(k,l)%(10**9+7)) |
p02600 | s827974353 | Accepted | X = int(input())
if 400 <= X < 600:
print('8')
elif 600<= X < 800:
print('7')
elif 600 <= X < 1000:
print('6')
elif 800 <= X < 1200:
print('5')
elif 1000 <= X < 1400:
print('4')
elif 1200 <= X < 1600:
print('3')
elif 1400 <= X < 1800:
print('2')
elif 1800 <= X < 2000:
print('1') |
p02631 | s056906519 | Accepted | N = int(input())
A = list(map(int, input().split()))
xor = A[0]
for i in range(1, len(A)):
xor = xor^A[i]
ans = []
for ai in A:
ans += [xor^ai]
print(' '.join(list(map(str, ans)))) |
p02972 | s201419771 | Accepted | N = int(input())
A = list(map(int,input().split()))
BOX = [None for i in range(N)]
ANS_LIST = []
for i in range(N-1,-1,-1):
loop = N//(i+1)
cnt = 0
for j in range(loop):
if BOX[(i+1)*(j+1)-1]!=None:
cnt+=BOX[(i+1)*(j+1)-1]
BOX[i]=(cnt-A[i])%2
for i in range(N):
if BOX[i]==1:
ANS_LIST.append(i+1)
print(sum(BOX))
print(*ANS_LIST) |
p02725 | s842691876 | Accepted | K,N=map(int,input().split())
A=list(map(int,input().split()))
A+=[K+A[0]]
B=[A[i+1]-A[i] for i in range(N)]
print(K-max(B)) |
p02642 | s649056131 | Accepted | n = int(input())
a = list(map(int,input().split()))
MAX = 10**6+1
is_divided = [0]*MAX
is_appeared = [0]*MAX
for i in range(n):
if not is_divided[a[i]]:
if not is_appeared[a[i]]:
is_appeared[a[i]] = 1
k = a[i]*2
while k < MAX:
is_divided[k] = 1
k += a[i]
else:
is_divided[a[i]] = 1
ans = 0
for i in range(n):
if not is_divided[a[i]]:
ans += 1
print(ans) |
p02900 | s411610238 | Accepted | #素因数分解
def prime_factor(n):
ass = []
for i in range(2,int(n ** 0.5) + 1):
while n % i == 0:
ass.append(i)
n = n // i
if n != 1:
ass.append(n)
return ass
a,b=map(int,input().split())
a=list(set(prime_factor(a)))
b=list(set(prime_factor(b)))
arr=[i for i in a if i in b]
print(len(arr)+1)
|
p03836 | s179131023 | Wrong Answer | S=list(map(int,input().split()))
sx=S[0]
sy=S[1]
tx=S[2]
ty=S[3]
answer=[]
for i in range(ty-sy):
answer.append("U")
for i in range(tx-sx):
answer.append("R")
for i in range(ty-sy):
answer.append("D")
for i in range(tx-sx):
answer.append("L")
answer.append("D")
for i in range(tx-sx+1):
answer.append("R")
for i in range(ty-sy+2):
answer.append("U")
for i in range(tx-sx+1):
answer.append("L")
for i in range(tx-sx+2):
answer.append("D")
answer.append("R")
for s in answer:
print(s,end="")
|
p03106 | s183186923 | Wrong Answer | a,b,k=map(int,input().split())
d=[]
for i in range(1,b+1):
if a%i==0 and b%i==0:
d.append(i)
print(d[k-1]) |
p02552 | s091352969 | Accepted | x=int(input())
print (0 if x==1 else 1) |
p03417 | s678692061 | Wrong Answer | n,m=[int(i) for i in input().split()]
print(max(0,(n-2)*(m-2))) |
p03251 | s478679274 | Accepted | INT = lambda: int(input())
INTM = lambda: map(int,input().split())
STRM = lambda: map(str,input().split())
STR = lambda: str(input())
LIST = lambda: list(map(int,input().split()))
LISTS = lambda: list(map(str,input().split()))
def do():
n,m,x,y=INTM()
xs=LIST()
xs.append(x)
ys=LIST()
ys.append(y)
#print(xs,ys)
if max(xs)>=min(ys):
print('War')
else:
print('No War')
if __name__ == '__main__':
do() |
p03282 | s877067558 | Wrong Answer |
import collections
def solve():
S = list(input())
K = int(input())
for i in range(K):
if S[i] != 1:
print(S[i])
exit()
print(1)
if __name__ == "__main__":
solve()
|
p03324 | s436377859 | Accepted | D,N = map(int,input().split())
if N == 100:
N += 1
print(N*(100**D)) |
p03095 | s282526142 | Wrong Answer | n = int(input())
s = input()
#文字ごとの累積和を取っておく
acc_char = [0 for i in range(26)]
ans = 0
for i in range(n):
#今回の数字は使うの確定
char = s[i]
plus = 1
for j in range(len(acc_char)):
if (ord(char) - ord('a')) != j:
plus *= acc_char[j] + 1
ans += plus
acc_char[ord(char) - ord('a')] += 1
print(ans) |
p02615 | s055037421 | Wrong Answer | import sys
n = int(sys.stdin.readline())
a = list(map(int, sys.stdin.readline().split()))
a.sort()
a.pop(0)
print(sum(a))
|
p04005 | s911116428 | Accepted | l = list(map(int, input().split()))
if l[0] % 2 == 0 or l[1] % 2 == 0 or l[2] % 2 == 0:
print(0)
else:
ans = 1
max_idx = l.index(max(l))
for i in range(3):
if i != max_idx:
ans *= l[i]
print(ans) |
p02879 | s430644660 | Accepted | tmp = input().split(" ")
A = int(tmp[0])
B = int(tmp[1])
if A <= 9 and B <= 9:
print(A * B)
else:
print("-1") |
p03971 | s301787432 | Accepted | n,a,b=map(int,input().split())
s=input()
ans=list('No'for _ in range(n))
c=a+b
countY=0
countb=0
for i in range(n):
if countY<c:
if s[i]=='a':
ans[i]='Yes'
countY+=1
if s[i]=='b' and countb<b:
ans[i]='Yes'
countY+=1
countb+=1
print(*ans,sep='\n') |
p03000 | s482935584 | Wrong Answer | import sys
N , X = map(int,input().split())
L = list(map(int,input().split()))
D = 0
for i in range(0,N):
D += L[0]
if D > X :
print(i)
sys.exit()
print(N)
|
p02775 | s048608234 | Accepted | n = input()
n = n[::-1] + '0'
inf = 10 ** 9
dp = [[inf for _ in range(2)] for _ in range(len(n) + 1)]
dp[0][0] = 0
dp[0][1] = 2
for i in range(len(n)):
n_i = int(n[i])
dp[i + 1][0] = min(dp[i][0] + n_i, dp[i][1] + n_i)
dp[i + 1][1] = min(dp[i][0] + 11 - n_i, dp[i][1] + 9 - n_i)
print(min(dp[-1][0], dp[-1][1])) |
p02789 | s370892070 | Wrong Answer | a,b = map(int,input().split(' '))
if a == b:
print("yes")
else:
print("no")
|
p02658 | s133183771 | Accepted | N = int(input())
A = list(map(int, input().split()))
if 0 in A:
ans = 0
else:
ans = 1
for Ai in A:
ans *= Ai
if ans > 10 ** 18:
ans = -1
break
print(ans)
|
p03971 | s163456128 | Wrong Answer | N, A, B = map(int, input().split())
S = input()
passed = 0
foreigner = 0
for s in S:
if s == "c":
print("No")
elif s == "a":
if passed < A + B:
print("Yes")
passed += 1
else:
print("No")
elif s == "b":
if passed < A + B and foreigner <= B:
print("Yes")
passed += 1
foreigner += 1
else:
print("No") |
p02578 | s913643803 | Wrong Answer | from sys import stdin, setrecursionlimit
from collections import Counter, deque, defaultdict
from math import floor, ceil
from bisect import bisect_left
from itertools import combinations
setrecursionlimit(100000)
INF = int(1e10)
MOD = int(1e9 + 7)
def main():
from builtins import int, map
N = int(input())
A = list(map(int, input().split()))
count = 0
for i in range(1, N):
diff = A[i - 1] - A[i]
if diff < 0:
count += abs(diff)
print(count)
if __name__ == '__main__':
main()
|
p02996 | s735059078 | Wrong Answer | n = int(input())
ab = [list(map(int,input().split())) for _ in range(n)]
ab =sorted(ab, key = lambda x:x[1])
ans = 0
for i in ab:
ans+=i[0]
if ans > i[1]:
print(ans, i[0], i[1])
print("No")
exit()
print("Yes")
|
p03331 | s070796239 | Wrong Answer | n = int(input())
candi = []
for i in range(2,int(n/2+1)):
j = n - i
candi.append([i,j])
#candi = [[2, 13], [3, 12], [4, 11], [5, 10], [6, 9], [7, 8]]
ans = 0
for a,b in candi:
count = 0
a = str(a)
b = str(b)
for i in a:
count += int(i)
for i in b:
count += int(i)
if ans == 0 :
ans = count
ans = min(ans,count)
print(ans) |
p03659 | s354074473 | Accepted | n=int(input())
a=list(map(int,input().split()))
from itertools import accumulate
s=list(accumulate(a))
a_sum=sum(a)
ans=10**18
if n==2:
print(abs(a[0]-a[1]))
exit(0)
for i in range(1,n-1):
x=s[i]
y=a_sum-x
ans=min(ans,abs(x-y))
print(ans)
|
p03386 | s767242405 | Accepted | s=input().split()
i=int(s[0])
j=int(s[1])
k=int(s[2])
a=[]
for l in range(k):
if i+l<=j:
a.append(str(i+l))
else:
break
b=int(a[-1])
if b>=j-k and b<j:
for l in range(1,j-b+1):
if b+l<=j:
a.append(str(b+l))
elif b<j-k:
for l in range(k-1,-1,-1):
if j-l<=j:
a.append(str(j-l))
print(*a)
|
p02631 | s705426505 | Wrong Answer | n = int(input())
xor_arr = list(map(int, input().split()))
xor_of_xor = 0
for elm in xor_arr:
xor_of_xor = xor_of_xor ^ elm
scarf_val = [xor_of_xor ^ elm for elm in xor_arr]
print(scarf_val) |
p02697 | s935949418 | Accepted | N, M = map(int, input().split())
odd_l = 1
odd_r = M
even_l = M + 1
even_r = 2 * M + 1
i = 0
while i < M:
print(even_l, even_r)
i += 1
if i == M:
break
print(odd_l, odd_r)
i += 1
odd_l += 1
odd_r -= 1
even_l += 1
even_r -= 1
|
p02684 | s739514826 | Wrong Answer | import copy
N,K=map(int,input().split())
A=list(map(int,input().split()))
i=A[0]
for _ in range(N+K%N-1):
i=A[i-1]
print(i) |
p02813 | s473882542 | Wrong Answer | import itertools
# 各種変数の取り込み
num = int(input())
a = tuple(map(int, input().split()))
b = tuple(map(int, input().split()))
l = range(1, num + 1)
p = list(itertools.permutations(l))
ans = p.index(b) - p.index(a)
print(ans) |
p03145 | s312031831 | Wrong Answer | AB,BC,CA=map(int,input().split())
print(AB*BC/2) |
p02801 | s775686351 | Wrong Answer | alpha = input()
a_code = ord('a')
z_code = ord('z')
alpha_code = ord(alpha)
if alpha_code >= a_code and alpha_code < z_code:
next_alpha_code = alpha_code + 1
next_alpha = chr(next_alpha_code)
print(alpha + 'の次は' + next_alpha + 'です。') |
p02880 | s240124816 | Accepted | N=int(input())
for i in range(1,10):
for j in range(1,10):
if i*j==N:
print("Yes")
break
else:
continue
break
else:
print("No")
|
p04020 | s316809365 | Accepted | N = int(input())
cnt = 0
tmp = 0
for _ in range(N):
a = int(input())
if a == 0:
cnt += tmp//2
tmp = 0
else:
tmp += a
cnt += tmp//2
print(cnt)
|
p03632 | s730375928 | Accepted | a,b,c,d=map(int,input().split())
if b<c or a>d:
print(0)
else:
print(min(b-c,d-a,b-a,d-c))
|
p03862 | s315346498 | Wrong Answer | n,x=[int(i) for i in input().split()]
a=[int(i) for i in input().split()]
add_a=[]
for i in range(n-1):
add_a.append(max(a[i]+a[i+1]-x,0))
ans=0
for i in range(n-1):
ans+=add_a[i]
if i!=n-2:
add_a[i+1]=max(0,add_a[i+1]-add_a[i])
add_a[i]=0
print(ans) |
p02790 | s950575061 | Accepted | N, M = input().strip().split(" ")
array = []
array.append(N*int(M))
array.append(M*int(N))
ans = sorted(array)
print(ans[0]) |
p03319 | s564120832 | Accepted | import math
N, K = map(int, input().split())
A = list(map(int, input().split()))
print(math.ceil((N-1)/(K-1))) |
p03011 | s821161249 | Accepted | p,q,r = map(int,input().split())
ans = p+q+r-max(p,q,r)
print(ans) |
p02888 | s356417230 | Wrong Answer | n = int(input())
l = sorted(list(map(int,input().split())))
ans = 0
for ai in range(n):
for bi in range(ai+1,n):
ng,ok = bi,n
while ok-ng>1:
mid = (ng+ok)//2
if l[mid]<l[ai]+l[bi]:
ok = mid
else:
ng = mid
ans += n-ng-1
print(ans) |
p02768 | s149125402 | Accepted | import math
m=10**9+7
n,a,b=map(int,input().split())
if(a>n//2):
a = n-a
if(b>n//2):
b = n-b
aa=min(a,b)
bb=max(a,b)
na=1
nb=1
da=1
db=1
for i in range(aa):
na=na*(n-i)%m
da=da*(1+i)%m
nb=nb*(n-i)%m
db=db*(1+i)%m
for i in range(aa,bb):
nb=nb*(n-i)%m
db=db*(1+i)%m
CA=(na*pow(da,m-2,m))%m
CB=(nb*pow(db,m-2,m))%m
c=pow(2,n,m)-CA-CB-1
print(c%m) |
p02711 | s764212517 | Accepted | N = input()
if N.count("7") > 0:
print("Yes")
else:
print("No")
|
p02880 | s619047955 | Accepted | n = int(input())
result = 'No'
for i in range(1,10):
if n / i in [1,2,3,4,5,6,7,8,9]:
result = 'Yes'
print(result) |
p03012 | s908172684 | Wrong Answer | N = int(input())
W = list(map(int,input().split()))
s1 = 0;s2 = 0
min = 1001001001
for T in range(1,N-1):
for i in range(T):
s1 += W[i]
for i in range(T,N):
s2 += W[i]
if abs(s1-s2) < min:
min = abs(s1-s2)
s1 = 0;s2 = 0
print(min) |
p02696 | s869195278 | Wrong Answer | A,B,N = list(map(int,input().split()))
print(min(N,B-1)) |
p03698 | s862063741 | Wrong Answer | s=list(str(input()))
print('Yes' if len(list(set(s)))==len(s) else 'No')
|
p02595 | s586256470 | Accepted | #!/usr/bin/env python3
n, d = map(int, input().split())
d = d**2
ans = 0
for _ in range(n):
x, y = map(int, input().split())
if x**2 + y**2 <= d:
ans += 1
print(ans) |
p02660 | s502786231 | Accepted | N = int(input())
arr = []
for i in range(2, int(-(-N**0.5//1))+1):
if N == 1:
break
if N % i == 0:
cnt = 0
while N % i == 0:
cnt += 1
N = int(N / i)
arr.append([i, cnt])
if N != 1:
arr.append([N, 1])
n = 0
for p, e in arr:
temp = e
j = 0
while temp > 0:
j += 1
temp = temp - j
if temp < 0:
break
n += 1
print(n)
|
p02596 | s808581640 | Accepted | k = int(input())
if k % 2 == 0 or k % 5 == 0:
print(-1)
exit()
n = 7
for i in range(1,10**7):
if n%k == 0:
print(i)
break
else:
n = (n%k +0.7) *10
|
p03486 | s680839920 | Accepted | s = list(input())
t = list(input())
s.sort()
t.sort(reverse=True)
a = []
a.append(s)
a.append(t)
if a == sorted(a) and s != t:
print("Yes")
else:
print("No")
|
p03146 | s048586946 | Accepted | import math
def resolve():
import sys
input = sys.stdin.readline
# row = [int(x) for x in input().rstrip().split(" ")]
# n = int(input().rstrip())
s = int(input().rstrip())
opened = set()
opened.add(s)
prev = s
m = 1
while True:
m += 1
y = int(prev / 2) if prev % 2 == 0 else (3 * prev + 1)
if y in opened:
print(m)
break
prev = y
opened.add(y)
if __name__ == "__main__":
resolve()
|
p02971 | s303591515 | Wrong Answer | n = int(input())
a = list(input() for i in range(n))
M = max(a)
if a.count(M) > 1:
for i in range(n):
print(M)
else:
M2 = sorted(set(a))[-2]
for i in range(n):
if a[i] == M:
print(M2)
else:
print(M) |
p02957 | s881642415 | Wrong Answer | a, b = map( int, input().split())
c = max(a,b)-min(a,b)
if c % 2 == 0:
print(c // 2)
else:
print("IMPOSSIBLE") |
p02647 | s672915282 | Wrong Answer | N, K= map(int,input().split())
A = list(map(int,input().split()))
p=0
while p<41:
B=[0]*(N+1)
for i in range(N):
l = max(i-A[i],0)
r = min(i+A[i]+1,N)
B[l] +=1
B[r] -=1
for i in range(N):
A[i] = sum(B[0:i+1])
p +=1
if min(A)==N:
break
print(*A) |
p04034 | s435133496 | Accepted | n, m = [int(w) for w in input().split()]
lb = [False] * n
lb[0] = True
lbn = [1] * n
for i in range(m):
x, y = [int(w)-1 for w in input().split()]
if lb[x] and lbn[x] > 0:
lb[y] = True
lbn[x] -= 1
lbn[y] += 1
if lb[x] and lbn[x] == 0:
lb[x] = False
print(len([_ for _ in lb if _]))
|
p04029 | s042436589 | Accepted | import bisect,collections,copy,heapq,itertools,math,string
import sys
def S(): return sys.stdin.readline().rstrip()
def M(): return map(int,sys.stdin.readline().rstrip().split())
def I(): return int(sys.stdin.readline().rstrip())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split()))
def LS(): return list(sys.stdin.readline().rstrip().split())
N = I()
ans = 0
for i in range(1, N+1):
ans += i
print(ans) |
p03711 | s049359853 | Wrong Answer | x,y = map(int,input().split())
li = [[1, 3, 5, 7, 8, 10, 12], [4, 6, 9, 11], [2]]
for i, l in enumerate(li):
if x in l and y in l:
print("YES")
break
if i == len(li) - 1:
print("No")
|
p03944 | s960801647 | Wrong Answer | x_max, y_max, N = map(int, input().split())
x_min, y_min = 0, 0
l = [input().split() for _ in range(N)]
for i in range(N):
if l[i][2] == 1:
x_min = max(x_min, l[i][0])
elif l[i][2] == 2:
x_max = min(x_max, l[i][0])
elif l[i][2] == 3:
y_min = max(y_min, l[i][1])
elif l[i][2] == 4:
y_max = min(y_max, l[i][1])
if x_max-x_min > 0 and y_max-y_min:
print((x_max-x_min)*(y_max-y_min))
else:
print(0)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.