s_id stringlengths 10 10 | p_id stringlengths 6 6 | u_id stringlengths 10 10 | date stringlengths 10 10 | language stringclasses 1
value | original_language stringclasses 11
values | filename_ext stringclasses 1
value | status stringclasses 1
value | cpu_time stringlengths 1 5 | memory stringlengths 1 7 | code_size stringlengths 1 6 | code stringlengths 1 539k |
|---|---|---|---|---|---|---|---|---|---|---|---|
s690821427 | p03472 | u140251125 | 1516423489 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1022 | import math
import numpy as np
from operator import mul
# 整数Nを桁ごとのリストにする
# l = [int(x) for x in list(str(N))]
# リストliから重複を削除したリストli_uniqを作成
#li_uniq = []
#for i in li:
# if x not in li_uniq:
# li_uniq.append(x)
# 複数行のinput - list版
#list = [list(map(int, input().split())) for i in range(N)]
# 複数行のinput - di... |
s299943510 | p03472 | u743272507 | 1516392201 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 368 | from math import ceil
n,h = map(int,input().split())
a = [0]*n
b = [0]*n
for i in range(n):
a[i] , b[i] = map(int,input().split())
bs = list(sorted(b,reverse=True))
ma = max(a)
ret = 0
while ret < n:
if bs[0] => ma:
h -= bs[0]
bs.pop(0)
ret += 1
if h <= 0 : break
else:
... |
s765526213 | p03472 | u000349418 | 1516340868 | Python | Python (3.4.3) | py | Runtime Error | 559 | 21096 | 519 | l0 = input().split(' ')
N = int(l0[0])
H = int(l0[1])
L = []
i=0
while i < N:
l1 = input().split(' ')
l2 = [int(l1[0]), int(l1[1])]
L.append(l2)
i += 1
L.sort(key = lambda x:x[1])
#b_iの順に並び変え
L2 = L.copy()
L2.sort()
Amax = L2[N-1][0]
p=N-1
while p >= 0:
if L[p][1] > Amax:
p -= 1
else:
... |
s255154715 | p03472 | u846251472 | 1515471331 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 11036 | 602 | import math
N, H = map(int, input().split())
a = []
b = []
for i in range(N):
tmpa, tmpb = map(int, input().split())
a.append(tmpa)
b.append(tmpb)
#print(a)
#print(b)
overa = [x for x in b if x > max(a)]
overa.sort(false=True)
#overa.reverse()
#print("overa")
#print(overa)
count = 0
if H > sum(overa):
... |
s823730337 | p03472 | u075012704 | 1515467392 | Python | Python (3.4.3) | py | Runtime Error | 362 | 11716 | 507 | import math
N, H = map(int, input().split())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
amax = max(A)
# 最強の振り刀より強い攻撃力を持つものを抽出
B = list(filter(lambda x: x > amax, B))
B.sort(reverse=True)
ans = 0
while H > 0:
# まだ投げれる
if not B == []:
H -= B.pop... |
s577468212 | p03472 | u619631862 | 1515397689 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38384 | 239 | def i2():
return [int(i) for i in input().split()]
[n,h]=i2()
a=[]
for i in range(n):
b=i2()
a+=[[b[0],0],[b[1],1]]
a.sort()
a=a[::-1]
i=0
c=0
while a[i][1]==1 and h>0:
h-=a[i][0]
c+=1
i+=1
c+=h//a[i][0]
if h%a[i][0]:c+=1
print(c) |
s426052953 | p03472 | u391331433 | 1515385852 | Python | Python (2.7.6) | py | Runtime Error | 569 | 28304 | 1676 | import sys
import heapq
import time
from math import *
def get_read_func(fileobject):
if fileobject == None :
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f);
i... |
s793554368 | p03472 | u391331433 | 1515385817 | Python | Python (2.7.6) | py | Runtime Error | 668 | 30204 | 1674 | import sys
import heapq
import time
from math import *
def get_read_func(fileobject):
if fileobject == None :
return raw_input
else:
return fileobject.readline
def main():
if len(sys.argv) > 1:
f = open(sys.argv[1])
else:
f = None
read_func = get_read_func(f);
i... |
s623395429 | p03472 | u497046426 | 1515385044 | Python | Python (3.4.3) | py | Runtime Error | 399 | 11800 | 408 | import math
N, H = map(int, input().split())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
A = A[::-1]
a_max = A[0]
B.sort()
B = B[::-1]
attack = 0
idx = 0
while B[idx] > a_max:
H -= B[idx]
attack += 1
idx += 1
if H <= 0:
pri... |
s780230784 | p03472 | u948374595 | 1515384978 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 402 | n, h = map(int, input().split())
a = []
b = []
amax = 0
for i in range(n):
ai, bi = map(int, input().split())
if amax < ai:
amax = ai
a.append(ai)
b.append(bi)
b = [b[j] for j in range(n) if b[j] > amax]
sumb = sum(b)
if sumb >= h:
s = 0
b = sorted(b)
c = 0
while s < h:
s += b[-1]
b.pop(-1)... |
s844346071 | p03472 | u704521025 | 1515384657 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 24328 | 894 | from operator import itemgetter
ip = map(int, raw_input().split())
N = ip[0]
H = ip[1]
katana = []
for i in range(0, N):
ip = map(int, raw_input().split())
katana.append(ip)
#print katana
katana.sort(key = itemgetter(0))
a = katana.pop(len(katana)-1... |
s319744889 | p03472 | u497046426 | 1515384586 | Python | Python (3.4.3) | py | Runtime Error | 407 | 11804 | 391 | N, H = map(int, input().split())
A = []
B = []
for i in range(N):
a, b = map(int, input().split())
A.append(a)
B.append(b)
A.sort()
A = A[::-1]
a_max = A[0]
B.sort()
B = B[::-1]
attack = 0
idx = 0
while B[idx] > a_max:
H -= B[idx]
attack += 1
idx += 1
if H <= 0:
print(attack)
... |
s571474570 | p03472 | u062864034 | 1515384302 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 379 | N, H = [int(i) for i in input().split()]
ken_a = 0
ken_b = []
for _ in range(N):
a,b = input().split()
if a >= H or b >= H:
print(1)
quit()
if ken_a < int(a):
ken_a = int(a)
ken_b.append(int(b))
res = 0
for b_ in ken_b:
if b_ > ken_a:
H = H - b_
res += 1
res ... |
s993925233 | p03472 | u207363774 | 1515384057 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 29284 | 399 | import math
Num,HP = (map(int,input().split()))
Katanas = [list(map(int,input().split())) for x in range(Num)]
amax = max([x[0] for x in Katanas])
bpower = sorted([x[1] for x in Katanas if x[1] > amax],reverse=True)
attake=0
while HP > 0:
attake += 1
HP -= bpower[0]
if len(bpower) == 1:
break
... |
s852447704 | p03472 | u207363774 | 1515383868 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 29284 | 399 | import math
Num,HP = (map(int,input().split()))
Katanas = [list(map(int,input().split())) for x in range(Num)]
amax = max([x[0] for x in Katanas])
bpower = sorted([x[1] for x in Katanas if x[1] > amax],reverse=True)
attake=0
while HP > 0:
attake += 1
HP -= bpower[0]
if len(bpower) == 1:
break
... |
s094421039 | p03472 | u207363774 | 1515383718 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 29284 | 353 | import math
Num,HP = (map(int,input().split()))
Katanas = [list(map(int,input().split())) for x in range(Num)]
amax = max([x[0] for x in Katanas])
bpower = sorted([x[1] for x in Katanas if x[1] > amax],reverse=True)
attake=0
while HP > 0:
attake += 1
HP -= bpower[0]
bpower = bpower[1:]
else:
attake +=... |
s100836602 | p03472 | u410996176 | 1515383701 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 550 |
N,H = map(int,input().split())
a = []
b = []
finish = 0
for i in range(1,N+1):
elem1, elem2 = map(int,input().split())
a.append(elem1)
b.append(elem2)
maxB = max(b)
maxA = max(a)
sum = maxB
b.remove(maxB)
count = 1
for elem in b:
if elem > maxA:
sum = sum + elem
#print(sum)
count... |
s936400872 | p03472 | u207363774 | 1515383667 | Python | Python (3.4.3) | py | Runtime Error | 358 | 29284 | 344 | import math
Num,HP = (map(int,input().split()))
Katanas = [list(map(int,input().split())) for x in range(Num)]
amax = max([x[0] for x in Katanas])
bpower = sorted([x[1] for x in Katanas if x[1] > amax],reverse=True)
while HP > 0:
attake += 1
HP -= bpower[0]
bpower = bpower[1:]
else:
attake += math.cei... |
s464793123 | p03472 | u280269055 | 1515383282 | Python | Python (3.4.3) | py | Runtime Error | 616 | 36080 | 780 | n,h = map(int, input().split())
katana = [list(map(int, input().split())) for _ in range(n)]
turn = 0
katana.sort()
slash = katana.pop()
throw = []
while katana:
k = katana[-1]
if k[0] == slash[0]:
throw.append(slash[1])
slash = katana.pop()
else:
break
if len(katana) > 1:
a,b... |
s103951205 | p03472 | u628758223 | 1515383145 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 498 | n, h = map(int,input().split())
a=[]
b=[]
temp=[0,0]
count = 0
for _ in range(n):
temp[0], temp[1] = map(int,input().split())
a.append(temp[0])
b.append(temp[1])
max = max(a)
a=a.sort(reverse=True)
b=b.sort(reverse=True)
for j in range(n):
if max<b[j]:
bdepth = j
htemp = h
while count<bdepth:
htemp-=c[count]
co... |
s960495707 | p03472 | u628758223 | 1515383109 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 444 | #include <stdio.h>
int main(void) {
int n,h, a[200000], b[200000], max, i, count = 0;
scanf("%d %d", &n, &h);
max = a[0];
for(i=0;i<n;i++){
scanf("%d %d",&a[i],&b[i]);
}
for(i=0;i<n;i++){
if(max<a[i]) max = a[i];
}
for(i=0;i<n;i++){
if(max<b[i]){
h -= b[i];
count++;
}
if(h<0){
printf... |
s882819944 | p03472 | u280269055 | 1515382907 | Python | Python (3.4.3) | py | Runtime Error | 598 | 36080 | 768 | n,h = map(int, input().split())
katana = [list(map(int, input().split())) for _ in range(n)]
turn = 0
katana.sort()
slash = katana.pop()
throw = []
while True:
k = katana.pop()
if k[0] == slash[0]:
throw.append(slash[1])
slash = k
else:
break
if len(katana) > 1:
a,b = map(list,... |
s896861207 | p03472 | u401093859 | 1515382403 | Python | Python (3.4.3) | py | Runtime Error | 432 | 29352 | 971 | import math
N_H = list(map(int, input().split()))
a_b= [list(map(int, input().split())) for _ in range(N_H[0])]
length =len(a_b)
a= [a_b[i][0] for i in range(length)]
b= [a_b[i][1] for i in range(length)]
counter = 0
i = 0
pattern = 0
a_max = max(a)
a_max_idx = a.index(a_max)
b_a_max_idx = b[a_max_idx]
b.pop(a_m... |
s906529917 | p03472 | u628758223 | 1515382347 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 435 | #include <stdio.h>
int main(void) {
int n,h, a[200000], b[200000], max, i, count = 0;
scanf("%d %d", &n, &h);
max = a[0];
for(i=0;i<n;i++){
scanf("%d %d",&a[i],&b[i]);
}
for(i=0;i<n;i++){
if(max<a[i]) max = a[i];
}
for(i=0;i<n;i++){
if(max<b[i]){
h -= b[i];
count++;
}
if(h<0){
printf... |
s736055655 | p03472 | u401093859 | 1515382324 | Python | Python (3.4.3) | py | Runtime Error | 418 | 29376 | 922 | import math
N_H = list(map(int, input().split()))
a_b= [list(map(int, input().split())) for _ in range(N_H[0])]
length =len(a_b)
a= [a_b[i][0] for i in range(length)]
b= [a_b[i][1] for i in range(length)]
counter = 0
i = 0
pattern = 0
a_max = max(a)
a_max_idx = a.index(a_max)
b_a_max_idx = b[a_max_idx]
b.pop(a_m... |
s599179014 | p03472 | u255280439 | 1515382164 | Python | Python (3.4.3) | py | Runtime Error | 313 | 11676 | 718 | def main():
N, H = map(int, input().split())
cuts = []
throws = []
for i in range(N):
tmp = [int(j) for j in input().split()]
cuts.append(tmp[0])
throws.append(tmp[1])
max_cut = max(cuts)
# 切るだけでおｋ
if max_cut >= max(throws):
n_cut = H // sum(max_cut)
... |
s543426046 | p03472 | u650950012 | 1515382062 | Python | Python (3.4.3) | py | Runtime Error | 376 | 38644 | 460 | import math
count = 0
n, h = map(int, input().split(' '))
ab = [input().split(' ') for _ in range(n)]
def main(n, h):
max_a = int(sorted(ab, key=lambda x: int(x[0]), reverse=True)[0][0])
for x in sorted(ab, key=lambda x: x[1], reverse=True):
if int(x[1]) >= max_a:
h -= int(x[1])
... |
s360781154 | p03472 | u401093859 | 1515381948 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 29376 | 787 | import math
N_H = list(map(int, input().split()))
a_b= [list(map(int, input().split())) for _ in range(N_H[0])]
length =len(a_b)
a= [a_b[i][0] for i in range(length)]
b= [a_b[i][1] for i in range(length)]
counter = 0
i = 0
pattern = 0
a_max = max(a)
a_max_idx = a.index(a_max)
b_a_max_idx = b[a_max_idx]
b.pop(a_m... |
s098993863 | p03472 | u650950012 | 1515381918 | Python | Python (3.4.3) | py | Runtime Error | 391 | 38516 | 452 | import math
count = 0
n, h = map(int, input().split(' '))
ab = [input().split(' ') for _ in range(n)]
def main():
max_a = int(sorted(ab, key=lambda x: int(x[0]), reverse=True)[0][0])
for x in sorted(ab, key=lambda x: x[1], reverse=True):
if int(x[1]) >= max_a:
h -= int(x[1])
... |
s336434349 | p03472 | u401093859 | 1515381731 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 30712 | 787 | import math
N_H = list(map(int, input().split()))
a_b= [list(map(int, input().split())) for _ in range(N_H[0])]
length =len(a_b)
a= [a_b[i][0] for i in range(length)]
b= [a_b[i][1] for i in range(length)]
counter = 0
i = 0
pattern = 0
a_max = max(a)
a_max_idx = a.index(a_max)
b_a_max_idx = b[a_max_idx]
b.pop(a_m... |
s673206001 | p03472 | u059273468 | 1515381563 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 1225 | itemgetter
attackCount = 0
N, H = map(int, raw_input().split())
swords = []
for _ in xrange(N):
swords.append(map(int, raw_input().split()))
swords.sort(key=itemgetter(0), reverse=True)
niceWeapon = swords.pop(0)
subWeapons = [x for x in swords if x[1] > niceWeapon[0]]
subWeapons.sort(key=itemgetter(1), reve... |
s878567372 | p03472 | u650950012 | 1515381475 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 321 | import math
damage = 0
count = 0
n, h = map(int, input().split(' '))
a = []
b = []
for _ in range(n):
temp = input().split(' ')
a.append(int(temp[0]))
b.append(int(temp[1]))
for x in b:
if x >= max(a):
damage += x
count += 1
count += math.ceil(((h - damage) / max(a))
print(count... |
s852764770 | p03472 | u650950012 | 1515381406 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 294 | import math
count = 0
n, h = map(int, input().split(' '))
a = []
b = []
for _ in range(n):
temp = input().split(' ')
a.append(int(temp[0]))
b.append(int(temp[1]))
for x in b:
if x >= max(a):
h -= x
count += 1
count += math.ceil((h / max(a))
print(count) |
s592882395 | p03472 | u650950012 | 1515381103 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 302 | import math
count = 0
n, h = map(int, input().split(' '))
ab = [input().split(' ') for _ in range(n)]
max_a = int(sorted(ab, key=lambda x: int(x[0]), reverse=True)[0][0])
for x in ab:
if int(x[1]) >= max_a:
h -= int(x[1])
count += 1
count += math.ceil((h / max_a)
print(count) |
s190011629 | p03472 | u579875569 | 1515380917 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 502 | def solve():
N,H = list(map(int, input().split()))
az = []
bz = []
for i in range(N):
a,b = list(map(int, input().split()))
az.append(a)
bz.append(b)
amax = max(az)
bz.sort(reverse=True)
cnt = 0
for b in bz:
if amax < b:
H -= b
... |
s473240072 | p03472 | u873262353 | 1515380702 | Python | Python (3.4.3) | py | Runtime Error | 427 | 51712 | 570 | import numpy as np
N,H=map(int,input().split())
ab=[input().split() for i in range(N)]
a = [int(ab[i][0]) for i in range(N)]
maxa = max(a)
b = np.array([int(ab[i][1]) for i in range(N)])
b_effective = b[b > maxa]
d = 0
if sum(b_effective) < Y:
c = len(b_effective)
rest = H - sum(b_effective)
if rest % maxa ... |
s067062087 | p03472 | u873262353 | 1515380643 | Python | Python (3.4.3) | py | Runtime Error | 238 | 37808 | 551 | N,H=map(int,input().split())
ab=[input().split() for i in range(N)]
a = [int(ab[i][0]) for i in range(N)]
maxa = max(a)
b = np.array([int(ab[i][1]) for i in range(N)])
b_effective = b[b > maxa]
d = 0
if sum(b_effective) < Y:
c = len(b_effective)
rest = H - sum(b_effective)
if rest % maxa == 0:
d = r... |
s126931655 | p03472 | u846150137 | 1515380408 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 383 | mport math
n,m=[int(i) for i in input().split()]
a=[]
b=[]
for i in range(n):
a0,b0=[int(i) for i in input().split()]
a.append(a0)
b.append(b0)
a.sort(reverse=True)
b.sort(reverse=True)
x=0
while m>0:
if b==[]:
x+=math.ceil(m/a[0])
break
else:
if b[0]>a[0]:
m-=b[0]
del b[0]
x+=1... |
s791482360 | p03472 | u873262353 | 1515380349 | Python | Python (3.4.3) | py | Runtime Error | 251 | 37808 | 429 | N,H=map(int,input().split())
ab=[input().split() for i in range(N)]
a = [int(ab[i][0]) for i in range(N)]
maxa = max(a)
b = np.array([int(ab[i][1]) for i in range(N)])
b_effective = b[b > maxa]
b = np.sort(b_effective)[::-1]
s = 0
for i in range(len(b)):
s += b[i]
if s >= Y:
c = i + 1
break
rest... |
s233468587 | p03472 | u846150137 | 1515380196 | Python | Python (3.4.3) | py | Runtime Error | 1909 | 11312 | 318 | import math
n,m=[int(i) for i in input().split()]
a=[]
b=[]
for i in range(n):
a0,b0=[int(i) for i in input().split()]
a.append(a0)
b.append(b0)
a.sort(reverse=True)
b.sort(reverse=True)
x=0
while m>0:
if b[0]>a[0]:
m-=b[0]
del b[0]
x+=1
else:
x+=math.ceil(m/a[0])
break
print(x) |
s558862920 | p03472 | u870262604 | 1515380121 | Python | Python (3.4.3) | py | Runtime Error | 453 | 20952 | 440 | n, h = input().split()
n = int(n)
h = int(h)
a = []
b = []
for i in range(n):
a_, b_ = input().split()
a.append(int(a_))
b.append(int(b_))
import numpy as np
a = np.array(a)
b = np.array(b)
to_throw = b[b>max(a)]
sum_throw = sum(to_throw)
d = h - sum_throw
if d <= 0:
cum = np.cumsum(np.sort(b)[::-1... |
s283871498 | p03472 | u873262353 | 1515380095 | Python | Python (3.4.3) | py | Runtime Error | 408 | 51712 | 403 | import numpy as np
N,H=map(int,input().split())
ab=[input().split() for i in range(N)]
a = [int(ab[i][0]) for i in range(N)]
maxa = max(a)
b = np.array([int(ab[i][1]) for i in range(N)])
b_effective = b[b > maxa]
b = np.sort(b_effective)[::-1]
s = 0
i = 0
while s < Y and i < len(b):
s += b[i]
i += 1
rest = H-sum(b_ef... |
s612487124 | p03472 | u425351967 | 1515379792 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 327 | N, H = map(int, input().split())
B = []
a_max = 0
for i in range(N):
a, b = map(int, input().split())
a_max = max(a_max, a)
B.append(b)
B = sorted([b for b in B if b > a_max], reverse = True)
cnt = 0
for b in B:
H -= b
cnt += 1
if H <= 0:
break
if H > 0:
cnt += ((H-1) // a_max) + 1
prin... |
s220298975 | p03472 | u425351967 | 1515379728 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 327 | N, H = map(int, input().split())
B = []
a_max = 0
for i in range(N):
a, b = map(int, input().split())
a_max = max(a_max, a)
B.append(b)
B = sorted([b for b in B if b > a_max], reverse = True)
cnt = 0
for b in B:
H -= b
cnt += 1
if H <= 0:
break
if H > 0:
cnt += ((H-1) // a_max) + 1
prin... |
s237628833 | p03472 | u340781749 | 1515379305 | Python | Python (3.4.3) | py | Runtime Error | 357 | 15996 | 652 | from bisect import bisect, bisect_left
from itertools import accumulate
from math import ceil
def solve(h, aa, bb):
max_a = max(aa)
bf = list(filter(lambda x: x > max_a, bb))
bf.sort(reverse=True)
bba = list(accumulate(bf))
remain = h - bba[-1]
slash_cnt = max(0, ceil(remain / max_a))
slas... |
s623221702 | p03472 | u926678805 | 1515378144 | Python | Python (3.4.3) | py | Runtime Error | 514 | 21528 | 383 | n,h=map(int,input().split())
d=[]
mx=-1
sm=0
for i in range(n):
a,b=map(int,input().split())
mx=max(mx,a)
d.append([b,a])
da=[]
for i in range(n):
if d[i][0]>mx:
da.append(d[i])
da=sorted(da,reverse=True)
i=0
for x in da:
i+=1
sm+=x[0]
if sm>=h:
print(i)
exit()
da=sor... |
s939572169 | p03473 | u477696265 | 1599312174 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9012 | 44 | a = input()
b = 24 - a
c = 24 + b
print(c) |
s274519348 | p03473 | u355154595 | 1598844934 | Python | Python (3.8.2) | py | Runtime Error | 19 | 8904 | 30 | a=int(input())
print(24+(24-a) |
s327561488 | p03473 | u054782559 | 1598554071 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9176 | 21 | a=input()
print(48-a) |
s622750146 | p03473 | u918422508 | 1598249210 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8904 | 31 | a = input()
a = 48 - a
print(a) |
s962806626 | p03473 | u512551187 | 1598216315 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 74580 | 21 | print(48-int(input()) |
s971630504 | p03473 | u911622131 | 1597871495 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 19 | print(48 - input()) |
s451036318 | p03473 | u710282484 | 1597335960 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9016 | 23 | i=(48-i)
print(input()) |
s291485262 | p03473 | u710282484 | 1597335919 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9080 | 26 | print(48-i)
i=int(input()) |
s187509888 | p03473 | u370721525 | 1597315344 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9036 | 41 | M = int(input())
ans = 48 - M
printg(ans) |
s666229120 | p03473 | u863044225 | 1594342834 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8952 | 2730 | #include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using VI = vector<int>;
using VL = vector<ll>;
using VS = vector<string>;
template<class T> using PQ = priority_queue<T, vector<T>, greater<T>>;
#define FOR(i,a,n) for(int i=(a);i<(n);++i)
#define eFOR(i,a,n) for(int i=(a);i<=(n... |
s734910817 | p03473 | u653837719 | 1594069486 | Python | PyPy3 (7.3.0) | py | Runtime Error | 128 | 74092 | 23 | print(48 - int(input()) |
s702053056 | p03473 | u168416324 | 1593871320 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8764 | 21 | print(48-int(input()) |
s552553885 | p03473 | u955691979 | 1593831827 | Python | PyPy3 (7.3.0) | py | Runtime Error | 91 | 74788 | 38 | x = int(input())
pritn(24 + (24 - x)) |
s630051169 | p03473 | u440478998 | 1593552209 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9080 | 21 | print(48-int(input()) |
s453475644 | p03473 | u940765148 | 1593125453 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8880 | 25 | m = input()
print(48 - m) |
s545638279 | p03473 | u176582473 | 1591974367 | Python | Python (3.4.3) | py | Runtime Error | 83 | 7628 | 965 | def calc_prime(n):
primes = set(list(range(3, n, 2)))
primes.add(2)
for a in range(3, n, 2):
for i in range(a, n):
x = a * i
if x >= n:
break
if x in primes:
primes.remove(x)
return primes
def collect_likes(ps):
likes = s... |
s430695026 | p03473 | u176582473 | 1591974317 | Python | Python (3.4.3) | py | Runtime Error | 83 | 7536 | 965 | def calc_prime(n):
primes = set(list(range(3, n, 2)))
primes.add(2)
for a in range(3, n, 2):
for i in range(a, n):
x = a * i
if x >= n:
break
if x in primes:
primes.remove(x)
return primes
def collect_likes(ps):
likes = s... |
s966544824 | p03473 | u979078704 | 1591815315 | Python | PyPy3 (2.4.0) | py | Runtime Error | 186 | 42608 | 505 | is_prime = [1]*101010
is_prime[0] = 0
is_prime[1] = 0
max = 101010
for i in range(2,max):
if is_prime[i]:
j = i*2
while j <= max-1:
is_prime[j] = 0
j += i
a = [0]*max
for i in range(max):
if(i%2==0):
continue
if(is_prime[i]==1 and is_prime[(i+1)//2]==1):
... |
s528796676 | p03473 | u243572357 | 1591811599 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | a = int(input())
prnt(48 - a) |
s186653910 | p03473 | u594956556 | 1591391485 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 21 | print(48-int(input()) |
s981720755 | p03473 | u600261652 | 1590965189 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 36 | M = int(input())
print(48-M) |
s981407703 | p03473 | u857673087 | 1590887740 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 22 | print(48 -int(input()) |
s500711487 | p03473 | u496687522 | 1590844487 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 122 | N = input()
if (N[0] == N[1] and N[1] == N[2]) or (N[1] == N[2] and N[1] == N[3]):
print('Yes')
else:
print('No') |
s809824465 | p03473 | u063425684 | 1590798494 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 115 | #include <bits/stdc++.h>
using namespace std;
int main() {
int M ;
cin >> M;
cout << (24 - M) + 24;
} |
s309851806 | p03473 | u338964200 | 1590272661 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 22 | 1<=M<=23
print(48 - M) |
s199494676 | p03473 | u338964200 | 1590272552 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 28 | M>=1 and M<=23
print(M + 24) |
s142243029 | p03473 | u763249708 | 1589710932 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 31 | m = int(input())
print(24-m+24 |
s719013851 | p03473 | u744920373 | 1589684523 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | def ii(): return int(sys.stdin.readline())
M = ii()
print(48-M) |
s586350488 | p03473 | u902380746 | 1589302738 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 125 | import sys
import math
import bisect
def main():
n = int(input())
print(48 - n)
if __name__ == "__main__":
main()
|
s119764394 | p03473 | u034128150 | 1589059085 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3448 | 4763 | numbers_like_2017 = [3, 5, 13, 37, 61, 73, 157, 193, 277, 313, 397, 421, 457, 541, 613, 661, 673, 733, 757, 877, 997, 1093, 1153, 1201, 1213, 1237, 1321, 1381, 1453, 1621, 1657, 1753, 1873, 1933, 1993, 2017, 2137, 2341, 2473, 2557, 2593, 2797, 2857, 2917, 3061, 3217, 3253, 3313, 3517, 3733, 4021, 4057, 4177, 4261, 4273... |
s927069096 | p03473 | u604655161 | 1589050075 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | M = int(input())
print(48-M) |
s993747164 | p03473 | u604655161 | 1589050058 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 39 | M = int(input())
print(48-M) |
s211889343 | p03473 | u980161268 | 1588487452 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | #include <bits/stdc++.h>
using namespace std;
int M;
int main() {
cout<< 48-M <<endl;
} |
s063026374 | p03473 | u980161268 | 1588487389 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 11 | print(48-M) |
s872695499 | p03473 | u036492525 | 1588032504 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | m=int(input())
print(48-m) |
s117733305 | p03473 | u706786134 | 1587939108 | Python | Python (3.4.3) | py | Runtime Error | 285 | 21616 | 308 | import numpy as np
from math import factorial
from collections import Counter
n = int(input())
a = np.array(input().split(), np.int32)
S = np.zeros(n + 1, np.int32)
S[1:] = np.cumsum(a)
cnt = Counter(S)
ans = 0
for x in cnt:
# nC2
if cnt[x] > 1:
ans += cnt[x] * (cnt[x] - 1) // 2
print(ans) |
s261464104 | p03473 | u235066013 | 1587737481 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 21 | x=input()
print(48-x) |
s368353797 | p03473 | u896741788 | 1587606883 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 21 | print(48-int(input()) |
s079269575 | p03473 | u309141201 | 1587408082 | Python | PyPy3 (2.4.0) | py | Runtime Error | 371 | 44636 | 526 | Q = int(input())
def is_prime(n):
if n == 1: return False
for k in range(2, int(n**0.5)+1):
if n % k == 0:
return 0
return n
prime_numbers = [is_prime(i) for i in range(2, 10**5 + 1) if is_prime(i) != 0]
same = [0]*(10**5 + 1)
for n in prime_numbers:
if (n+1) // 2 in prime_numbers:... |
s368023794 | p03473 | u229518917 | 1587240374 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 176 | A,B=map(int,input().split())
S=input()
if (S[0:A].isdecimal()==True) and (S[A+1:-1].isdecimal()==True) and (S[A]=='-') and len(S)==x+y+1:
print('Yes')
else:
print('No') |
s500726244 | p03473 | u744920373 | 1586992152 | Python | Python (3.4.3) | py | Runtime Error | 268 | 7984 | 1118 | import sys
sys.setrecursionlimit(10**8)
def ii(): return int(sys.stdin.readline())
def mi(): return map(int, sys.stdin.readline().split())
def li(): return list(map(int, sys.stdin.readline().split()))
def li2(N): return [list(map(int, sys.stdin.readline().split())) for _ in range(N)]
def dp2(ini, i, j): return [[ini]*i... |
s804997284 | p03473 | u652656291 | 1586809504 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 12 | print(48-{}) |
s818003933 | p03473 | u323210830 | 1586541865 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 11 | print(48-M) |
s730878390 | p03473 | u581603131 | 1586442336 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 23 | print(48 - int(input()) |
s432460895 | p03473 | u191394596 | 1585418028 | Python | PyPy3 (2.4.0) | py | Runtime Error | 184 | 40048 | 546 | from bisect import bisect, bisect_left
size = 10 ** 5 + 1
is_prime = [True] * size
is_prime[0] = is_prime[1] = False
# √size まで
for i in range(2, 317):
j = 2 * i
while j < size:
is_prime[j] = False
j += i
like_numbers = [
i
for i, x in enumerate(is_prime)
if x and (i + 1) % 2 == 0 and is_prime[(... |
s150467976 | p03473 | u460155459 | 1584978315 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 13 | x = (48 - M ) |
s517198312 | p03473 | u379720557 | 1584703740 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | t = int(input())
x = 48 - t
return x |
s340694372 | p03473 | u379720557 | 1584703669 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | t = int(input())
return 48-t |
s880540883 | p03473 | u497952650 | 1584584910 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | print(48-int(input())
|
s377673494 | p03473 | u886163042 | 1584242658 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 19 | print(48 - input()) |
s377182287 | p03473 | u393881437 | 1583873721 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 151 | a,b = list(map(int,input().split()))
s = input()
num = s[:a] + s[a+1]
print('Yes' if s[a+1] == '-' and len(s) == a+b+1 and ('-' not in num) else 'No')
|
s737868657 | p03473 | u207799478 | 1583097032 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3828 | 206 | import math
import string
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//math.factorial(n-r)*math.factorial(r)
m = int(input)
print(24+(24-m))
|
s399715295 | p03473 | u207799478 | 1583096993 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 207 | import math
import string
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//math.factorial(n-r)*math.factorial(r)
m = int(input)
print(24+(24-m)s)
|
s215584147 | p03473 | u964182912 | 1582754995 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 40 | M=input("type a number")
x=48-M
print(x) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.