problem_id stringclasses 428
values | submission_id stringlengths 10 10 | status stringclasses 2
values | code stringlengths 5 816 |
|---|---|---|---|
p03254 | s069999870 | Accepted | n, x = map(int, input().split())
a = list(map(int, input().split()))
a.sort()
total = sum(a)
ans = 0
if x == total:
ans = n
elif x > total:
ans = n - 1
else:
for v in a:
x -= v
if x < 0:
break
ans += 1
print(ans) |
p02831 | s065860500 | Wrong Answer | Ar =list(map(int,input().split()))
if Ar[0]>=Ar[1]:
A=Ar[0]
B=Ar[1]
else:
A=Ar[1]
B=Ar[0]
print(A,B)
r=None
while r!=0:
r = (A%B)
A = B
B = r
Ans=int(Ar[0]*Ar[1]/A)
print(Ans) |
p04043 | s445362756 | Accepted | abc = list(map(int,input().split()))
print("YES" if sum(abc) == 17 and abc.count(5) else "NO") |
p03680 | s212661807 | Wrong Answer | def main():
N = int(input())
switches = [int(input()) for _ in range(N)]
count = 0
cur = 0
nxt = 0
for i in range(2*N):
count += 1
if switches[cur] == 2:
print(count)
break
nxt = switches[cur] - 1
if switches[nxt] - 1 == cur:
... |
p02882 | s674805594 | Accepted | import math
a, b, x = map(int, input().split())
A, B = a**2, b**2
print(math.degrees(math.asin((B / ((2 * x / (a * b))**2 + B))**0.5) if 2 * x <=
a * a * b else math.acos((A / ((2 * (a * a * b - x) / A)**2 + A))**0.5)))
|
p03161 | s356886763 | Accepted | N,K = map(int,input().split())
H = list(map(int,input().split()))
def main(N,K,H):
dp = [0]*N
for i in range(1,N):
L = [dp[j]+abs(H[i]-H[j]) for j in range(max(0,i-K),i)]
dp[i] = min(L)
print(dp[-1])
main(N,K,H) |
p03162 | s405496936 | Wrong Answer | from sys import stdin
#from collections import deque
#from math import sqrt, floor, ceil, log, log2, log10, pi, gcd, sin, cos, asin
def ii(): return int(stdin.readline())
def fi(): return float(stdin.readline())
def mi(): return map(int, stdin.readline().split())
def fmi(): return map(float, stdin.readline().split())
d... |
p02744 | s319257415 | Accepted | import sys
sys.setrecursionlimit(10 ** 7)
ans = []
def solve(x, n, s):
if len(s) == n:
ans.append(s)
return
for i in range(x+2):
solve(max(x, i), n, s + chr(ord("a") + i))
def main():
n = int(input())
solve(0, n, "a")
ans.sort()
for s in ans:
print(s)
if __name_... |
p02957 | s817733143 | Accepted | a, b = map(int, input().split())
if (a + b) % 2 == 0:
print((a + b) // 2)
else:
print('IMPOSSIBLE') |
p02765 | s729298081 | Accepted | n,r=map(int,input().split())
if n>=10:
print(r)
else:
print(r+1000-100*n)
|
p03067 | s489034768 | Accepted | A,B,C = map(int, input().split())
print("YNeos"[(B-C)*(C-A)<0::2]) |
p02727 | s063436811 | Wrong Answer | import sys
input = sys.stdin.readline
from itertools import chain
def readlines(*abc):
for n in abc:
yield list(map(int, input().split()))[:n]
def main():
x, y, a, b, c = map(int, input().split())
apples = sorted(chain(*readlines(a,b,c)), reverse=True)
print(sum(apples[:x+y]))
main()
|
p03861 | s727631025 | Accepted | a, b, x = map(int, input().split())
def f (n):
if n == -1:
return 0
else:
return n // x + 1
print(f(b) - f(a-1)) |
p02971 | s251302491 | Accepted | n = int(input())
a = []
for _ in range(n):
a.append(int(input()))
sa = sorted(a, reverse=True)
for i in range(n):
if sa[0] == a[i]:
print(sa[1])
else:
print(sa[0])
|
p03861 | s235391635 | Accepted | a, b, x = map(int, input().split())
ans = b // x - (a - 1) // x
print(ans) |
p03681 | s926396050 | Accepted | n,m=map(int,input().split())
MOD=10**9+7
ans = 1
if abs(n-m) > 1:
print(0)
exit()
else:
if abs(n-m) == 0:
for i in range(1,n+1):
ans = ans*i%MOD
for i in range(1,m+1):
ans = ans*i%MOD
ans = ans*2%MOD
else:
for i in range(1,n+1):
ans = ans*i%MOD
for i in range(1,m+1):
... |
p03377 | s362878388 | Accepted | a, b, x = map(int, input().split())
if a <= x <= a + b:
print('YES')
else:
print('NO') |
p02761 | s898765442 | Wrong Answer | N, M = map(int, input().split())
arr = []
ans = [0] * N
for i in range(M):
s, c = map(int, input().split())
print(s, c)
if s == 1 and c == 0 and N != 1:
print(-1)
exit(0)
if s in arr and ans[s-1] != c:
print(-1)
exit(0)
arr.append(s)
ans[s-1] = c
print("".join([st... |
p03380 | s802433701 | Accepted | n = int(input())
a = list(map(int, input().split()))
a.sort()
res = a[0]
ma = a[-1]
for i in range(1, n-1):
if min(a[i], ma-a[i]) >= min(res, ma-res):
res = a[i]
print(ma, res) |
p02647 | s175965299 | Accepted | import sys
def MI(): return map(int,sys.stdin.readline().rstrip().split())
def LI(): return list(map(int,sys.stdin.readline().rstrip().split())) #空白あり
N,K = MI()
A = LI()
from itertools import accumulate
for _ in range(min(K,41)):
B = [0]*(N+1)
for i in range(N):
a = A[i]
B[max(i-a,0)] += 1... |
p02657 | s284282528 | Accepted | import sys, math, itertools, collections, bisect
input = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')
inf = float('inf') ;mod = 10**9+7
mans = inf ;ans = 0 ;count = 0 ;pro = 1
a,b = map(int,input().split())
print(a*b) |
p02801 | s744153542 | Accepted | s = "abcdefghijklmnopqrstuvwxyz"
C = input()
for i in range(len(s)):
if(s[i] == C):
print(s[i+1]) |
p03339 | s989610478 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Sat Sep 19 20:18:57 2020
@author: liang
"""
N = int(input())
S = input()
tmp = 0
for i in range(1,N):
if S[i] == "E":
tmp += 1
ans = 10**6
for i in range(N):
if ans > tmp:
ans = tmp
if i == N-1:
break
if S[i] == "W":
tmp += 1
... |
p02922 | s148568875 | Accepted | # 139 B # nxt try
a, b = map(int, input().split())
ans = 0
temp = 1
while temp < b:
temp -= 1
temp += a
ans += 1
print(ans) |
p03827 | s137942316 | Accepted | n = int(input())
s = input()
x = 0
ans = 0
for i in range(len(s)):
if(s[i] == 'I'):
x += 1
if(x > ans):
ans = x
else:
x -= 1
print(ans) |
p02994 | s879859225 | Accepted | n,l=map(int,input().split())
if l>=0: print(sum(l+i for i in range(1,n)))
elif l+n-1>=0: print(sum(l+i for i in range(n)))
else: print(sum(l+i for i in range(n-1))) |
p02554 | s007354242 | Accepted | N = int(input())
mod = 10**9 + 7
if N < 2:
print(0)
exit()
all = pow(10, N, mod)
sabun = pow(9, N, mod) * 2 - pow(8, N, mod)
ans = ((all % mod) - sabun) % mod
print(ans)
|
p02843 | s659617943 | Accepted | n=int(input())
cnt=n//100
if n%100<=cnt*5:
print(1)
else:
print(0) |
p02790 | s250301042 | Wrong Answer | b = input()
c =b.split(" ")
print(int(c[0])*c[1]) |
p02785 | s950811314 | Wrong Answer | HK = list(map(int, input().split()))
M = list(map(int, input().split()))
M.sort(reverse=True)
k = HK[1]
while k > 0 | len(M) > 0:
M.pop(0)
k -= 1
damage = 0
for i in range(len(M)):
damage += M[i]
print(damage) |
p03041 | s274088879 | Accepted | n, k = map(int, input().split())
S = input()
s = S[:k-1] + S[k-1].lower() + S[k:]
print(s) |
p03632 | s776548565 | Accepted | a, b, c, d = map(int, input().split())
al = set([i for i in range(a, b)])
bo = set([i for i in range(c, d)])
print(len(al&bo)) |
p02982 | s183260170 | Accepted | #B - Good Distance
import math
N,D = map(int,input().split())
X = []
for _ in range(N):
Xi = list(map(int,input().split()))
X.append(Xi)
count = 0
for i in range(N):
for k in range(i+1,N):
D_sqrt = 0
for j in range(D):
D_sqrt += (X[i][j] - X[k][j])**2
D_ans = math.sqrt(D_... |
p02789 | s479503533 | Wrong Answer | a,b = (int(x) for x in input().split())
if a > b:
b = str(b)
print(b * a)
else:
a = str(a)
print(a * b) |
p02996 | s062394539 | Accepted | n = int(input())
tasks=[]
for i in range(n):
a,b = map(int, input().split())
tasks.append([a, b])
tasks.sort(key=lambda x:x[1])
current_time = 0
for task in tasks:
current_time+=task[0]
if current_time>task[1]:
print("No")
exit()
print("Yes")
|
p03434 | s047222895 | Accepted | n=int(input())
ans=0
A=sorted(list(map(int,input().split())))[::-1]
for i in range(n):
if i % 2 == 0:
ans += A[i]
else:
ans -= A[i]
print(ans) |
p03698 | s747937510 | Wrong Answer | s = input()
t = set(s)
print("yes" if len(s) == set(t) else "no") |
p02675 | s502023195 | Wrong Answer | N = int(input('number->'))
a = N % 10
if a == 2 or 4 or 5 or 7 or 9:
print('hon')
elif a == 0 or 1 or 6 or 8:
print('pon')
else:
print('bon')
|
p03109 | s751867882 | Accepted | S = list(input().split("/"))
if int(S[0]) > 2019:
print("TBD")
else:
if int(S[1]) > 4:
print("TBD")
else:
print("Heisei") |
p03456 | s790025909 | Accepted | c=int(input().replace(" ",""))
print("Yes" if c==int(c**.5)**2 else "No") |
p02843 | s549490555 | Accepted | import math
import collections
import fractions
import itertools
import functools
import operator
def solve():
x = int(input())
dp = [0 for _ in range(x+106)]
dp[0] = 1
for i in range(x):
if dp[i] == 1:
for j in range(100, 106):
dp[i+j] = 1
print(dp[x])
retur... |
p02584 | s170558217 | Accepted | x,k,d=map(int, input().split())
x=abs(x)
if x/k >= d:
print(x-d*k)
elif (k-int(x/d))%2==0:
print(abs(x-int(x/d)*d))
else:
print(abs(x-int(x/d)*d-d))
|
p02970 | s795019056 | Accepted | n,d = map(int,input().split())
if n%(d*2+1) == 0:
print(int(n/(d*2+1)))
else:
print(int(n//(d*2+1))+1) |
p02813 | s531716789 | Accepted | import math
N=int(input())
NP=list(range(N+1)[1:])
NQ=list(range(N+1)[1:])
P=list(map(int,input().split()))
Q=list(map(int,input().split()))
a=0
b=0
for n in range(N):
a+=(math.factorial(N-n-1))*NP.index(P[n])
b+=(math.factorial(N-n-1))*NQ.index(Q[n])
NP.pop(NP.index(P[n]))
NQ.pop(NQ.index(Q[n]))
pr... |
p03854 | s794885033 | Accepted | S = input()
S = S.replace("eraser","")
S = S.replace("erase","")
S = S.replace("dreamer","")
S = S.replace("dream","")
if len(S) == 0:
print("YES")
else:
print("NO")
|
p02970 | s149048885 | Accepted | from math import ceil
N, D = map(int, input().split())
print(ceil(N / (D * 2 + 1))) |
p02790 | s429285346 | Accepted | import sys
def get_ints(): return map(int, sys.stdin.readline().strip().split())
def get_array(): return list(map(int, sys.stdin.readline().strip().split()))
a,b = get_ints()
A = str(b)*a
B = str(a)*b
print(min(A,B)) |
p03862 | s158957071 | Wrong Answer | N,x=map(int,input().split())
A=[int(x) for x in input().split()]
ans=0
for i in range(1,N):
if A[i-1]+A[i]>x:
ans +=A[i-1]+A[i]-x
A[i] -=A[i-1]+A[i]-x
print(ans) |
p04011 | s950828117 | Wrong Answer |
n = int(input())
k = int(input())
x = int(input())
y = int(input())
sum = 0
for i in range( n ):
if i ==0 :
sum += x
else :
sum += y
print(sum) |
p02996 | s074235693 | Wrong Answer | n = int(input())
works = list()
for num in range(n):
a = list(map(int, input().split()))
works.append(a)
works.sort(key = lambda x :x[1])
time = 0
counter = 0
for row in works:
time += row[0]
counter += 1
if time >= row[1]:
print("No")
break
if counter == len(works):
print("Yes... |
p02795 | s027344798 | Wrong Answer | H = int(input())
W = int(input())
N = int(input())
L = max(H,W)
print((N / L) if N % L == 0 else N // L + 1 ) |
p02854 | s840523720 | Accepted | N = int(input())
A = list(map(int, input().split()))
sumA = sum(A)
half = sumA / 2
r = 0.0
t1 = 0.0
t2 = 0.0
for a in A:
t2 = t1
t1 += a
if t1 >= half:
r = min(abs(half - t1), abs(half - t2))
break
print(int(r * 2)) |
p02933 | s658316907 | Accepted | a=int(input())
s=input()
if a<3200:
print("red")
else:
print(s) |
p03637 | s389022590 | Accepted | n = int(input())
aaa = list(map(int, input().split()))
odd = 0
even = 0
even4 = 0
for a in aaa:
if a % 4 == 0:
even4 += 1
elif a % 2 == 0:
even += 1
else:
odd += 1
if odd == 0:
print('Yes')
else:
if even4 == 0:
print('No')
else:
if even == 0:
p... |
p03795 | s229755287 | Accepted | N = int(input())
print(800*N - 200*(N//15)) |
p03860 | s803556160 | Wrong Answer | print('A'+str(input())[9]+'C') |
p03162 | s625543427 | Accepted | # import sys
# sys.setrecursionlimit(10**5)
# from collections import defaultdict
geta = lambda fn: list(map(fn, input().split()))
gete = lambda fn: fn(input())
def main():
N = gete(int)
cur = [0]*3
for _ in range(N):
a = geta(int)
cur = [max(cur[j-1], cur[j-2]) + a[j] for j in range(3)]
... |
p02881 | s211595569 | Accepted | import math
import numpy as np
N = int(input())
root_N = int(math.floor(math.sqrt(N))+1)
res = []
for a in range(1, root_N):
if (N/a).is_integer():
res.append(a + N/a - 2)
res = np.array(res)
print(int(res.min())) |
p03705 | s988392299 | Wrong Answer | n, a, b = map(int, input().split())
if a > b:
print(0)
elif a != b and n == 1:
print(0)
elif a == b and n != 1:
print(0)
else:
print((b * (n-1) + a) - (a * (n-1) + b) + 1) |
p02689 | s476750508 | Accepted | n,k= map(int,input().split())
h=list(map(int,input().split()))
x=[0]*n
for i in range(k):
a,b = map(int, input().split())
if h[a-1]>=h[b-1]:
x[b-1] +=1
if h[b-1]>=h[a-1]:
x[a-1] +=1
print(x.count(0)) |
p02612 | s520284270 | Accepted | n=int(input())
while(n>0): n-=1000
print(abs(n)) |
p03639 | s056082182 | Accepted | N = int(input())
d = {0:0,1:0,2:0}
for a in list(map(int,input().split())):
if a%2 == 0 :
if a%4 == 0 :
d[2]+=1
else:
d[1]+=1
else:
d[0]+=1
## 0と4だけの時はこれでok
if d[1] == 0:
if d[0] <= d[2]+1:
print("Yes")
else:
print("No")
else:
if d[0] + (1 if d[1]>0 else 0 ) <= d[2]+1:
pri... |
p03041 | s462749030 | Accepted | n, k = list(map(int, input().split()))
s = input()
ans = s[:k-1] + s[k-1].swapcase() + s[k:]
print(ans) |
p02731 | s728645741 | Wrong Answer | l = int(input())
ans = 0
for h in range(1,l-1):
for w in range(1,l-h):
ans = max(ans, h*w*(l-h-w))
print(ans) |
p03219 | s154185012 | Wrong Answer | a, b = map(int, input().split())
print(a+(b/2)) |
p02596 | s960308937 | Wrong Answer | def main():
k = input()
K = int(k)
if K % 2 == 0:
print('-1')
for i in range(1, 10 ** 3 * len(k) + 1):
target = int('1' * i) * 7
if target % K == 0:
print(i)
break
else:
print(K - 1)
if __name__ == '__main__':
main() |
p02924 | s717533712 | Accepted | N=int(input())-1
print(N*(N+1)//2) |
p03803 | s700850525 | Accepted | a, b = map(int, input().split())
if a == b:
print("Draw")
elif (a > b and b != 1) or a == 1:
print("Alice")
else:
print("Bob")
|
p03416 | s793287384 | Accepted | A, B = map(int, input().split())
ans = 0
for i in range(1, 9 + 1):
for j in range(10):
for k in range(10):
i, j, k = str(i), str(j), str(k)
kaibun = int(i+j+k+j+i)
if A <= kaibun and kaibun <= B:
ans += 1
print(ans) |
p02744 | s368567477 | Accepted | n=int(input())
L=["a"]
for i in range(n-1):
tmp=[]
for j in range(len(L)):
for k in range(len(set(L[j]))+1):
tmp.append(L[j]+chr(ord("a")+k))
L=tmp
for j in range(len(L)):
print(L[j]) |
p03545 | s991892623 | Accepted | S=input()
l=len(S)
for i in range(1<<(l-1)):
Q=[]
ans=int(S[0])
for j in range(l-1):
if (i>>j)&1:
Q.append('+')
else:
Q.append('-')
for k in range(l-1):
if Q[k]=='+':
ans+=int(S[k+1])
else:
ans-=int(S[k+1])
if ans==7:
ret=str(S[0])
for k in range(l-1):
re... |
p03695 | s764448758 | Wrong Answer | N = int(input())
A = list(map(int, input().split()))
B = [0,0,0,0,0,0,0,0,0]
mi = 0
for i in range(len(A)):
for t in range(len(B)-1):
if A[i] < (400 * (t+1)) and A[i] > (400 * t):
B[t] = B[t]+1
if A[i] > 3199:
B[-1] = B[-1] + 1
for t in range(len(B)-1):
if B[t] > 0:
mi = ... |
p03719 | s561683517 | Accepted | a, b, c = map(int, input().split())
if (c>=a)and(c<=b):
print('Yes')
else:
print('No') |
p03457 | s868212586 | Wrong Answer | n = int(input())
for i in range(n):
t,x,y = map(int,input().split())
if (x+y) > t or (x+y)%2==t%2:
print("No")
exit()
print("Yes") |
p03612 | s787859321 | Accepted | n,*a=map(int,open(0).read().split())
ans=0
for i in range(n):
if i+1==a[i] and i!=n-1:
a[i],a[i+1]=a[i+1],a[i]
ans+=1
if i+1==a[i] and i==n-1:
ans+=1
print(ans) |
p02660 | s162795813 | Accepted | from collections import defaultdict
D = defaultdict(int)
N = int(input())
a = 2
while a * a <= N:
if N % a:
a += 1
else:
N //= a
D[a] += 1
if N != 1:
D[N] += 1
ans = 0
for k,v in D.items():
i = 0
while i*(i+1) <= v * 2:
i += 1
ans += i-1
print(ans) |
p03146 | s050149569 | Wrong Answer | def resolve():
s = int(input())
ans = [s]
count = 0
while True:
if ans[count]%2 == 0:
ans.append(ans[count]/2)
else:
ans.append(ans[count]*3+1)
if ans[count] == 4:
print(count+4)
exit()
else:
count += 1
resolve()
|
p03073 | s956596054 | Accepted | S=input()
total1=0
total2=0
for i in range(len(S)):
if i%2==0:
if S[i]=="1":
total1+=1
elif i%2==1:
if S[i]=="0":
total1+=1
for i in range(len(S)):
if i%2==0:
if S[i]=="0":
total2+=1
elif i%2==1:
if S[i]=="1":
total2+=1
prin... |
p02786 | s152641493 | Accepted | import math
n=int(input())
j=math.floor(math.log(n,2))
a=0
for i in range(0,j+1):
a=a+pow(2,i)
print(a) |
p03910 | s119461722 | Wrong Answer | n = int(input())
cnt = 0
for i in range(1, n+1):
if i * (i+1) // 2 >= n:
cnt = i
break
for i in range(cnt, 0, -1):
if i <= n:
print(i)
n -= 1 |
p02744 | s561603629 | Accepted | n = int(input())
A = 'a'
S = 'abcdefghij'
for _ in range(n-1):
A = [ a + s for a in A for s in S[:len(set(a)) + 1]]
print('\n'.join(A)) |
p03494 | s117911192 | Wrong Answer | import math
N=int(input())
a = input().split()
a_num= [int(s) for s in a]
count=0
while True:
for i in range(len(a_num)):
print(a_num[i],a_num[i]%2,math.floor(a_num[i]/2))
a_num[i]=math.floor(a_num[i]/2)
print("========")
count +=1
if a_num[i]%2 != 0:
print ("it's ... |
p02917 | s747317057 | Accepted | def main():
n = int(input())
num_list = list(map(int, input().split()))
ls = [num_list[0]]
for i in range(n-1):
if i != n - 2 and num_list[i+1] < num_list[i]:
ls.append(num_list[i+1])
else:
ls.append(num_list[i])
print(sum(ls))
if __name__ == '__main__... |
p03625 | s524173821 | Accepted | n=int(input())
a=list(map(int,input().split()))
list=[]
count=0
ans=1
a.sort(reverse=True)
for i in range(1,len(a)):
if a[i]==a[i-1]:
ans*=a[i]
a[i]=0
count+=1
if count==2:
break
else:
ans=0
print(ans) |
p02714 | s906395304 | Wrong Answer | N=int(input())
S=list(input())
print(S)
a=0
for i in range(0,N-2):
for j in range(i+1,N-1):
for k in range(j+1,N):
if S[i]!=S[j] and S[j]!=S[k] and S[k]!=S[i] and j-i!=k-j:
a+=1
else:
pass
print(a) |
p03289 | s147874180 | Wrong Answer | s = input()
if s[0]=="A" and s[2:-1].count("C")==1 and s[-1]!="C":
print("AC")
else:
print("WA") |
p03730 | s598201098 | Accepted | a, b, c = map(int, input().split())
res = False
for i in range(a, a * b + 1, a):
if i % b == c:
res = True
print("YES" if res == True else "NO")
|
p03073 | s702870733 | Wrong Answer | S = input()
checker = '0'
ans = 0
for i in range(len(S)):
if checker != S[i]:
ans+=1
if i%2==0:
checker = '0'
else:
checker = '1'
tmp = ans
ans = 0
checker = '1'
for i in range(len(S)):
if checker != S[i]:
ans+=1
if i%2==0:
checker = '1'
else:
checker = '0'
print(min(ans,tmp)) |
p02820 | s202715798 | Accepted | N, K = map(int,input().split())
R,S,P = map(int,input().split())
T = input()
V = {'r':P, 's':R, 'p':S}
ans = 0
for i in range(K):
check = T[i]
ans += V[check]
while True:
i += K
if i >= N:
break
if check == T[i]:
check = '-1'
else:
ans ... |
p03679 | s868055195 | Accepted | x, a, b = map(int, input().split())
if 0 < b <= a:
print('delicious')
elif a < b <= a+x:
print('safe')
elif a+x < b:
print('dangerous')
|
p03944 | s122548523 | Accepted | w,h,n=map(int,input().split())
x0 = y0 = 0
for i in range(n):
x,y,a=map(int,input().split())
if a==1:
x0=max(x0,x)
elif a==2:
w=min(w,x)
elif a==3:
y0=max(y0,y)
elif a==4:
h=min(h,y)
print(max(w-x0,0)*max(h-y0,0)) |
p03416 | s804017700 | Accepted | a, b = map(int, input().split())
ans = 0
for i in range(a, b + 1):
i_s = str(i)
if i_s[-1] == i_s[0] and i_s[-2] == i_s[1]:
ans += 1
print(ans)
|
p03705 | s546196437 | Accepted | n,a,b = map(int, input().split())
if (n == 1 and a != b) or (a>b):
Ans = 0
else:
Ans = (b - a) * (n - 2) + 1
print(Ans) |
p03434 | s765291201 | Accepted | # -*- coding: utf-8 -*-
"""
Created on Thu Mar 26 18:51:52 2020
@author: 藤原聖士
"""
N = int(input())
a = list(map(int,input().split()))
list.sort(a,reverse=True)
fugou=1
count=0
for i in range(N):
count+=a[i]*fugou
fugou*=-1
print (count) |
p03127 | s312948835 | Wrong Answer | n = int(input())
a = list(map(int, input().split()))
min_mod = min(a)
flag = True
for i in range(n):
if a[i] % min_mod != 0:
flag = False
break
if flag:
print(min_mod)
else:
print(1) |
p03042 | s994623244 | Accepted | s = list(input())
a = int(s[0]+s[1])
b = int(s[2]+s[3])
if 1<=a<=12 and 1<=b<=12:
print('AMBIGUOUS')
elif (a>12 or a==0) and 1<=b<=12:
print('YYMM')
elif (b>12 or b==0) and 1<=a<=12:
print('MMYY')
elif (a>12 or a==0) and (b>12 or b==0):
print('NA') |
p02726 | s728998235 | Accepted | import sys
input = sys.stdin.readline
N, X, Y = list(map(int, input().split()))
def f(i, j, X, Y):
return min(j-i, abs(j - Y) + 1 + abs(i-X))
cnts = [0] * N
for i in range(1, N+1):
for j in range(i+1, N+1):
k = f(i, j, X, Y)
cnts[k] += 1
for k in range(1, N):
print(cnts[k]) |
p03821 | s151223782 | Accepted | n = int(input())
ab = [map(int, input().split()) for _ in range(n)]
a, b = [list(i) for i in zip(*ab)]
a.reverse()
b.reverse()
ans = 0
for j in range(n):
a[j] += ans
if a[j] % b[j] != 0:
ans += b[j] -(a[j] % b[j])
print(ans) |
p03469 | s254173256 | Accepted | s = input()
print('2018'+s[4:]) |
p02726 | s612052183 | Accepted | N,X,Y = map(int, input().split())
ans = [0]*N
X -= 1
Y -= 1
for i in range(N-1):
for j in range(i+1,N):
_ = min(j-i, abs(X-i)+1+abs(Y-j))
ans[_] += 1
for _ in range(1,N):print(ans[_]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.