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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s897217500 | p03666 | u354915818 | 1499654523 | Python | Python (3.4.3) | py | Runtime Error | 86 | 4376 | 1337 | #N A B C D
s = input().split()
N = int(s[0])
A = int(s[1])
B = int(s[2])
C = int(s[3])
D = int(s[4])
operation = [-D , -C , +C , +D]
#A に opeをすると 4通りの答えがかえってくる
#残り演算回数を出す
#答えと残り演算回数から、到達可能な数字の範囲を出す
#答えがあればopeを行う
#答えがなければそこで終了
#最後まで到達できれば終了
def Kanousei(x , left) :
return [x - left * D , x - left * C , x + left ... |
s028053108 | p03666 | u264683849 | 1499653371 | Python | Python (3.4.3) | py | Runtime Error | 52 | 5716 | 1151 | from fractions import gcd
N,A,B,C,D=map(int,input().split())
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, x, y = egcd(b % a, a)
return (g, y - (b // a) * x, x)
if C==0 and D==0:
if A==B:
print("YES")
else:
print("NO")
elif C==0 or D==0:
if D==0:
... |
s857685268 | p03666 | u033407970 | 1499652996 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 988 | #include <iostream>
#include <stdio.h> /* printf, scanf, NULL */
#include <stdlib.h>
#include <math.h>
#include <iomanip> // std::setprecision
#include <algorithm>
#include <vector>
using namespace std;
int n,a,b,c,d,e;
int main(){
cin >> n >> a >> b >> c >> d;
long long i, j, k;
long long dist ... |
s107199643 | p03666 | u264683849 | 1499652765 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 1112 | from math import gcd
N,A,B,C,D=map(int,input().split())
def egcd(a, b):
if a == 0:
return (b, 0, 1)
else:
g, x, y = egcd(b % a, a)
return (g, y - (b // a) * x, x)
if C==0 and D==0:
if A==B:
print("YES")
else:
print("NO")
elif C==0 or D==0:
if D==0:
C,D... |
s999266343 | p03666 | u653807637 | 1499652567 | Python | Python (3.4.3) | py | Runtime Error | 2107 | 3692 | 1146 | # encoding:utf-8
import math
def main():
N, A, B, C, D = list(map(int, input().split()))
cur_list = [(A, A)]
for i in range(N - 1):
cur_list = calcNextList(cur_list, C, D)
cur_list =[x for x in cur_list if x[0] >= 0 and x[1] <= 10 ** 9]
cur_list = merge(cur_list)
print(cur_list)
for x in cur_list:
if x[... |
s583244847 | p03666 | u630088114 | 1499652041 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 519 | import sys
def diff(N,A,B,C,D):
mini = (B+(N-1)*D-A)/(C+D)
for i in xrange(mini, N-1):
lower_bound = A + i*C - (N-i-1)*D
upper_bound = A + i*D - (N-i-1)*C
print(lower_bound, upper_bound)
if lower_bound <= B and B <= upper_bound:
return True
elif B < lower_bou... |
s055779930 | p03667 | u102461423 | 1567613859 | Python | Python (3.4.3) | py | Runtime Error | 413 | 38884 | 907 | import sys
input = sys.stdin.readline
"""
・とりあえず部分点解法：各クエリに対してO(N)
・いくつかを残していくつかを自由に埋める
・残すもの：被覆区間がoverlapしないように残す
・つまり、区間で覆えている点が処理できて、区間で覆えていない点が他所から持ってこないといけない。
"""
N,M = map(int,input().split())
A = [int(x) for x in input().split()]
XY = [tuple(int(x) for x in input().split()) for _ in range(M)]
def subscore_sol... |
s623377690 | p03668 | u036104576 | 1596082753 | Python | Python (3.8.2) | py | Runtime Error | 319 | 26684 | 416 | N = int(input())
adj = [[] for _ in range(N)]
for i in range(N - 1):
x, y = map(int, input().split())
x -= 1
y -= 1
adj[x].append(y)
adj[y].append(x)
def dfs(v, p):
nim = 0
for u in adj[v]:
if u == p:
continue
nim ^= dfs(u, v)
if p == -1:
return nim
... |
s248348212 | p03668 | u431573188 | 1595738206 | Python | Python (3.8.2) | py | Runtime Error | 357 | 26676 | 465 | N = int(input())
Edges = list([] for _ in range(N))
for n in range (N-1):
x, y = map(int, input().split())
Edges[x-1].append(y-1)
Edges[y-1].append(x-1)
def dfs(cur_node, parent_node):
grundy = 0
for child_node in Edges[cur_node]:
if child_node == parent_node:
continue
e... |
s056974639 | p03668 | u754022296 | 1593657717 | Python | Python (3.8.2) | py | Runtime Error | 563 | 116240 | 238 | import sys
n=int(input())
sys.setrecursionlimit(n)
T=[[]for _ in"_"*(n+1)]
for _ in range(n-1):a,b=map(int,input().split());T[a]+=b,;T[b]+=a,
def d(v,p):
r=0
for s in T[v]:
if s!=p:r^=d(s,v)+1
return r
print("ABloibc e"[d(1,1)<1::2]) |
s463285815 | p03668 | u754022296 | 1593657626 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9136 | 239 | import sys
sys.setrecursionlimit(k:=2*n)
n=int(input())
T=[[]for _ in"_"*k]
for _ in range(n-1):a,b=map(int,input().split());T[a]+=b,;T[b]+=a,
def d(v,p):
r=0
for s in T[v]:
if s!=p:r^=d(s,v)+1
return r
print("ABloibc e"[d(1,1)<1::2]) |
s130107214 | p03668 | u488401358 | 1593381582 | Python | PyPy3 (7.3.0) | py | Runtime Error | 366 | 157812 | 852 | import sys
input=sys.stdin.readline
N=int(input())
edge=[[] for i in range(N)]
for i in range(N-1):
x,y=map(int,input().split())
edge[x-1].append(y-1)
edge[y-1].append(x-1)
def grundy(v,pv):
if v==0:
if len(edge[v])==1:
return grundy(edge[0][0],0)+1
else:
res=0... |
s615455734 | p03668 | u638795007 | 1592446808 | Python | PyPy3 (2.4.0) | py | Runtime Error | 722 | 144160 | 1871 | def examA():
N = I()
ans = 0
print(ans)
return
def examB():
N, A, B, C, D = LI()
for i in range(N-1):
low = A + i*C - (N-1-i)*D
up = A + i*D - (N-1-i)*C
if low<=B<=up:
print("YES")
return
print("NO")
return
def examC():
ans = 0
pr... |
s105040990 | p03668 | u168578024 | 1582608615 | Python | PyPy3 (2.4.0) | py | Runtime Error | 900 | 123424 | 378 | N=int(input())
g = [[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
nim = [-1 for i in range(N)]
def dfs(cur,par):
val = 0
for dst in g[cur]:
if dst == par:
continue
val ^= dfs(dst,cur) + 1
nim[cur] = val
return val
dfs(0 , -1)
#prin... |
s882276843 | p03668 | u168578024 | 1582608545 | Python | PyPy3 (2.4.0) | py | Runtime Error | 834 | 123680 | 377 | N=int(input())
g = [[] for i in range(N)]
for i in range(N-1):
a,b=map(int,input().split())
a -= 1
b -= 1
g[a].append(b)
g[b].append(a)
nim = [-1 for i in range(N)]
def dfs(cur,par):
val = 0
for dst in g[cur]:
if dst == par:
continue
val ^= dfs(dst,cur) + 1
nim[cur] = val
return val
dfs(0 , -1)
print... |
s349410595 | p03668 | u566211189 | 1534110213 | Python | Python (2.7.6) | py | Runtime Error | 396 | 24392 | 295 | def dfs(u, fa = 0):
global adj
res = 0
for v in adj[u]:
if v != fa:
res ^= dfs(v, u) + 1
return res
n = int(raw_input())
adj = [[] for i in range(n + 1)]
for i in range(n - 1):
x, y = map(int, raw_input().split())
adj[x].append(y)
adj[y].append(x)
print 'Alice' if dfs(1) else 'Bob' |
s545194386 | p03668 | u985443069 | 1499795286 | Python | Python (3.4.3) | py | Runtime Error | 589 | 41768 | 1270 | import sys
import random
random.seed = 1
# sys.stdin = open('d1.in')
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(input())
def read_str_list():
return input().split()
def read_str():
return input()
a = None
def dfs(root, parent):
res = 0
fo... |
s375342964 | p03668 | u985443069 | 1499790613 | Python | Python (3.4.3) | py | Runtime Error | 522 | 25920 | 723 | import sys
# sys.stdin = open('d1.in')
def read_int_list():
return list(map(int, input().split()))
def read_int():
return int(input())
def read_str_list():
return input().split()
def read_str():
return input()
a = None
def dfs(root, parent):
res = 0
for i in a[root]:
if i !=... |
s217001472 | p03668 | u257374434 | 1499655658 | Python | Python (3.4.3) | py | Runtime Error | 723 | 54180 | 969 | from collections import Counter
from collections import defaultdict
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N-1)]
node_count = list(zip(*XY))[0]+list(zip(*XY))[1]
counter= Counter(node_count)
d = defaultdict(list)
for x,y in XY:
d[x].append(y)
d[y].append(x)
def is_taisho(last,n... |
s831663710 | p03668 | u257374434 | 1499655647 | Python | Python (3.4.3) | py | Runtime Error | 838 | 54068 | 969 | from collections import Counter
from collections import defaultdict
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N-1)]
node_count = list(zip(*XY))[0]+list(zip(*XY))[1]
counter= Counter(node_count)
d = defaultdict(list)
for x,y in XY:
d[x].append(y)
d[y].append(x)
def is_taisho(last,n... |
s745137343 | p03668 | u257374434 | 1499655521 | Python | Python (3.4.3) | py | Runtime Error | 689 | 54084 | 931 | from collections import Counter
from collections import defaultdict
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N-1)]
node_count = list(zip(*XY))[0]+list(zip(*XY))[1]
counter= Counter(node_count)
d = defaultdict(list)
for x,y in XY:
d[x].append(y)
d[y].append(x)
def is_taisho(last,n... |
s049823799 | p03668 | u257374434 | 1499655495 | Python | Python (3.4.3) | py | Runtime Error | 725 | 55308 | 930 | from collections import Counter
from collections import defaultdict
N = int(input())
XY = [list(map(int,input().split())) for _ in range(N-1)]
node_count = list(zip(*XY))[0]+list(zip(*XY))[1]
counter= Counter(node_count)
d = defaultdict(list)
for x,y in XY:
d[x].append(y)
d[y].append(x)
def is_taisho(last,n... |
s164240594 | p03668 | u237316771 | 1499651442 | Python | Python (2.7.6) | py | Runtime Error | 363 | 21232 | 512 | def main():
def nim(i, parent=None):
ret = 0
for j in edges[i]:
if j == parent:
continue
ret ^= nim(j, i) + 1
return ret
n = int(raw_input())
edges = [[] for i in xrange(n)]
for i in xrange(n - 1):
x, y = [int(_) - 1 for _ in raw_... |
s021192853 | p03669 | u018679195 | 1594415762 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8872 | 1118 | #include<bits/stdc++.h>
#define N 300050
using namespace std;
int n,h;
struct node{
int a,b,c,d;
}q[N];
int ld[233],lu[233],rd[233],ru[233],ds;
int ind[N],outd[N],fa[N],pd[N];
int getfa(int x){return fa[x]==x?x:fa[x]=getfa(fa[x]);}
int main(){
cin>>n>>h;
for(int i=1;i<=n;++i)
scanf("%d%d%d%d",&q[i].a,&q[i].b,&q[i]... |
s131325479 | p03669 | u089230684 | 1594413675 | Python | Python (3.8.2) | py | Runtime Error | 30 | 8916 | 106 | int aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa
print("YES") |
s956789167 | p03669 | u905506603 | 1539809296 | Python | Python (2.7.6) | py | Runtime Error | 415 | 20604 | 1183 | n, h=map(int, raw_input().split())
jigsaw=[map(int, raw_input().split()) for i in range(n)]
left_excess=[0]*(h+1)
right_excess=[0]*(h+1)
left_to_right=[[] for i in range(h+1)]
right_to_left=[[] for i in range(h+1)]
left_required=[False]*(h+1)
right_required=[False]*(h+1)
for a, b, c, d in jigsaw:
if c:
right_excess[... |
s500597565 | p03669 | u248856154 | 1499655549 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 21500 | 670 | (N, H) = map(int, raw_input().split())
X = []
for i in range(N):
a = map(int, raw_input().split())
X.append(a)
ans = 'YES'
while len(X)>1:
n = len(X)
for i in range(1,n):
if X[i][3] == 0:
for j in range(1,n):
if j != i:
if X[i][1] == x[j][2]:
a = [X[i][0], X[j][1], X[i][2], X[j][3]]
b = X[... |
s995327980 | p03670 | u209843643 | 1515795688 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2568 | 1518 | #include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... |
s541684076 | p03670 | u647718578 | 1513781325 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 1518 | #include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... |
s992863180 | p03670 | u264477471 | 1513780950 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 1518 | #include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... |
s794589770 | p03670 | u264477471 | 1513780892 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2568 | 1518 | #include <bits/stdc++.h>
#define xx first
#define yy second
#define mp make_pair
#define pb push_back
#define mset(x, y) memset(x, y, sizeof x)
#define mcpy(x, y) memcpy(x, y, sizeof x)
using namespace std;
typedef long long LL;
typedef pair <int, int> pii;
inline int Read()
{
int x = 0, f = 1, c = getchar();
for (... |
s887890648 | p03671 | u123579949 | 1601311221 | Python | PyPy3 (7.3.0) | py | Runtime Error | 105 | 68084 | 56 | a,b,c＝map(int,input().split())
print(a+b+c-max(a,b,c)) |
s992002933 | p03671 | u085186789 | 1600660509 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8912 | 77 | a, b, c = map(int, input().split())
min = min{a + b, b + c, c + a}
print(min) |
s816023622 | p03671 | u679817762 | 1600624621 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9112 | 103 | lst = input().split()
for i in range(3):
lst[i] = int(lst[i])
lst.sort()
print(lst[0] + lst[1]) |
s727427496 | p03671 | u628070051 | 1600302469 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8968 | 138 | a, b, c = map(int, input().split())
def answer(a: int, b: int, c: int) -> int:
return min(a + b, a + c, b + c)
print(answer(a, b, c) |
s952519775 | p03671 | u434630332 | 1599883472 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9160 | 70 | a, b, c, d = map(int, input().split())
print(max(a * b, a * c, c * b)) |
s661942966 | p03671 | u904945034 | 1599566106 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8992 | 53 | a,b,c = sroted(map(int,input().split()))
print(a + b) |
s415697830 | p03671 | u347397127 | 1598831816 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9160 | 61 | a,b,c=map(int,input().split())
print(sum([a,b,c]-max(a,b,c))) |
s807124050 | p03671 | u546853743 | 1598447933 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9136 | 61 | a,b,c=map(int,input().split())
x=a+b+c
x-=max[a,b,c]
print(x) |
s146253875 | p03671 | u856775981 | 1598285963 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8980 | 18 | !pip install numpy |
s916919844 | p03671 | u612635771 | 1597786815 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9016 | 54 | a, b, c = sorted(map(int, input().split()))
print(a+b0 |
s513279027 | p03671 | u609814378 | 1597772978 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9204 | 523 | import sys
N = int(input())
A = list(map(int, input().split()))
if N == 1:
print(A[0])
sys.exit()
mae = []
usiro = []
#0の時に前 1の時に後ろ
Flag = 0
for i in reversed(range(0,N,1)):
if Flag == 0: # 前の時
mae.append(str(A[i]))
mae.append(" ")
Flag = 1
else:
usiro.insert(... |
s274254201 | p03671 | u468972478 | 1597713734 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8956 | 60 | p = sorted([map(int, input().split())])
print(p[0] + p[1])
|
s554223025 | p03671 | u670961163 | 1597550994 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9060 | 66 | a, b, c=map(int, input().split())
print(total(a,b,c)-max(a, b, c)) |
s331808768 | p03671 | u739843002 | 1596223242 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9052 | 83 | ary = list(map(lambda n: int(n), input().split(" "))).sort()
print(ary[0] + ary[1]) |
s730724280 | p03671 | u185806788 | 1594784581 | Python | PyPy3 (7.3.0) | py | Runtime Error | 100 | 74716 | 94 | a,b,c=map(int,input().split())
if a+b<=a+c:
print(min(a+b,b+c))
else:
print(min((a+c,b+c)) |
s063334265 | p03671 | u931938233 | 1594764329 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9088 | 62 | a,b,c=map(int,input().pslit(' '))
print(a+b+c-max(a,max(b,c))) |
s729058677 | p03671 | u375616706 | 1594660432 | Python | PyPy3 (7.3.0) | py | Runtime Error | 128 | 74616 | 53 | print(sum(sorted(list(map(int,input().split()))[:2])) |
s323212143 | p03671 | u159335277 | 1594519682 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9028 | 57 | print(sum(sorted(list(map(int, intput().split())))[0:2])) |
s489455633 | p03671 | u917558625 | 1593584600 | Python | Python (3.8.2) | py | Runtime Error | 23 | 9092 | 57 | a=list(map(int,input().split()))
a.sort()
print(a[0]+[1]) |
s485399330 | p03671 | u626228246 | 1592060041 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | a = list(int(input().split()))
print(sorted(a)[-1] + sorted(a)[-2])
|
s257700969 | p03671 | u391442102 | 1591249151 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | A = list(map(int, input().split()))
A = A.sorted()
print(A[0]+A[1]) |
s217669450 | p03671 | u357751375 | 1591243599 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 73 | a,b,c = map(int,input().split())
m = [a + b,a + c,b + c]
print(m(min))
|
s791177646 | p03671 | u611090896 | 1591057178 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | abc=lint(map(int,input().split()))
print(sum(sorted(abc)[:2])) |
s789471189 | p03671 | u138869642 | 1590872977 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 223 | n = int(input())
a = input().split()
a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))
ans = a_even[::-1] + a_odd
if n % 2 != 0:
ans = ans[::-1]
print(' '.join(map(str, ans))) |
s142716473 | p03671 | u138869642 | 1590872900 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 239 | n = int(input())
a = list(map(str, input().split()))
a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))
ans = a_even[::-1] + a_odd
if n % 2 != 0:
ans = ans[::-1]
print(' '.join(map(str, ans))) |
s260869314 | p03671 | u138869642 | 1590872875 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 242 | n = int(input())
a = list(map(string, input().split()))
a_even = list(filter(lambda x: x % 2 == 0, a))
a_odd = list(filter(lambda x: x % 2 != 0, a))
ans = a_even[::-1] + a_odd
if n % 2 != 0:
ans = ans[::-1]
print(' '.join(map(str, ans))) |
s830576766 | p03671 | u480300350 | 1590738872 | Python | PyPy3 (2.4.0) | py | Runtime Error | 166 | 38384 | 5483 | #!/usr/bin/env python3
import sys
# import time
# import math
# import numpy as np
# import scipy.sparse.csgraph as cs # csgraph_from_dense(ndarray, null_value=inf), bellman_ford(G, return_predecessors=True), dijkstra, floyd_warshall
# import random # random, uniform, randint,... |
s673304591 | p03671 | u854992222 | 1589508475 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | a, b, c = map(int(input().split()))
print(sum(a, b, c)-max(a, b, c)) |
s314592575 | p03671 | u857673087 | 1588819696 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a,b,c = sorted(map(int.input().split()))
print(a+b) |
s167309277 | p03671 | u457957084 | 1586727499 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | a,b,c = sort(map(int,input().split()))
print(a+b) |
s022790644 | p03671 | u852790844 | 1586645374 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 160 | from collections import deque
n = int(input())
a = list(map(int,input().split()))
b = deque()
for i in range(n):
b.append(a[i])
b.reverse()
print(*b) |
s420713936 | p03671 | u519721530 | 1586461639 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 68 | a, b, c = map(int, input().split())
print( sum(a,b,c) - max(a,b,c) ) |
s955235150 | p03671 | u320763652 | 1585573167 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 76 | line = list(map(int,intput().split()))
line.sort()
print(line[0] + line[1]) |
s520480013 | p03671 | u320763652 | 1585573105 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | line = map(int, input().split())
line.sort()
print(line[0] + line[1])
|
s905669479 | p03671 | u050641473 | 1585415486 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | bells = sorted(list(map(int,input().split())))
print(bells[0] + bell[1]) |
s187257612 | p03671 | u078349616 | 1585106175 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | a, b, c = map(int, input().split())
print(sum(a, b, c) - max(a, b, c)) |
s735292632 | p03671 | u363836311 | 1584841444 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | a=list(map(int, input().split()))
sort(a)
print(a[0]+a[1]) |
s191550097 | p03671 | u886545507 | 1584474058 | Python | PyPy2 (5.6.0) | py | Runtime Error | 36 | 28524 | 370 | #abc066d
mod=10**9+7
def com(n,r,m):
f=[1,1]
for i in range(2,n+1):
f.append(f[i-1]*i%m)
return f[n]*pow(f[r]*f[n-r]%m,m-2,m)%m
N=int(raw_input())
A=map(int,raw_input().split())
c=[-1]*N
for i in range(N+1):
if c[A[i]-1]!=-1:
break
c[A[i]-1]=i
j=c[A[i]-1]
i=N-i
for k in range(1,N+2):
res=com(N+1,k,mod)
if... |
s998945386 | p03671 | u163874353 | 1584311595 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | l= map(int, input().split())
ans = sum(l) - max(l)
print(ans) |
s032334205 | p03671 | u527993431 | 1584031044 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | L=list(,ap(int,input().split()))
K=sorted(L)
print(L[0]+K[1]) |
s813523380 | p03671 | u137808818 | 1583851349 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | n = list[input().split()]
m = sorted(n)
print(m[0]+m[1]) |
s567035794 | p03671 | u346677493 | 1583685081 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2692 | 122 | a,b,c=map(int,raw_input().split())
if a+b<a+c<b+c:
print a+b
elif b+c<a+b<a+c:
print b+c
elif a+c<b+c<a+b
print a+c
|
s803160814 | p03671 | u346677493 | 1583685034 | Python | Python (2.7.6) | py | Runtime Error | 12 | 2692 | 154 | a,b,c=map(int,raw_input().split())
lowcost=0
if a+b<a+c<b+c:
lowcost= a+b
elif b+c<a+b<a+c:
lowcost= b+c
elif a+c<b+c<a+b
lowcost= a+c
print lowcost |
s229440891 | p03671 | u541610817 | 1583555781 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 60 | a = sorted([int(x) for x in input().split()])
print(sum[:2]) |
s358836450 | p03671 | u037901699 | 1581789795 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 55 | a = map(int, input().split())
a.sort()
print(a[0]+a[1]) |
s466669030 | p03671 | u467831546 | 1581702940 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 191 | a, b, c = map(int, input().split())
if a >= b and a >= c:
print(b + c)
elif b >= a and b >= c:
print(a + c)
elif c >= a and c >= b:
print(a + b)
elif a == b == c:
print(a + b |
s668209770 | p03671 | u467831546 | 1581702688 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 351 | def total_cost(num1, num2, num3):
if num1 >= num2 and num1 >= num3:
return num2 + num3
elif num2 >= num1 and num2 >= num3:
return num1 + num3
elif num3 >= num1 and num3 >= num2:
return num1 + num2
elif num1 == num2 == num3:
return num1 + num2
print(total_cost(int(input()... |
s306375489 | p03671 | u086503932 | 1581466475 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | l = list(map(int,input().split())
print(sum(l)-max(l))
|
s498574384 | p03671 | u686036872 | 1581315280 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | a, b, c = map(int, input().split())
print(sum(a, b, c)-max(a, b, c)) |
s149323164 | p03671 | u686036872 | 1580465577 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | a, b, c = map(int, input().split())
print(sum(a, b, c) - max(a, b, c)) |
s472578123 | p03671 | u162911959 | 1580227729 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 170 | read = sys.stdin.read
readline = sys.stdin.readline
readlines = sys.stdin.readlines
sys.setrecursionlimit(10 ** 7)
a,b,c = sorted(map(int,input().split()))
print (a + b) |
s043023351 | p03671 | u405256066 | 1580188820 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | a,b,c = [map(int,input().split())]
print(min(a+b,b+c,c+a)) |
s578886422 | p03671 | u414458988 | 1579607968 | Python | PyPy3 (2.4.0) | py | Runtime Error | 163 | 38256 | 51 | a=list(input())
a.sort()
print(int(a[0])+int(a[1])) |
s941337882 | p03671 | u414458988 | 1579607917 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38256 | 46 | a=list(int(input()))
a.sort()
print(a[0]+a[1]) |
s216701727 | p03671 | u287880059 | 1579552286 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = map(int,input().split())
print(min(a+b))
|
s838045391 | p03671 | u287880059 | 1579550146 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 48 | a,b,c = map(int,input().split())
print(min(a+b)) |
s906003831 | p03671 | u287880059 | 1579481541 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | a,b,c = sorted(map(in,input().split()))
print(a+b)
|
s034940485 | p03671 | u843722521 | 1579312700 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38384 | 58 | a,b,c = map(int,input(),split())
print(min([a+b,b+c,c+a])) |
s649969041 | p03671 | u863044225 | 1578408576 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a=map(int,input().split())
a.sort()
print(a[0]+a[1]) |
s578599106 | p03671 | u079022116 | 1578290606 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | a=sorted(list(map(int,input().split()))
print(a[0]+a[1]) |
s988347067 | p03671 | u652569315 | 1577985153 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | l=list(map(int,input().split())).sort()
print(l[0]+l[1])
|
s409231833 | p03671 | u047816928 | 1576817111 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | A = map(int, input().split())
print(sum(A)-max(A)) |
s070178986 | p03671 | u897328029 | 1576644887 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 119 | a, b, c = list(map(int, input().split()))
values = sorted(list(set([a, b, c])))
ans = values[0] + values[1]
print(ans)
|
s406139450 | p03671 | u477343425 | 1576631737 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 85 | l = [int(input()) for _ in range(3)]
s = sorted(l)[::-1]
ans = s[0] + s[1]
print(ans) |
s905348257 | p03671 | u113971909 | 1575757592 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a = map(int,input(),split())
print((sorted(a))[0:2]) |
s518447161 | p03671 | u113971909 | 1575757529 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 51 | a = map(int,input(),split())
print((a.sort())[0:2]) |
s889284671 | p03671 | u075155299 | 1575481605 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 58 | s=map(int,input().split())
s.sort()
print((s[0])+(s[1])) |
s936239585 | p03671 | u616188005 | 1574896780 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | prices = list(map(int,input().split()))
prices.sort()
print(price[0]+price[1]) |
s850978688 | p03671 | u616188005 | 1574896740 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 | prices = list(map(int,input().split()))
price.sort()
print(price[0]+price[1]) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.