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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s837813688 | p03498 | u392319141 | 1591156440 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 690 | N = int(input())
A = list(map(int, input().split()))
ans = []
for i in range(N - 1):
l, r = A[i], A[i + 1]
if l > r:
addR = None
if 0 < r:
addR = True
if l < 0:
addR = False
if r <= 0 <= l:
if abs(l) >= abs(r):
addR = True... |
s985262215 | p03498 | u619144316 | 1591154558 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 527 | N = int(input())
A = list(map(int,input().split()))
ans = []
i = 0
while A[i] > 0:
i += 1
n = i
for i in range(n-1,0,-1):
if A[i] < A[i-1]:
A[i-1] += A[i]
ans.appned(i+1,i)
for i in range(n,N-1):
if A[i] <= A[i+1]:
continue
else:
if A[i+1] >= 0:
A[i+1] += A... |
s454201204 | p03498 | u703950586 | 1590178685 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2110 | 73580 | 1567 | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**7
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
N = NI()
A... |
s215790014 | p03498 | u703950586 | 1590173434 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2108 | 73580 | 1350 | import sys,queue,math,copy,itertools,bisect,collections,heapq
def main():
sys.setrecursionlimit(10**7)
INF = 10**7
MOD = 10**9 + 7
LI = lambda : [int(x) for x in sys.stdin.readline().split()]
NI = lambda : int(sys.stdin.readline())
SI = lambda : sys.stdin.readline().rstrip()
N = NI()
A... |
s273701866 | p03498 | u871352270 | 1587176936 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38384 | 589 | N = int(input())
a = list(map(int, input().split()))
if abs(max(a)) >= abs(min(a)):
for i in range(N):
if a[i] = max(a):
num = i
break
print(2*N-1)
for i in range(N):
if num != i:
print(num+1, i+1)
print(num+1, num+1)
for i in range(1,N):
p... |
s581301473 | p03498 | u871352270 | 1587175316 | Python | PyPy3 (2.4.0) | py | Runtime Error | 2144 | 862476 | 914 | N = int(input())
a = list(map(int, input().split()))
cnt1 = 0
li1 = []
for i in range(1,N):
M = max(a)
num = 0
for j in range(N):
if a[j] == M:
n = j
if a[i] < a[i-1]:
num += -((-a[i-1]+a[i])//M)
if num < 0:
cnt1 = -1
break
a[i] += num*... |
s094896310 | p03498 | u779455925 | 1583993553 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38512 | 1087 | """from collections import *
from itertools import *
from bisect import *
from heapq import *
import math
from fractions import gcd"""
import sys
#input = sys.stdin.readline
import copy
N=int(input())
Amoto=list(map(int,input().split()))
A=copy.copy(Amoto)
_min=A[0]
minidx=0
for i in range(1,N):
if _min>A[i]:
... |
s719889493 | p03498 | u163320134 | 1582781177 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3320 | 2573 | n=int(input())
arr=list(map(int,input().split()))
arr=[[arr[i],i+1] for i in range(n)]
mins=[10**18,0]
maxs=[-10**18,0]
flag=True
for i in range(n):
if arr[i][0]<mins[0]:
mins=[arr[i][0],arr[i][1]]
if arr[i][0]>maxs[0]:
maxs=[arr[i][0],arr[i][1]]
cnt=0
ans=[]
if maxs[0]<0:
for i in range(n):
flag=Fals... |
s589445653 | p03498 | u163320134 | 1582781093 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3448 | 2585 | n=int(input())
arr=list(map(int,input().split()))
arr=[[arr[i],i+1] for i in range(n)]
mins=[10**18,0]
maxs=[-10**18,0]
flag=True
for i in range(n):
if arr[i][0]<mins[0]:
mins=[arr[i][0],arr[i][1]]
if arr[i][0]>maxs[0]:
maxs=[arr[i][0],arr[i][1]]
cnt=0
ans=[]
if maxs[0]<0:
for i in range(n):
flag=Fals... |
s811214955 | p03498 | u677523557 | 1570460597 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3188 | 1098 | N = int(input())
A = list(map(int, input().split()))
for l in range(N+1):
B = A[:]
ok = True
ans = []
if l < N:
if A[l] <= 0:
ok = False
for r in range(l, N-1):
a, b = B[r], B[r+1]
if a <= b:
count = 0
else:
... |
s919084631 | p03498 | u077337864 | 1553641683 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 532 | n = int(input())
alist = list(map(int, input().split()))
maxa, mina = max(alist), min(alist)
ans = []
if abs(maxa) >= abs(mina):
p = alist.index(maxa) + 1
for i in range(n):
alist[i] += maxa
ans.append((p, i+1))
for i in range(n-1):
alist[i+1] += alist[i]
ans.append((i+1, i+2))
else:
p = alist.... |
s901163657 | p03498 | u077337864 | 1553640024 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 524 | n = int(input())
alist = list(map(int, input().split()))
maxa, mina = max(alist), min(alist)
ans = []
if abs(maxa) >= abs(mina):
p = alist.index(maxa) + 1
for i in range(n):
alist[i] += maxa
ans.append((p, i+1))
for i in range(n-1):
alist[i+1] += a[i]
ans.append((i+1, i+2))
else:
p = alist.inde... |
s832622233 | p03498 | u005388620 | 1520474237 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 172 | n = int(input())
lis = list(map(int, input().split()))
for i in range(1,n):
if lis[i] + lis[i+1] > = 0:
print(i,i+1)
print(i,i+1)
else:
print(i+1,i)
print(i+1,i) |
s310926566 | p03498 | u177481830 | 1515559934 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 349 | N=int(input())
a_lst=[int(_) for _ in input().split()]
a_arr=np.array(a_lst)
idx=np.absolute(a_arr).argmax() + 1 #1origin
print(2*N-2)
for i in range(1, N+1):
if i != idx:
print(idx, i)
if a_lst[idx-1]>0:
for i in range(1, N):
print(i, i+1)
elif a_lst[idx-1]<0:
for i in range(N, 1):
... |
s426452276 | p03498 | u651925006 | 1515084676 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 2432 | import java.io.*;
import java.util.*;
class Main {
static int p=0;
static int[]ops;
static long[]a;
static int n;
static void add(int x,int y){
a[y]+=a[x];
ops[p++]=x*n+y;
}
public static void main(String[] args) {
MyScanner sc = new MyScanner();
out = new P... |
s197515816 | p03498 | u628047647 | 1513185340 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 523 | n = int(input())
a = list(map(int, input().split()))
ma = -100000000
mi = 100000000
for i in range(n):
if a[i] > ma:
ma = a[i]
ma_index = i
if a[i] < mi:
mi = a[i]
mi_index = i
ans = []
if ma >= -mi:
for i in range(n):
ans.append((ma_index,i))
for i in range(n-1):... |
s642035178 | p03498 | u628047647 | 1513185247 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 519 | n = int(input())
a = list(map(int, input().split()))
ma = -100000000
mi = 100000000
for i in range(n):
if a[i] > ma:
ma = a[i]
ma_index = i
if a[i] < mi:
mi = a[i]
mi_index = i
ans = []
if ma >= -mi:
for i in range(n):
ans.append((ma_index,i))
for i in range(n-1):... |
s639651220 | p03498 | u628047647 | 1513150592 | Python | Python (3.4.3) | py | Runtime Error | 86 | 4000 | 1380 | # coding: utf-8
import sys
def solve(a, begin, end, queue):
if begin >= end:
return
if end - begin == 1:
return
maxx = sorted(list(map(abs, a[begin:end + 1])), reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1 * maxx)
maxx = -1 * maxx
... |
s155360584 | p03498 | u628047647 | 1513150509 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1455 | # coding: utf-8
import sys
def solve(a, begin, end, queue):
#print(begin, end)
if begin >= end:
return
if end - begin == 1:
return
maxx = sorted(list(map(abs, a[begin:end + 1])), reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1 * maxx)
... |
s737432898 | p03498 | u628047647 | 1513150402 | Python | Python (3.4.3) | py | Runtime Error | 89 | 4000 | 1454 | # coding: utf-8
import sys
def solve(a, begin, end, queue):
#print(begin, end)
if begin >= end:
return
if end - begin == 1:
return
maxx = sorted(list(map(abs, a[begin:end + 1])), reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1 * maxx)
... |
s590008341 | p03498 | u628047647 | 1513145942 | Python | Python (3.4.3) | py | Runtime Error | 86 | 4004 | 1216 | # coding: utf-8
import sys
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
return []
i... |
s326352003 | p03498 | u628047647 | 1513145925 | Python | Python (3.4.3) | py | Runtime Error | 86 | 4000 | 1216 | # coding: utf-8
import sys
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
return []
i... |
s181910722 | p03498 | u528224561 | 1513145473 | Python | Python (3.4.3) | py | Runtime Error | 83 | 4000 | 1034 | # coding: utf-8
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
return []
if maxx>0:
solve(a,begin,m-1,queue)
for i in range(max... |
s515145308 | p03498 | u528224561 | 1513145317 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1231 | # coding: utf-8
import sys
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
retur... |
s561990194 | p03498 | u528224561 | 1513144854 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3212 | 1072 | # coding: utf-8
import sys
sys.setrecursionlimit(100)
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
return []
if maxx>0:
solve(a,b... |
s730170122 | p03498 | u528224561 | 1513144661 | Python | Python (3.4.3) | py | Runtime Error | 84 | 4004 | 1038 | # coding: utf-8
import sys
def solve(a,begin,end,queue):
if begin>=end:
return
maxx = sorted(list(map(abs,a[begin:end+1])),reverse=True)[0]
if maxx in a:
m = a.index(maxx)
else:
m = a.index(-1*maxx)
maxx = -1*maxx
if maxx==0:
return
if maxx>0:
solve(a,begin,m-1,queue)
for i in r... |
s630916936 | p03498 | u667084803 | 1513142827 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3188 | 423 | def positive(n):
for i in range(n-1):
print(i+1,i+2)
N=int(input())
A=list(map(int,input().split()))
mina=min(A)
minin=A.index(mina)
maxa=max(A)
maxin=A.index(maxa)
if mina>=0:
print(N-1)
positive(N)
elif maxa<=0:
print(N-1)
negative(N)
elif maxa+mina>=0:
print(2*N-1)
for i in range(N):
print(maxi... |
s085113664 | p03498 | u667084803 | 1513142758 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 415 | def positive(n):
for i in range(n-1):
print(i+1,i+2)
N=int(input())
A=list(map(int,input().split()))
mina=min(A)
minin=A.index(mina)
maxa=max(A)
maxin=A.index(maxa)
if mina>=0:
print(N-1)
positive(N)
elif maxa<=0:
print(N-1)
negative(N)
elif maxa+mina>=0:
print(2*N-1)
for i in range(N):
print(maxi... |
s384749910 | p03498 | u432780056 | 1512963735 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 819 | n, a = input(), map(int, raw_input().split())
max_i, max_a = 0, 0
for i in xrange(n):
if a[max_i] < a[i]:
max_a = a[i]
max_i = i
l = []
for _ in xrange(2 * n + 1):
print a
is_all_neg =
for i in xrange(n - 1):
if a[i] > a[i + 1]:
ans = 99999999
minn, flag =... |
s206321326 | p03498 | u136637945 | 1512961257 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2696 | 630 | n = input()
a = map(int, raw_input().split())
seq = []
for i in range(n - 1):
if a[i] <= a[i + 1]:
continue
if a[i] > 0 and a[i + 1] > 0:
seq.append((i, i + 1))
a[i + 1] += a[i]
elif a[i] < 0 and a[i + 1] < 0:
seq.append((i + 1, i))
a[i] += a[i + 1]
else:
... |
s184890744 | p03498 | u988832865 | 1512960566 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 38640 | 784 | N = int(input())
A = list(map(int, input().split()))
def add(i, A, ans):
ans.append((i, i + 1))
A[i + 1] += A[i]
def add2(i, A, ans):
ans.append((i + 1, i))
A[i] += A[i + 1]
ans = []
for i in range(N - 1):
if A[i] <= A[i + 1]:
continue
if A[i] >= 0:
if A[i + 1] >= 0:
... |
s456890198 | p03498 | u988832865 | 1512960361 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 38856 | 639 | N = int(input())
A = list(map(int, input().split()))
def add(i, A, ans):
ans.append((i, i + 1))
A[i + 1] += A[i]
def add2(i, A, ans):
ans.append((i + 1, i))
A[i] += A[i + 1]
ans = []
for i in range(N - 1):
if A[i] <= A[i + 1]:
continue
if A[i] >= 0:
if A[i + 1] >= 0:
... |
s864907802 | p03499 | u222668979 | 1589678128 | Python | PyPy3 (2.4.0) | py | Runtime Error | 180 | 38384 | 344 | n, k = map(int, input().split())
a = list(map(int, input().split()))
cnt = {}
for i in a:
if i in cnt.keys():
cnt[i] += 1
else:
cnt[i] = 1
cnt = sorted(cnt.items(), key=lambda x: x[1])
ans, k = 0, k - len(cnt)
for i in range(len(cnt) + 1):
if 0 <= k:
print(ans)
break
a... |
s442955664 | p03499 | u353797797 | 1574488990 | Python | Python (3.4.3) | py | Runtime Error | 3174 | 307216 | 1371 | import sys
from collections import *
sys.setrecursionlimit(10 ** 6)
int1 = lambda x: int(x) - 1
p2D = lambda x: print(*x, sep="\n")
def main():
def dfs(u=0):
if not to[u]:
dp[u] = [[0.5, 0.5, 0]]
return
dpu = []
for v in to[u]:
dfs(v)
v = uto... |
s398196874 | p03499 | u102461423 | 1563235481 | Python | Python (3.4.3) | py | Runtime Error | 781 | 53080 | 1400 | import sys
input = sys.stdin.readline
from collections import deque
MOD = 10 ** 9 + 7
N = int(input())
graph = [[] for _ in range(N+1)]
for i,x in enumerate(input().rstrip().split(),1):
x = int(x)
graph[i].append(x)
graph[x].append(i)
# 各深さから来ている (0個、1個、2個以上) の分布を 確率 mod MODで持つ。
half = (MOD + 1) // 2
d... |
s116719190 | p03499 | u411537765 | 1513198559 | Python | Python (3.4.3) | py | Runtime Error | 3164 | 107880 | 1196 | import sys
import functools
import operator
readline = sys.stdin.readline
N = int(input())
P = [-1 for _ in range(N + 1)]
C = [[] for _ in range(N + 1)]
for i, p in enumerate(input().split()):
P[i + 1] = int(p)
C[int(p)].append(i + 1)
D = [[] for _ in range(N + 1)]
D[0].append(0)
ans = 0
for depth in range(... |
s340197337 | p03499 | u411537765 | 1513197858 | Python | Python (3.4.3) | py | Runtime Error | 3162 | 107256 | 1280 | import sys
import functools
import operator
readline = sys.stdin.readline
N = int(input())
P = [-1 for _ in range(N + 1)]
C = [[] for _ in range(N + 1)]
for i, p in enumerate(readline().split()):
P[i + 1] = int(p)
C[int(p)].append(i + 1)
D = [[] for _ in range(N + 1)]
def add(depth, arr):
D[depth] += a... |
s775485476 | p03501 | u844196583 | 1600776189 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9076 | 48 |
if N * A < B:
print(N*A)
else:
print(B) |
s449177658 | p03501 | u596536048 | 1599422676 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8960 | 54 | N, A, B = map(int, input().split)
print(min(N * A, B)) |
s795876042 | p03501 | u343977188 | 1598626824 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9120 | 48 | N,A,B=map(int,input(),split())
print(min(N*A,B)) |
s240589115 | p03501 | u244836567 | 1598235127 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9088 | 67 | a,b,c=input().split()
if a*b<=c:
print(int(a*b))
else:
print(c) |
s627895750 | p03501 | u911622131 | 1598140758 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8976 | 74 | # coding = SJIS
n, a, b = map(int, input().split())
print(min(n * a), b) |
s267876224 | p03501 | u373047809 | 1597430157 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9924 | 771 | class Imos:
def __init__(self, n):
self.B = [0] * n
self.n = n
from itertools import accumulate
self.ac = accumulate
def __call__(self, l, r):
l, r = max(l, 0), min(r, self.n - 1)
self.B[l] += 1
if r + 1 != self.n:
self.B[r + 1] -= 1
def ... |
s728007703 | p03501 | u391589398 | 1597028172 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8956 | 61 | n, a, b = map(int, intput().split())
a = n*a
print(min(a, b)) |
s155204606 | p03501 | u243159381 | 1596428405 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9060 | 74 | n,a,b=map(int,input().split())
if n*a<b:
print(n*a)
else:
print(B) |
s993016303 | p03501 | u586639900 | 1594444133 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9156 | 73 | N, A, B = map(int, input())
if N * A <= B:
print(N*A)
else:
print(B) |
s630538074 | p03501 | u568130550 | 1594431274 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9052 | 61 | N=input()
print("No" if int(N) % sum(map(int, N)) else "Yes") |
s544003392 | p03501 | u095021077 | 1594346098 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9136 | 52 | N, A, B=map(int, input().split())
print(min(A*T, B)) |
s222566781 | p03501 | u047931063 | 1593928423 | Python | PyPy3 (7.3.0) | py | Runtime Error | 106 | 74516 | 52 | N, A, B = map(int,input().split())
print(min(N*A, B) |
s518688360 | p03501 | u762557532 | 1593828482 | Python | PyPy3 (7.3.0) | py | Runtime Error | 99 | 74792 | 1319 | ###==================================================
### import
#import bisect
#from collections import Counter, deque, defaultdict
#from copy import deepcopy
#from functools import reduce, lru_cache
#from heapq import heappush, heappop
#import itertools
#import math
#import string
import sys
### stdin
def input(): re... |
s771007286 | p03501 | u051496905 | 1591913584 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | N, A, B= map(int,input().split())
L =N*A
if L > K:
print(L)
else:
print(B) |
s158048047 | p03501 | u051496905 | 1591913408 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | N, A, B= map(int.input().split())
L =N*A
if L > K:
print(L)
else:
print(B) |
s018529405 | p03501 | u405256066 | 1591754497 | Python | Python (3.4.3) | py | Runtime Error | 147 | 12420 | 397 | # 1-index
from sys import stdin
import numpy as np
N,C = [int(x) for x in stdin.readline().rstrip().split()]
imos = [[0]*(10**5+2) for i in range(C+1)]
for i in range(N):
s,t,c = [int(x) for x in stdin.readline().rstrip().split()]
imos[c][s] += 1
imos[c][t+1] -= 1
imos = np.array(imos)[:,:-1]
#print(np.... |
s875992674 | p03501 | u594956556 | 1591342495 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 55 | N, A, B = map(int, input().split())
print(mint(N*A, B)) |
s680831892 | p03501 | u738898077 | 1590716020 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 51 | n,a,b = map(intm,input().split())
print(min(n*a,b)) |
s893428545 | p03501 | u896741788 | 1590700195 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 207 | n,c=map(int,input().split())
table=[0]*220000
for i in range(n):
a,s,c=map(int,input().split())
table[2*a-1]+=1
table[s*2]-=1
from itertools import accumulate
print(max(list(accumulate(table))))
|
s141502950 | p03501 | u247211039 | 1590378021 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 54 | N, A, B = map(int, input().split())
print(min(N*a, B)) |
s333265465 | p03501 | u607920888 | 1589987618 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | a,t,i=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i) |
s802034706 | p03501 | u607920888 | 1589987581 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | a,t=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i) |
s218527469 | p03501 | u607920888 | 1589987527 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 72 | a,t,i=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i) |
s160211689 | p03501 | u607920888 | 1589987349 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 65 | a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(i)
c=min(x,i) |
s747224381 | p03501 | u607920888 | 1589987240 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input())
c=min(x,i) |
s531421158 | p03501 | u607920888 | 1589987156 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 72 | a,t,x=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i) |
s893400563 | p03501 | u607920888 | 1589986738 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 70 | a,t=input().split()
a=int(a)
t=int(t)
x=a*t
i=int(input(i))
c=min(x,i) |
s320929933 | p03501 | u607920888 | 1589986589 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(input(i))
c=min(x,i) |
s206614427 | p03501 | u607920888 | 1589986498 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(i)
c=min(x.i) |
s717522131 | p03501 | u607920888 | 1589986406 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 67 | a,t=input().split()
a=int(a)
t=int(t)
x = a * t
i=int(i)
c=min(x,i) |
s907224093 | p03501 | u629350026 | 1589937041 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 48 | n,a,b=map(int,input().split())
print(min(a*t,b)) |
s021172364 | p03501 | u814663076 | 1588892009 | Python | PyPy3 (2.4.0) | py | Runtime Error | 293 | 65516 | 903 | # region header
import sys
import math
from bisect import bisect_left, bisect_right, insort_left, insort_right
from collections import defaultdict, deque, Counter
from copy import deepcopy
from fractions import gcd
from functools import lru_cache, reduce
from heapq import heappop, heappush
from itertools import accumul... |
s747766646 | p03501 | u957198490 | 1588854752 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | N,A,B = map(int,input().split())
print(min(N*A,B) |
s472999214 | p03501 | u122428774 | 1588790678 | Python | PyPy3 (2.4.0) | py | Runtime Error | 175 | 38256 | 44 | t,a,b=map(int,input());print((t*a,b)[t*a>b]) |
s681249560 | p03501 | u073139376 | 1588725180 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | n,a,b=map(int,input().split())
print(min(n*A,B)) |
s297392949 | p03501 | u973108807 | 1588640505 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | n,a,b = map(int, input().split())
print(min(n*a,b) |
s955027222 | p03501 | u193565131 | 1588394302 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | N=float(input())
A=float(input())
B=float(input())
price1=A*N
price2=B
print(min(price1,price2)) |
s624786490 | p03501 | u969226579 | 1588393807 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 117 | n = input()
digitSum = 0
for digit in n:
digitSum += int(digit)
print("Yes" if int(n) % digitSum == 0 else "No") |
s578407636 | p03501 | u806403461 | 1588299235 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 51 | N,A,B - map(int,input().split())
print(min(N*A,B)) |
s145638725 | p03501 | u162019547 | 1588036311 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | N, A, B = map(int, input().split())
if B > N*A
or B == N*A:
print(N*A)
else:
print(B) |
s181636552 | p03501 | u162019547 | 1588035579 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | N, A, B = int(input().split)
if B < N*A:
print(B)
else:
(N*A) |
s471791637 | p03501 | u172780602 | 1587921557 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | N=input()
cnt=0
for i in range(len(N)):
cnt+=int(N[i])
if int(N)%cnt==0:
print("Yes")
else:
print("No")
|
s111196685 | p03501 | u423585790 | 1587156906 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38640 | 209 | n,c=map(int,input().split())
stc=[[int(i) for i in input().split()] for _ in range(n)]
dp=[0]*(2*10**5+2)
for s,t,c in stc:
dp[2*s-1]+=1
dp[2*t]-=1
for i in range(2*10**5):
dp[i+1]+=dp[i]
print(max(dp))
|
s214173347 | p03501 | u652656291 | 1586809806 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | n,a,b = map(int,input(),split())
print(min(a*n,b)) |
s832790560 | p03501 | u799428010 | 1586632019 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | n,a,b=map(int,input(),split())
print(min(n*a,b))
|
s778143830 | p03501 | u799428010 | 1586631981 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 46 | n,a,b=[int,input(),split()]
print(min(n*a,b))
|
s245368222 | p03501 | u799428010 | 1586631954 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 46 | n,a,b=[int,input(),split()]
ptint(min(n*a,b))
|
s120584869 | p03501 | u799428010 | 1586631920 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | n,a,b=[int(i) for i in input().split()]
ptint(min(n*a,b))
|
s701929567 | p03501 | u799428010 | 1586631815 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | n,a,b=[int(i) for i in input().split()]
x=A*N:
if x>=B:
print(B)
else :
print(x)
|
s508657555 | p03501 | u799428010 | 1586631779 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | n,a,b=[int(i) for i in input().split()]
x=A*N
if x>=B:
print(B)
else :
print(x)
|
s106507005 | p03501 | u799428010 | 1586631741 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | n,a,b=[int(i) for i in input().split()]
x=A*N
if x>=B:
print(str(B))
else ;
print(str(x))
|
s203687140 | p03501 | u799428010 | 1586631672 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | N,A,B= map(int,input().split(' '))
x=A*N
if x>B:
print(B)
elif x=B:
print(B)
else ;
print(x) |
s925440736 | p03501 | u799428010 | 1586631537 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 115 | N,A,B= map(int,input().split(' '))
x=A*N:
if x>B:
print(str(B))
elif x=B:
print(str(B))
else ;
print(str(x))
|
s235244518 | p03501 | u799428010 | 1586631511 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 113 | N,A,B= map(int,input().split(' '))
x=A*N
if x>B:
print(str(B))
elif x=B:
print(str(B))
else ;
print(str(x)) |
s430934117 | p03501 | u586639900 | 1585912260 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3064 | 153 | N = input()
def digitsum(a):
x = 0
while a > 0:
x += a % 10
a /= 10
return x
if N % digitsum(N) == 0:
print('Yes')
else:
print('No')
|
s670832031 | p03501 | u482157295 | 1585877455 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | n,a,b = map(int().split())
print(min(n*a,b)) |
s417976375 | p03501 | u050641473 | 1585668720 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | N, A, B = map(int, input().split())
if N * A > B:
print(B)
else
print(N * A) |
s389232489 | p03501 | u450147945 | 1585532783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | N, A, B = map(int, input(),split())
print(min(A*N, B)) |
s041719118 | p03501 | u755180064 | 1585273867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 135 |
tmp = list(input()).split()
val = [int(v) for v in tmp]
if val[0] * val[1] >= val[2]:
ans = val[2]
else:
ans = val[0] * val[1] |
s654307216 | p03501 | u968846084 | 1585168207 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 431 | n=int(input())
F=[[0]*10 for i in range(n)]
for i in range(n):
F[i]=list(map(int,input().split()))
P=[[0]*11 for i in range(n)]
for i in range(n):
P[i]=list(map(int,input().split()))
ans=-10**10
for i in range(1,1024):
s=format(i,"12b")
A=[]
for j in range(10):
if s[-1-j]=="1":
A.append(j)
p=0
f... |
s517365728 | p03501 | u843318346 | 1584227110 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | n,a,b = map(int,input(),split())
print(min(a*n,b)) |
s120682651 | p03501 | u572142121 | 1583954743 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | n,a,b=map(int,input().split)
print(min(n*a,b)) |
s880530554 | p03501 | u326626914 | 1583471854 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | N = int(input())
total = 0
for i in range(1,n+1):
total += N
if N % sum(int(input())) == 0:
print('Yes')
else:
print('No') |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.