problem_id
stringclasses 428
values | submission_id
stringlengths 10
10
| status
stringclasses 2
values | code
stringlengths 5
816
|
|---|---|---|---|
p02818
|
s591793339
|
Wrong Answer
|
a,b,k=map(int,input().split())
if a>k:
print(a-k,b)
elif a-k<0 and b-k+a>0:
print('0',b-k+a)
elif a-k<0 and b-k+a<0:
print('0','0')
|
p03210
|
s572573967
|
Accepted
|
y = int(input())
if y == 3 or y == 5 or y == 7:
print('YES')
else:
print('NO')
|
p03067
|
s185966526
|
Accepted
|
A, B, C = map(int,input().split())
print('Yes' if A<C<B or B<C<A else 'No')
|
p02842
|
s715879813
|
Accepted
|
n = int(input())
x = int(n / 1.08 - 2)
for i in range(x, x + 4):
if int(i * 108 // 100) == n:
print(i)
break
else:
print(":(")
|
p03327
|
s709055202
|
Accepted
|
n = int(input())
print("ABC" if n<=999 else "ABD")
|
p02948
|
s559360104
|
Accepted
|
import heapq
N, M = list(map(int,input().split()))
A = []
for i in range(N):
in1, in2 = list(map(int,input().split()))
A.append([in1, in2])
A = sorted(A)
ans = 0
day = 1
cnt = 0
x = []
for i in range(M):
while(cnt < N):
if A[cnt][0] == day:
heapq.heappush(x, -A[cnt][1])
cnt += 1
else:
break
if x: ans -= heapq.heappop(x)
day += 1
print(ans)
|
p03625
|
s753011542
|
Accepted
|
from collections import defaultdict
N=int(input())
alist=list(map(int,input().split()))
adic=defaultdict(int)
for a in alist:
adic[a]+=1
alist2=list(adic.items())
alist2.sort(reverse=True)
#print(alist2)
x1,x2=0,0
for a2 in alist2:
if a2[1]>=4:
x1=max(x1,a2[0])
x2=max(x2,a2[0])
elif a2[1]>=2:
if x1==0:
x1=a2[0]
else:
x2=a2[0]
if x1*x2>0:
print(x1*x2)
break
else:
print(0)
|
p03012
|
s829546581
|
Accepted
|
import sys
def input(): return sys.stdin.readline().strip()
def main():
N = int(input())
W = list(map(int, input().split()))
s1 = W[0]
s2 = sum(W) - s1
ans = abs(s2 - s1)
for t in range(1, N):
s1 += W[t]
s2 -= W[t]
ans = min(ans, abs(s1 - s2))
print(ans)
if __name__ == "__main__":
main()
|
p02939
|
s215302117
|
Wrong Answer
|
s = input()
tmp = s[0]
ans = 1
i = 1
while i < len(s):
if tmp != s[i]:
ans += 1
tmp = s[i]
i += 1
elif i+2 < len(s):
ans += 1
tmp = s[i:i+2]
i += 2
else:
break
print(ans)
|
p02801
|
s297310595
|
Accepted
|
l=input()
x='abcdefghijklmnopqrstuvwxyz'
for k in range(len(x)):
if x[k]==l:
print(x[k+1])
|
p02802
|
s027577429
|
Wrong Answer
|
n, m = map(int, input().split())
P, S = [], []
for _ in range(m):
p, s = input().split()
P.append(int(p))
S.append(s)
ac = {}
wa = {}
for p, s in zip(P, S):
if s == 'AC':
ac.setdefault(p, 1)
else:
wa.setdefault(p, 0)
if wa[p] == 0:
wa[p] += 1
n_ac = 0
n_wa = 0
for i in ac.values():
n_ac += i
for i in wa.values():
n_wa += i
print(n_ac,n_wa)
|
p03779
|
s430915842
|
Accepted
|
import math
x = int(input())
cnt = 0
while x > 0:
cnt += 1
x -= cnt
print(cnt)
|
p03161
|
s201928457
|
Accepted
|
import numpy as np
N,k=map(int,input().split())
h = np.array(list(map(int,input().split())))
dp = np.zeros(N, dtype=int)
for i in range(1,N):
start = max(i-k,0)
dp[i] = np.min(dp[start:i] + np.abs(h[i] - h[start:i]))
print(dp[-1])
|
p03103
|
s744427507
|
Accepted
|
n,m=map(int,input().split())
lis=[]
for i in range(n):
lis.append(list(map(int,input().split())))
lis.sort()
counter=0
count=0
money=0
while count<m:
kazu=min(m-count,lis[counter][1])
money+=kazu*lis[counter][0]
count+=kazu
counter+=1
print(money)
|
p03803
|
s924689856
|
Accepted
|
a,b=map(int,input().split())
i=list(range(2,14))
i.append(1)
ai,bi=i.index(a),i.index(b)
print("Draw" if ai==bi else "Alice" if ai>bi else "Bob")
|
p03062
|
s591681465
|
Accepted
|
n=int(input())
a=[int(i) for i in input().split()]
a.sort()
j=n
for i in range(n):
if a[i]>=0:
j=i
break
a=list(map(abs,a))
a.sort()
if j%2==0:
print(sum(a))
else:
print(sum(a)-2*a[0])
|
p03011
|
s356791766
|
Wrong Answer
|
sum(sorted(list(map(int, input().split())))[:2])
|
p03852
|
s648416903
|
Wrong Answer
|
c=input()
if c==("a" or "i" or "u" or "e" or "o"):
print("vowel")
else:
print("consonant")
|
p03351
|
s401377938
|
Accepted
|
a, b, c, d = map(int, input().split())
if abs(c-a) <= d:
print('Yes')
elif abs(a-b) <= d and abs(c-b) <= d:
print('Yes')
else:
print('No')
|
p02547
|
s881379057
|
Wrong Answer
|
N = int(input())
ans = 0
stock = 0
for i in range(N):
a,b = map(int, input().split())
if a == b:
ans += 1
print('Yes' if (ans > 2) else "No")
|
p02598
|
s002527610
|
Accepted
|
import math
N, K = (int(a) for a in input().split())
A = [int(a) for a in input().split()]
def isOK(X):
cutcount = 0
for i in range(N):
cutcount += math.ceil(A[i] / X) - 1
if cutcount <= K:
return True
else:
return False
def binary_search():
left = 0
right = max(A) + 1
while (right - left) > 1:
mid = left + (right - left) // 2
if (isOK(mid)):
right = mid;
else:
left = mid;
return right
print(binary_search())
|
p03721
|
s820650266
|
Wrong Answer
|
N,K = map(int, input().split())
S = 0
for _ in range(N):
a,b = map(int, input().split())
S += b
if S >= K :
print(a)
break
|
p03854
|
s201007494
|
Wrong Answer
|
S = input()[::-1]
string = list(map(
lambda x: x[::-1],
[
"dream",
"dreamer",
"erase",
"eraser"
]))
index = 0
while 1:
for x in string:
match = S.find(x, index)
if match == -1:
continue
elif match > -1:
index += match + len(x)
if index == len(S):
print("YES")
exit()
|
p04031
|
s744165691
|
Accepted
|
from math import ceil, floor
n = int(input())
ls = list(map(int, input().split()))
sqsm = 0
for i in range(n):
sqsm += ls[i] * ls[i]
sm = sum(ls)
x1 = floor(sm / n)
x2 = ceil(sm / n)
print(min(sqsm + n * x1 * x1 - 2 * sm * x1, sqsm + n * x2 * x2 - 2 * sm * x2))
|
p02818
|
s253824819
|
Accepted
|
a, b, k = map(int, input().split())
n_takahashi = a
n_aoki = b
cookies_to_eat = k
if n_takahashi > cookies_to_eat:
n_takahashi = n_takahashi - cookies_to_eat
cookies_to_eat = 0
else:
cookies_to_eat = cookies_to_eat - n_takahashi
n_takahashi = 0
if n_aoki > cookies_to_eat:
n_aoki = n_aoki - cookies_to_eat
cookies_to_eat = 0
else:
cookies_to_eat = cookies_to_eat - n_aoki
n_aoki = 0
print('{} {}'.format(n_takahashi, n_aoki))
|
p03773
|
s622883328
|
Accepted
|
a,b = map(int,input().split())
print((a+b)%24)
|
p02899
|
s558299323
|
Accepted
|
n = int(input())
A = list(map(int,input().split()))
S=[0]*n
for i in range(len(A)):
S[A[i]-1] = i+1
for s in S:
print(s,end=" ")
|
p03485
|
s976227152
|
Wrong Answer
|
a,b=map(int,input().split())
n=(a+b*(1/10))
print(n)
|
p02917
|
s478669695
|
Wrong Answer
|
input()
bs = input()
b_list = [int(n) for n in bs.strip().split()]
print(sum(b_list) + b_list[0])
|
p02546
|
s359085781
|
Accepted
|
w = input()
if w[-1] != 's':
w += 's'
else:
w += 'es'
print(w)
|
p02795
|
s047022413
|
Wrong Answer
|
H = int(input())
W = int(input())
N = int(input())
ans = 0
num_bk = 0
for i in range(0,min(H,W)):
num_bk += max(H,W)
ans +=1
if num_bk>N:
print(ans)
break
|
p03126
|
s756207544
|
Accepted
|
from collections import defaultdict
N, M = map(int, input().split())
d = defaultdict(int)
for _ in range(N):
for a in list(map(int, input().split()))[1:]:
d[a] += 1
ans = 0
for _, v in d.items():
if v == N:
ans += 1
print(ans)
|
p03075
|
s932298748
|
Wrong Answer
|
a = [int(input()) for _ in range(5)]
k = int(input())
for i in range(4):
if a[i+1] - a[i] > k:
print(":(")
exit()
print("Yay!")
|
p02711
|
s335526661
|
Accepted
|
if input().count('7')>0:
print('Yes')
else:
print('No')
|
p02682
|
s912811260
|
Accepted
|
a,b,c,k=map(int,input().split())
if k<=a:
print(k)
elif k<=b:
print(a)
else:
print(2*a-k+b)
|
p03795
|
s288574155
|
Accepted
|
N = int(input())
x = N * 800
y = (N // 15) * 200
print(x-y)
|
p02842
|
s069456220
|
Accepted
|
import math
n = int(input())
ans = math.ceil(n/1.08)
if math.floor(ans*1.08) == n:
print(ans)
else:
print(":(")
|
p03289
|
s485879372
|
Accepted
|
s=input()
ans=0
count=0
t=""
if s[0]=="A":
ans+=1
for i in range(2,len(s)-1):
# print(s[i])
if s[i]=="C":
count+=1
t=s[1:i]+s[i+1:]
# print(t)
if t.islower()==True and ans==1 and count==1:
print("AC")
else:
print("WA")
|
p02548
|
s084321230
|
Wrong Answer
|
N = int(input())
cnt = 0
for a in range(1,N+1):
cnt = cnt + int(N/a-0.00000000001)
print(cnt)
|
p03035
|
s201747841
|
Accepted
|
A, B = map(int, input().split())
if A >= 13:
print(B)
elif A >= 6:
print(int(B/2))
else:
print(0)
|
p02838
|
s603674276
|
Wrong Answer
|
##ใใฃใใใๅฎ่ฃ
import numpy as np
#mod = 10**9+7
#n = int(input())
#a = np.fromstring(input(), dtype = np.int64, sep = ' ')
#
#result = 0
#for i in range(60):
# count_one = int((a&1).sum())
# result += count_one*(n-count_one)*(2**i)
# a >>= 1
#print(result%mod)
N = int(input())
A = np.fromstring(input(),dtype = np.int64, sep = ' ')
Large = 10**9 + 7
ans = 0
for i in range(60):
sum1 = np.sum(A&1)
ans += sum1*(N-sum1) * pow(2,i,Large)
A>>=1 # A = A>>1ใจใใ
print(ans)
|
p03487
|
s183097872
|
Accepted
|
from collections import Counter
def main():
n = int(input())
a = tuple(map(int, input().split()))
ac = Counter(a)
r = 0
for ace in ac:
if ac[ace] < ace:
r += ac[ace]
else:
r += (ac[ace] - ace)
print(r)
if __name__ == '__main__':
main()
|
p02659
|
s426579001
|
Accepted
|
from decimal import Decimal as d,ROUND_FLOOR as r
a,b=map(d,input().split())
print((a*b).quantize(d('0'),rounding=r))
|
p03210
|
s189500277
|
Wrong Answer
|
N = int(input())
if N == 3 or 5 or 7:
print('Yes')
else:
print('No')
|
p03835
|
s555926075
|
Accepted
|
k, s = map(int, input().split())
ans = 0
for x in range(k + 1):
for y in range(k + 1):
if 0 <= s - x - y <= k:
ans += 1
print(ans)
|
p03998
|
s766435864
|
Accepted
|
card = {}
card['a'] = list(input())
card['b'] = list(input())
card['c'] = list(input())
p = 'a'
while True:
p = card[p].pop(0)
if len(card[p]) == 0:
break
print(p.upper())
|
p03385
|
s268098051
|
Accepted
|
s = input()
s = ''.join(sorted(s))
if s == 'abc':
print('Yes')
else:
print('No')
|
p02753
|
s700316995
|
Wrong Answer
|
x = set(input().split())
print('No' if len(x)==1 else 'Yes')
|
p02873
|
s196288612
|
Accepted
|
s = input()
ans = 0
cnt = 0
tmp = 0
pre = '>'
last = '>' if s[-1]=='<' else '<'
for now in s+last:
if pre==now:
cnt += 1
else:
if now=='<':
ans += max(cnt, tmp)
tmp = 0
else:
tmp = cnt
ans += cnt*(cnt-1)//2
cnt = 1
pre = now
ans += tmp
print(ans)
|
p02661
|
s458260712
|
Accepted
|
N = int(input())
AB = [list(map(int,input().split())) for _ in range(N)]
A = [i[0] for i in AB]
B = [i[1] for i in AB]
from statistics import median
a_med = median(A)
b_med = median(B)
if N%2==1:
print(b_med - a_med + 1)
else:
print(int((b_med - a_med) * 2) + 1)
|
p03126
|
s820418794
|
Accepted
|
n, m = map(int, input().split())
foods = [0] * (m + 1)
for i in range(n):
k, *a = map(int, input().split())
for j in a:
foods[j] += 1
print(foods.count(n))
|
p03774
|
s541333745
|
Accepted
|
N,M = map(int,input().split())
point = []
target = []
ans = []
for i in range(N):
person = list(map(int,input().split()))
point.append(person)
for j in range(M):
goal = list(map(int,input().split()))
target.append(goal)
for k in point:
check = []
for l in target:
a = 0
a += abs(k[0]-l[0])+abs(k[1]-l[1])
check.append(a)
b = min(check)
ans.append(check.index(b))
for m in ans:
print(m+1)
|
p02713
|
s181284788
|
Accepted
|
K=int(input())
s=0
import math
# ๅ
จ้จๅใใใฟใผใณ
for i in range(1, K+1):
# print("{} {} {}".format(i,i,i))
s += i
# 2ใคๅใใใฟใผใณ
for i in range(1, K+1):
for j in range(1,K+1):
if i==j:
continue
# print("{} {} {}".format(i,i,j))
s += math.gcd(i,j)*3
from itertools import combinations
# ๅ
จ้จ้ใใใฟใผใณ
for i in combinations(range(1,K+1), 3):
# print("{} {} {}".format(i[0], i[1], i[2]))
s += math.gcd(math.gcd(i[0], i[1]),i[2])*3*2
print(s)
|
p02918
|
s447546114
|
Wrong Answer
|
n,s=open(0);n,k=map(int,n.split());print(n-max(sum(i==j for i,j in zip(s,s[1:]))-2*k,1))
|
p04033
|
s533546305
|
Accepted
|
def main():
a, b = map(int, input().split())
if a <= 0 <= b:
print('Zero')
elif b < 0:
print('Positive' if (b - a + 1) % 2 == 0 else 'Negative')
else:
print('Positive')
if __name__ == '__main__':
main()
|
p03219
|
s939863676
|
Wrong Answer
|
X,Y=map(int,input().split())
print(X+Y/2)
|
p03211
|
s935718927
|
Accepted
|
def resolve():
S = list(input())
mindiff = float("inf")
for i in range(len(S)-2):
val = int(S[i]+S[i+1]+S[i+2])
mindiff = min(mindiff, abs(753-val))
print(mindiff)
if '__main__' == __name__:
resolve()
|
p02701
|
s754932216
|
Accepted
|
n=(int)(input())
l=[]
for i in range(n):
ar=input()
l.append(ar)
print(len(set(l)))
|
p02743
|
s624385173
|
Accepted
|
import math
A, B, C = map(int, input().split(' '))
if C - A - B >= 0 and 4 * A*B < (C - A - B) ** 2:
print('Yes')
else:
print('No')
|
p03637
|
s459669057
|
Accepted
|
N=int(input())
a=list(map(int,input().split()))
for i in range(N):
if a[i]%4==0:
a[i]=2
elif a[i]%2==0:
a[i]=1
else:
a[i]=0
zero=a.count(0)
one=a.count(1)
two=a.count(2)
if zero>two+1:
print("No")
elif zero==two+1:
if zero+two==N:
print("Yes")
else:
print("No")
else:
print("Yes")
|
p02744
|
s846770382
|
Accepted
|
import math
import collections
import fractions
import itertools
import functools
import operator
import bisect
def solve():
n = int(input())
sushi = ["a"]
alt = [chr(ord("a") + i) for i in range(n)]
for i in range(n-1):
sushi = [ans + x for ans in sushi for x in alt[:len(set(ans)) + 1]]
for i in sushi:
print(i)
return 0
if __name__ == "__main__":
solve()
|
p03487
|
s120409433
|
Accepted
|
n = int(input())
a = sorted(list(map(int,input().split())))
def runlength(S):
ans = []
for s in S:
if len(ans) == 0 or ans[-1][0] != s:
ans.append([s,1])
else:
ans[-1][1] += 1
return ans
a = runlength(a)
ans = 0
for i in range(len(a)):
if a[i][0] < a[i][1]:
ans += a[i][1]-a[i][0]
elif a[i][0] > a[i][1]:
ans += a[i][1]
print(ans)
|
p03495
|
s436331345
|
Accepted
|
n, k = map(int, input().split())
A = tuple(map(int, input().split()))
d = dict()
for a in A:
d.setdefault(a, 0)
d[a] += 1
cs = sorted(list(d.values()))
if len(cs) <= k:
print(0)
else:
c = 0
print(sum(cs[:-k]))
|
p02583
|
s325510043
|
Accepted
|
N = int(input())
L = list(map(int, input().split()))
cnt = 0
for i in range(N):
for j in range(i+1, N):
for k in range(j+1, N):
if L[i] != L[j] and L[j] != L[k] and L[k] != L[i] and L[i] + L[j] > L[k] and L[i] + L[k] > L[j] and L[j] + L[k] > L[i]:
cnt += 1
print(cnt)
|
p02646
|
s780607785
|
Accepted
|
import sys
x=input()
y=input()
x0=x.split()
a=int(x0[0])
v=int(x0[1])
y0=y.split()
b=int(y0[0])
w=int(y0[1])
t=int(input())
l=abs(a-b)
r=v-w
if r<=0:
print("NO")
sys.exit()
if l/r<=t:
print("YES")
else:
print("NO")
|
p02555
|
s050486954
|
Accepted
|
S=int(input())
DP=[0 for i in range(S+1)]
DP[0]=1
for i in range(S+1):
for j in range(3,S+1):
if i+j<=S:
DP[i+j]+=DP[i]
DP[i+j]%=(10**9+7)
print(DP[-1])
|
p03860
|
s618658611
|
Wrong Answer
|
print("A" + input()[0] + "C")
|
p03239
|
s170396655
|
Accepted
|
n = list(map(int, input().split()))
x = [list(map(int, input().split())) for i in range(n[0])]
ans = []
for i in x:
if n[1] >= i[1]:
ans.append(i[0])
if ans == []:
print('TLE')
else:
print(sorted(ans)[0])
|
p02713
|
s102155307
|
Accepted
|
K = int(input())
def gcd(a, b):
while b:
a, b = b, a % b
return a
ans = 0
for i in range(1, K+1):
for j in range(1, K+1):
for k in range(1, K+1):
ans += gcd(gcd(i, j), k)
print(ans)
|
p03548
|
s886505790
|
Accepted
|
x, y, z = map(int, input().split())
ans = (x-z)//(y+z)
print(ans)
|
p02675
|
s470587538
|
Wrong Answer
|
n=str(input())
a=n[-1]
print(a)
if a=='2' or n=='4' or a=='5' or a=='7' or a=='9':
print('hon')
elif a=='3':
print('bon')
else:
print('pon')
|
p02742
|
s504061603
|
Wrong Answer
|
(n, m) = map(int, raw_input().split())
res = 0
res += ((n + 1) / 2) * ((m + 1) / 2)
res += (n / 2) * (m / 2)
print res
|
p02629
|
s198690058
|
Wrong Answer
|
N = int(input())
tmp_n = N
ans = []
while True:
s, r = divmod(tmp_n, 26)
if r == 0:
r = 26
ans.append(chr(r+96))
tmp_n = s
if s == 0:
break
print("".join(ans[::-1]))
|
p04043
|
s788979344
|
Accepted
|
a=list(map(int,input().split()))
if a.count(7)==1 and a.count(5)==2:
print("YES")
else:
print("NO")
|
p02724
|
s241213361
|
Accepted
|
x=int(input())
ans=0
ans+=(x//500)*1000
x=x-((x//500)*500)
ans+=(x//5)*5
print(ans)
|
p02594
|
s446884077
|
Wrong Answer
|
K = int(input())
n = 1000000
if K % 2 == 0:
print(-1)
else:
amari = 70
for i in range(n):
if amari % int(9 * K) == 7:
print(i + 1)
break
else:
amari = amari * 10
|
p02831
|
s412065904
|
Accepted
|
a,b = map(int,input().split())
c = max(a,b)
d = min(a,b)
for i in range(1,a*b):
e = c%d
if e != 0:
c = d
d = e
else:
break
print(a*b//d)
|
p02725
|
s425473789
|
Wrong Answer
|
k, n = list(map(int, input().split()))
an = list(map(int, input().split()))
bn = []
for i in range(n-1):
bn.append(an[i+1]-an[i])
bn.append(k-an[n-1])
print(sum(bn)-max(bn))
|
p02641
|
s954151435
|
Accepted
|
X, N = map(int, input().split())
S = list(map(int, input().split()))
ans = X
for i in range(200):
if X-i not in S:
print(X-i)
break
elif X+i not in S:
print(X+i)
break
|
p02663
|
s350124130
|
Accepted
|
H, M, h, m, K = map(int, input().split())
print( max(0, 60*(h-H) + m - M - K) )
|
p03556
|
s258661486
|
Wrong Answer
|
n=int(input())
for i in range(n):
if (i+1)**2>n:
print(i**2)
break
|
p02772
|
s870174137
|
Wrong Answer
|
# input
N = int(input())
A = list(map(int, input().split()))
# check
app_fl = True
for Ai in A:
if Ai % 2 == 0 and (Ai % 3 != 0 or Ai % 5 != 0):
app_fl = False
break
if app_fl is True:
print("APPROVED")
else:
print("DENIED")
|
p02994
|
s123271148
|
Accepted
|
N, L = list(map(int, input().split()))
T = []
for i in range (1, N+1):
T.append(L+i-1)
if T[0] * T[-1] <= 0:
print(sum(T))
else:
if min(T) < 0:
print(sum(T) - T[-1])
else:
print(sum(T) - T[0])
|
p02615
|
s018266103
|
Accepted
|
N = int(input())
A = list(map(int,input().split()))
A.sort(reverse=True)
res = 0
for i in range(N):
res += A[i//2]
print(res-A[0])
|
p02859
|
s852918169
|
Accepted
|
r = int(input())
print(r**2)
|
p04031
|
s952299381
|
Accepted
|
N=int(input())
*A,=map(int,input().split())
mx=max(A)
mn=min(A)
if len(set(A))==1:
print(0)
else:
ans=float('inf')
for i in range(mn,mx):
ans=min(ans, sum([(k-i)**2 for k in A]))
print(ans)
|
p02682
|
s640099654
|
Wrong Answer
|
a, b, c, k = map(int, input().split())
total=0
total+=a
if k - a == 0:
print(total)
elif k - a < 0:
print(total-k)
else:
k-=a
if k - b <= 0:
print(total)
else:
k-=b
print(total-k)
|
p03011
|
s184481529
|
Accepted
|
a, b, c = map(int, input().split())
print(min(a+b, b+c, c+a))
|
p02555
|
s332444988
|
Wrong Answer
|
N = int(input())
mod = 10**9+7
A = [0]*2001
A[0] = 1
for i in range(3,2000):
A[i] = A[i-1] + A[i-3]
print(A[N]%mod)
|
p02663
|
s753356047
|
Wrong Answer
|
h1, m1, h2, m2, k = map(int, input().split())
# ๆ้ใใ0ๆ0ๅใใใฎ็ต้ๆ้ใซๅคๆใใใ
start = (60 * h1) + m1
end = (60 * h2) + m2 - k
print(start-end)
|
p03494
|
s543514938
|
Wrong Answer
|
a_list = map(int, input().split())
can_devide = sum([a%2 for a in a_list])==0
count = 0
while can_devide:
count += 1
for i, a in enumerate(a_list):
a_list[i] = a//2
can_devide = sum([a%2 for a in a_list])==0
print(count)
|
p02747
|
s227208211
|
Accepted
|
from sys import stdin
import sys
def getInputs():
inputs=[]
for line in stdin:
line=line.split()
inputs.append(line)
return inputs
def main(inputs):
s=inputs[0][0]
if len(s)%2==1:
print("No")
sys.exit(0)
ok=True
for i in range(0, len(s), 2):
sub=s[i:i+2]
if sub!="hi":
ok=False
if ok:
print("Yes")
else:
print("No")
if __name__=="__main__":
inputs=getInputs()
# inputs=simInputs()
main(inputs)
|
p03639
|
s803546944
|
Accepted
|
N = int(input())
a = list(map(int, input().split()))
f = sum([1 for i in a if not i % 4])
if f >= int(N / 2):
print('Yes')
else:
s = sum([1 for i in a if not i % 2 and i % 4])
if f + s // 2 >= int(N / 2):
print('Yes')
else:
print('No')
|
p02973
|
s434690710
|
Accepted
|
import bisect
import sys
input = sys.stdin.readline
N = int(input())
A = []
for n in range(N):
A.append(int(input()))
A = A[::-1]
INF = int(1e+9 + 10)
lis = [INF]* (N+1)
lis[0] = -1
for n in range(N):
i = bisect.bisect(lis, A[n])
lis[i] = A[n]
print (bisect.bisect_left(lis, INF) - 1)
|
p02621
|
s277366701
|
Accepted
|
a = int(input())
print(a+a**2+a**3)
|
p03323
|
s899450857
|
Wrong Answer
|
d, n = map(int, input().split())
if n != 100:
print(n*100**d)
else:
print((n+1)*100**d)
|
p02706
|
s920666487
|
Accepted
|
n, m = map(int, input().split())
a = list(map(int, input().split()))
ans = max(n - sum(a), -1)
print(ans)
|
p03644
|
s108698497
|
Accepted
|
n=int(input())
for i in reversed(range(7)):
if n>=2**i:
print(2**i)
quit()
|
p03481
|
s960051070
|
Accepted
|
x, y = map(int, input().split())
cnt = 0
tmp = x
while tmp <= y:
tmp *= 2
cnt += 1
print(cnt)
|
p02959
|
s951975085
|
Accepted
|
n = int(input())
A = list(map(int, input().split()))
B = list(map(int, input().split()))
cnt = 0
beforeKill = 0
for i in range(n):
kill1 = min(A[i] - beforeKill, B[i])
kill2 = min(A[i+1], B[i] - kill1)
cnt += kill1 + kill2
beforeKill = kill2
print(cnt)
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.