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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s695798565 | p03587 | u537962130 | 1580402775 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38640 | 24 | print(sum(int(input()))) |
s153950136 | p03587 | u683134447 | 1580082882 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | s = list(input())
ans = 0
for ss in s:
ans += int(s)
print(ans) |
s039040220 | p03587 | u597455618 | 1574591813 | Python | Python (3.4.3) | py | Runtime Error | 22 | 4212 | 154 | def main():
n = int(input())
a = [[]]*n
for i in range(n):
a[i] = list(map(int, input().split()))
a.sort()
print(a[-1][0]+a[-1][1])
main() |
s552359730 | p03587 | u269778596 | 1574477240 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | n = input()
return n.count('1'); |
s912528648 | p03587 | u374802266 | 1570765632 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 25 | print(sum(list(input()))) |
s051846697 | p03587 | u758661720 | 1570054220 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 76 | n = raw_input()
count = 0
for i in n:
if(i=='1'):count+=1;
print(count) |
s484304020 | p03587 | u921773161 | 1569984688 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 27 | print(list(input).count(1)) |
s557887880 | p03587 | u556371693 | 1569683359 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 72 | s=input()
ans=0
for_ in range(6):
if s[_]=='1':
ans+=1
print(ans)
|
s669317471 | p03587 | u556371693 | 1569683341 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | s=input()
ans=0
for_ in range(6):
if s[_]==1:
ans+=1
print(ans) |
s785059544 | p03587 | u085564315 | 1555809858 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | s = input()
print(l)
count = 0
for i in l:
if i == 1:
count = count + 1
print(count)
|
s132820972 | p03587 | u497596438 | 1555786433 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38640 | 578 | from collections import defaultdict
from copy import deepcopy
from math import log
N,K=map(int,input().split())
AB=[0]*N
dic=defaultdict(int)
#n=int(ceil(log(K,2)))+1
for i in range(N):
a,b=map(int,input().split())
if a in dic.keys():
AB[dic[a]]=[a,AB[dic[a]][1]+b]
else:
dic[a]=i
AB[... |
s903142660 | p03587 | u331464808 | 1555709569 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 34 | a = int(input())
print(a.count(1)) |
s345883048 | p03587 | u112318601 | 1555704245 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 30 | S = input()
print(S.count(1)) |
s900649836 | p03587 | u367130284 | 1551177647 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 26 | print(input().scount("1")) |
s688613126 | p03587 | u106297876 | 1542439256 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 275 | N = int(input())
ans = 0
while ans == 0:
for h in range(3500):
h = h + 1
for n in range(3500):
n = n + 1
up = 4*h*n - n*N - N*h
down = N*h*n
if up 0:
if down % up == 0:
w = down // up
ans = 1
break
if ans == 1:
break
print(h, n , w) |
s549187677 | p03587 | u393558821 | 1541515288 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | ans = 0
for i in input():
if i == '1':
ans += 1
print(ans) |
s780043548 | p03587 | u989385104 | 1540777189 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 115 | S = int(input())
lst = []
while i > 0:
lst.append(S%10)
S //= 10 # 必須
lst.reverse()
print(sum(lst))
|
s813196191 | p03587 | u853900545 | 1540679483 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 25 | print(sum(list(input()))) |
s585289547 | p03587 | u940102677 | 1540665154 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | l = list(input())
a = [int(x) for x in l]
prtint(sum(a)) |
s717646036 | p03587 | u845333844 | 1540613759 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | s=input()
count=0
for i in range(s.length):
if s[i]==1:
count+=1
print(count) |
s215342282 | p03587 | u528388170 | 1539908887 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a=int(input())
ans=0
for i in a:
ans+=1
print(ans) |
s059583805 | p03587 | u898651494 | 1536917538 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | s=input()
ans=0
for i range (6):
if int(s[i])==1:
ans+=1
print(ans) |
s242383679 | p03587 | u898651494 | 1536917507 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 71 | s=input()
ans=0
for i range 6:
if int(s[i])==1:
ans+=1
print(ans) |
s580573160 | p03587 | u562016607 | 1523317199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | print(sum([int(list(input())[i]) for i in range(6)])) |
s680340039 | p03587 | u714878632 | 1507381074 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 279 | def main():
n = int(input())
max_a, max_b = 0, 0 # type:int
for _ in range(n):
a, b = input().split(' ')
a = int(a)
if max_a < a:
max_a = a
max_b = int(b)
print(max_a + max_b)
if __name__ == "__main__":
main() |
s568413960 | p03587 | u558720836 | 1506869484 | Python | Python (2.7.6) | py | Runtime Error | 2104 | 2820 | 246 | if __name__ == '__main__':
N = input()
for n in range(1,3501):
for h in range(1,3501):
w = n * h * N / (4 * n * h - N * n - N * h)
if isinstance(w, int) and w > 0:
break
print w, h, n
|
s318561610 | p03587 | u306938754 | 1506867335 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 3064 | 479 | N = input()
N = float(N)
result = 4/N
def output2():
for i in range(3500):
for j in range(3500):
h = float(i+1)
n = float(j+1)
sum_ = 1/h + 1/n
sum2 = result - sum_
if(sum2 <= 0):
continue
... |
s254619508 | p03587 | u352623442 | 1506826761 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1 | a |
s290604942 | p03587 | u780709476 | 1506826004 | Python | Python (3.4.3) | py | Runtime Error | 150 | 5560 | 345 | from fractions import Fraction as F
N = int(input())
left = F(4, N)
for i in range(1, 3500):
if(left > F(1, i)):
h = i
break
for i in range(1, 3500):
if(left > F(1, h) + F(1, i)):
n = i
break
for i in range(1, 3500):
if(left == F(1, h) + F(1, n) + F(1, i)):
w = i
... |
s806023664 | p03587 | u780709476 | 1506825726 | Python | Python (3.4.3) | py | Runtime Error | 34 | 5048 | 332 | from fractions import F
N = int(input())
left = F(4, N)
for i in range(1, 3500):
if(left > F(1, i)):
h = i
break
for i in range(1, 3500):
if(left > F(1, h) + F(1, i)):
n = i
break
for i in range(1, 3500):
if(left > F(1, h) + F(1, n) + F(1, i)):
w = i
break
pri... |
s528323212 | p03587 | u586577600 | 1506825637 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 290 | n = int(input())
a_b = [input() for i in range(n)]
min = 1000000001
max = -1
max_point = 0
for i in a_b:
a, b = map(int, i.split())
if(min > a):
min = a
if(max < a):
max = a
max_point = b
num = 0
num += min
num += max - min
num += max_point
print(num)
|
s902759938 | p03587 | u586577600 | 1506825590 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 290 | n = int(input())
a_b = [input() for i in range(n)]
min = 1000000001
max = -1
max_point = 0
for i in a_b:
a, b = map(int, i.split())
if(min > a):
min = a
if(max < a):
max = a
max_point = b
num = 0
num += min
num += max - min
num += max_point
print(num)
|
s093779160 | p03587 | u214380782 | 1506824807 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | s = input()
count = 0
for x in s:
if x == "1"
count += 1
print(count) |
s724090650 | p03587 | u540307496 | 1506823860 | Python | Python (3.4.3) | py | Runtime Error | 2182 | 1269108 | 542 | N = int(input())
# h,n,w
temp = int((3*N)/4)
hlist = [i+1 for i in range(temp)]
flag = False
for i in hlist:
temp = 4/N - 1/i
if(temp > 0):
nlist = [i+1 for i in range(int(2/temp))]
for j in nlist:
beta = 4/N - 1/i - 1/j
if (beta > 0):
if(1/beta == int(1/b... |
s996443512 | p03587 | u153147777 | 1506822035 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 25 | print(input().conut('1')) |
s915546047 | p03587 | u621091570 | 1506821923 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 147 | N = int(input())
A = []
B = []
for n in range(N):
a, b = list(map(int, input().split()))
A.append(a)
B.append(b)
print(max(A) + min(B)) |
s675841238 | p03587 | u525117558 | 1506820303 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 28 | s=input()
print (s.count(1)) |
s297119889 | p03587 | u772180901 | 1506819789 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 32 | s = input()
print(s.count("1")) |
s087946996 | p03587 | u160414758 | 1506819682 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 29 | S = input()
print(S.count(1)) |
s551892203 | p03587 | u943004959 | 1506819675 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 36 | S = list(input())
print(S.count("1") |
s214130013 | p03587 | u497285470 | 1506819675 | Python | Python (3.4.3) | py | Runtime Error | 26 | 3060 | 48 | inputs = input().split
print(inputs.count('1')) |
s018896396 | p03588 | u374802266 | 1600520451 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8860 | 112 | n=int(input())
ans=10**100
for i in range(n)
t=sum(list(map(int,input().split())))
ans=min(ans,t)
print(ans) |
s012509282 | p03588 | u374802266 | 1600520376 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8624 | 106 | n=int(input())
ans=10*100
for i in range(n)
ans=min(ans,sum(list(map(int,input().split()))))
print(ans)
|
s693491280 | p03588 | u374802266 | 1600520336 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8832 | 99 | n=int(input())
ans=10*100
for i in range(n)
ans=min(ans,sum(map(int,input().split())))
print(ans) |
s230230310 | p03588 | u374802266 | 1600520250 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9588 | 75 | print(min([int(input()) for _ in [0]*int(input())],key=lambda x:x[0]+x[1])) |
s206085460 | p03588 | u972474792 | 1598154674 | Python | PyPy3 (7.3.0) | py | Runtime Error | 250 | 89980 | 198 | N=int(input())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
a=AB[0][1]
for i in range(N-1):
if AB[i+1][1]<AB[i][1]:
a=AB[i+1][1]
b=i+1
print(a+AB[b][0]) |
s447597164 | p03588 | u972474792 | 1598154647 | Python | Python (3.8.2) | py | Runtime Error | 262 | 27124 | 198 | N=int(input())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
a=AB[0][1]
for i in range(N-1):
if AB[i+1][1]<AB[i][1]:
a=AB[i+1][1]
b=i+1
print(a+AB[b][0]) |
s112929655 | p03588 | u972474792 | 1598153768 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 28952 | 276 | N=int(input())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
A=[]
B=[]
for i in range(N):
A.append(AB[i][0])
B.append(AB[i][1])
for i in range(N):
if B[i]==max(B):
bmax=i
elif B[i]==min(B):
bmin=i
print(A[bmin]+B[bmin]) |
s254229597 | p03588 | u972474792 | 1598153587 | Python | PyPy3 (7.3.0) | py | Runtime Error | 2208 | 97476 | 276 | N=int(input())
AB=[]
for i in range(N):
AB.append(list(map(int,input().split())))
A=[]
B=[]
for i in range(N):
A.append(AB[i][0])
B.append(AB[i][1])
for i in range(N):
if B[i]==max(B):
bmax=i
elif B[i]==min(B):
bmin=i
print(A[bmin]+B[bmin]) |
s696184058 | p03588 | u125269142 | 1598143696 | Python | Python (3.8.2) | py | Runtime Error | 219 | 17596 | 323 | n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int, input().split())
a_list.append(a)
b_list.append(b)
maximum = 0
for i in a_list:
if maximum < i:
maximum = i
index = a_list.index(maximum)
score = b_list[index]
max = maximum + score
ans_list = [0]*max
print(len(ans_lis... |
s860429375 | p03588 | u125269142 | 1598143646 | Python | PyPy3 (7.3.0) | py | Runtime Error | 321 | 86152 | 331 | n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int, input().split())
a_list.append(a)
b_list.append(b)
maximum = 0
for i in a_list:
if maximum < i:
maximum = i
index = a_list.index(maximum)
score = b_list[index]
maximum = maximum + score
ans_list = [0]*maximum
print(len... |
s403497541 | p03588 | u125269142 | 1598143616 | Python | PyPy3 (7.3.0) | py | Runtime Error | 292 | 82660 | 323 | n = int(input())
a_list = []
b_list = []
for _ in range(n):
a, b = map(int, input().split())
a_list.append(a)
b_list.append(b)
maximum = 0
for i in a_list:
if maximum < i:
maximum = i
index = a_list.index(maximum)
score = b_list[index]
max = maximum + score
ans_list = [0]*max
print(len(ans_lis... |
s900215792 | p03588 | u503111914 | 1596225143 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9156 | 162 | N = int(input())
M = 0
m = 10**9
c = 0
for i in range(N):
a,b = map(int.input().split())
if m >= a:
m = a
if M < a:
M = a
c = b + 1
print(c+m-M) |
s667451603 | p03588 | u617380180 | 1595648721 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8980 | 1525 | #include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
#include <cmath>
#include <vector>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <queue>
#include <ctime>
#include <cassert>
#include <complex>
#include <string>
#include <cstring>
#include <chrono>
... |
s388455974 | p03588 | u086503932 | 1593832634 | Python | Python (3.8.2) | py | Runtime Error | 186 | 17168 | 351 | #!/usr/bin/env python3
from collections import deque, Counter
from heapq import heappop, heappush
from bisect import bisect_right
def main():
N = int(input())
A = [None] * N
B = [None] * N
for i in range(N):
A[i], B[i] = map(int, input().split())
print(max(A[i])+B.index(max(A[i])))
if __na... |
s327562965 | p03588 | u851704997 | 1589378431 | Python | Python (3.4.3) | py | Runtime Error | 301 | 3064 | 435 | N = int(input())
if(N == 1):
A1,B1 = map(int,input().split())
print(str(A1+B1))
for i in range(N-1):
if(i == 0):
A1,B1 = map(int,input().split())
A2,B2 = map(int,input().split())
if(A1 <= A2):
MA = A2
MB = B2
else:
MA = A1
MB = B1
A1 = A2
B1 = B2
else:
A2,B2 =... |
s523650187 | p03588 | u652656291 | 1588876917 | Python | Python (3.4.3) | py | Runtime Error | 362 | 50420 | 195 | n = int(input())
A = [map(int,input().split()) for _ in range(n)]
A.sort(key=lambda x: x[0])
most = A[0][0]
mos = A[0][1]
worst = A[-1][0]
wors = A[-1][1]
print((most-1)+(most-worst+1)+(wors+1))
|
s473539584 | p03588 | u652656291 | 1588876821 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 200 | n = int(input())
A = [a,b = map(int,input().split()) for _ in range(n)]
A.sort(key=lambda x: x[0])
most = A[0][0]
mos = A[0][1]
worst = A[-1][0]
wors = A[-1][1]
print((most-1)+(most-worst+1)+(wors+1)) |
s313202408 | p03588 | u414458988 | 1585698288 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38256 | 90 | n=int(input())
a=sorted(list(map(int,input().split())) for _ in range(n))
print(sum(a[-1]) |
s639188058 | p03588 | u957872856 | 1584929878 | Python | Python (3.4.3) | py | Runtime Error | 303 | 11044 | 132 | n = int(input())
A = []
B = []
for i in range(n):
a, b = map(int,input().split())
A.append(a)
B.append(b)
print(max(a)+min(b)) |
s776830258 | p03588 | u600402037 | 1584014315 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 265 | #include <bits/stdc++.h>
using namespace std;
int main() {
int N;
cin >> N;
int A_max = 0;
int last_B = 0;
for (int i = 0; i < N; i++) {
int a, b = 0;
cin >> a >> b;
if (a > A_max) {
A_max = a;
last_B = b;
}
}
cout << A_max + last_B << endl;
} |
s936794560 | p03588 | u547448704 | 1579971058 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 841 | #include <iostream>
#include <cstdio>
#include <algorithm>
#include <string>
#include <stack>
#include <queue>
#include <vector>
#include <list>
#include <set>
#include <map>
#include <cmath>
using namespace std;
#define PI 3.1415926535897932384626433832795
#define MOD (1000000007)
#define EPS (1e-15)
#define rep(i, n... |
s629446097 | p03588 | u742529680 | 1578198673 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 140 | N = int(input())
maxi = -1
sc = 0
for i in range(N):
A, B = map(int, input().split())
if A > mini:
mini = A
sc = B
print(mini + sc)
|
s649770260 | p03588 | u794173881 | 1575323171 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 181 | from operator import itemgetter
n = int(input())
info = [list(map(int, input().split())) for i in range(n)]
info = sorted(info, key = itemgetter(1))
print(info[0][0] + info[0][]) |
s334647254 | p03588 | u379629675 | 1571339843 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 93 | n=int(input())
a=[list(map(int,input().split())) for i in range(N)]
a.sort()
print(sum(a[0])) |
s705467731 | p03588 | u077291787 | 1568806910 | Python | Python (3.4.3) | py | Runtime Error | 67 | 25812 | 231 | # tenka1-2017-beginnerB - Different Distribution
def main():
N, *AB = map(int, open(0).read().split())
A = [sum(i, j) for i, j in zip(*[iter(AB)] * 2)]
ans = max(A)
print(ans)
if __name__ == "__main__":
main() |
s407643242 | p03588 | u077291787 | 1568806886 | Python | Python (3.4.3) | py | Runtime Error | 64 | 25812 | 232 | # tenka1-2017-beginnerB - Different Distribution
def main():
N, *AB = map(int, open(0).read().split())
A = [sum(i, j) for i, j in zip(*[iter(AB)] * 2)]
ans == max(A)
print(ans)
if __name__ == "__main__":
main() |
s794332190 | p03588 | u787456042 | 1567919453 | Python | Python (3.4.3) | py | Runtime Error | 84 | 25812 | 106 | N,*A=map(int,open(0).read().split())
i=2*sorted(enumerate(A[::2]),lambda x:x[1])[-1][0]
print(A[i]+A[i+1]) |
s488071850 | p03588 | u085564315 | 1555814358 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 269 | maxx = 0
maxxx = 0
count = 0
x=[]
y=[]
s = input()
for i in range(s):
x1,y1=[int(i) for i in input().split()]
x.append(x1)
y.append(y1)
for item in x:
if maxx < item:
maxx = item
maxxx = y[count]
count = count + 1
print(maxx +maxxx)
|
s133377074 | p03588 | u085564315 | 1555814290 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 269 | maxx = 0
maxxx = 0
count = 0
x=[]
y=[]
s = input()
for i in range(s):
x1,y1=[int(i) for i in input().split()]
x.append(x1)
y.append(y1)
for item in x:
if maxx < item:
maxx = item
maxxx = y[count]
count = count + 1
print(maxx +maxxx)
|
s420745131 | p03588 | u085564315 | 1555814273 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 269 | maxx = 0
maxxx = 0
count = 0
x=[]
y=[]
s = input()
for i in range(s):
x1,y1=[int(i) for i in input().split()]
x.append(x1)
y.append(y1)
for item in x:
if maxx < item:
maxx = item
maxxx = y[count]
count = count + 1
print(maxx +maxxx)
|
s495420264 | p03588 | u085564315 | 1555813246 | Python | Python (3.4.3) | py | Runtime Error | 312 | 17892 | 225 | s = int(input())
z = {}
maxx = 0
maxxx = 0
for i in range(s):
x1,y1=[int(i) for i in input().split()]
z[x1]=y1
for key,value in z.items():
if maxx < key:
maxx = item
maxxx = key
print(maxx +maxxx)
|
s998280602 | p03588 | u085564315 | 1555813172 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 227 | s = int(input())
z = {}
maxx = 0
maxxx = 0
for i in range(s):
x1,y1=[int(i) for i in input().split()]
z.[x1]=y1
for key, value in z.items():
if maxx < key:
maxx = item
maxxx = key
print(maxx +maxxx)
|
s408533940 | p03588 | u085564315 | 1555812845 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 185 | s = int(input())
z = {}
maxx = 0
for i in range(s):
x1,y1=[int(i) for i in input().split()]
x.append(x1)
for item in x:
if maxx < item:
maxx = item
print(maxx +2)
|
s692361461 | p03588 | u085564315 | 1555812386 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 222 | z = {}
maxxx = 0
count = 0
county = 0
for i in range(s):
x1,y1=[int(i) for i in input().split()]
z[x1] = y1
for key,value in z.items():
if maxxx < key:
maxxx = key
county = value
print(maxxx+2)
|
s245623376 | p03588 | u513900925 | 1555730529 | Python | Python (3.4.3) | py | Runtime Error | 315 | 21168 | 224 | N = int(input())
e = [[int(i) for i in input().split()] for i in range(N)]
mar=e[0][0]
mir=e[0][0]
mav=0
miv=0
mv=0
mmv=e[i][1]
for i in range(N):
if e[i][0] > mar:
mar =e[i][0]
mmv=e[i][1]
print(mar+mmv) |
s215320538 | p03588 | u813102292 | 1555538358 | Python | Python (3.4.3) | py | Runtime Error | 312 | 11056 | 194 | n = int(input())
a,b = [],[]
for i in range(n):
ta,tb = map(int, input().split())
a.append(ta)
b.append(tb)
mai = a[b.index(max(b))]
mii = a[index(min(b))]
print(mii+(min(b))+mai-1)
|
s377057144 | p03588 | u813102292 | 1555538288 | Python | Python (3.4.3) | py | Runtime Error | 306 | 11052 | 190 | n = int(input())
a,b = [],[]
for i in range(n):
ta,tb = map(int, input().split())
a.append(ta)
b.append(tb)
mai = a.index(max(b))
mii = a.index(min(b))
print(mii+(min(b))+mai-1)
|
s930571961 | p03588 | u013756322 | 1553738479 | Python | Python (3.4.3) | py | Runtime Error | 351 | 10996 | 153 | n = int(input())
A = [None] * n
B = [None] * n
for i in range(n):
A[i], B[i] = list(map(int, input().split()))
print(A[B.index(min_point)] + min(B)) |
s144340564 | p03588 | u543954314 | 1552242872 | Python | Python (3.4.3) | py | Runtime Error | 470 | 29092 | 121 | n = int(input())
l = [list(map(int, input().split())) for _ in range(n)]
l.sort(key=lambda x:x[1])
print(x[0][0]+x[0][1]) |
s230988752 | p03588 | u218842729 | 1551839956 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 837 | #include <bits/stdc++.h>
typedef long long ll;
#define rep(i,m,n) for(ll i = (m); i < (n); i++)
#define rrep(i,m,n) for(ll i = (m); i >= (n); i--)
#define print(x) cout << (x) << endl;
#define print2(x,y) cout << (x) << " " << (y) << endl;
#define printa(x,n) for(ll i = 0; i < n; i++){ cout << (x[i]) << " \n"[i == n-1]... |
s756919519 | p03588 | u367130284 | 1551433135 | Python | Python (3.4.3) | py | Runtime Error | 29 | 2940 | 140 | #n,*a=map(int,open(0).read().split())
b=[a[i]for i in range(0,len(a),2)]
c=[a[i]for i in range(1,len(a),2)]
print(max(b)+c[b.index(max(b))]) |
s374168381 | p03588 | u367130284 | 1551432702 | Python | Python (3.4.3) | py | Runtime Error | 85 | 25940 | 143 | n,*a=map(int,open(0).read().split())
b=[a[i]for i in range(0,len(a),2)]
c=[a[i]for i in range(1,len(a),2)]
print(max(b)+c[c.index(max(b))*2+1]) |
s088928899 | p03588 | u367130284 | 1551431675 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 94 | n,*a=map(int,read(0).split())
b=max([a[i]for i in range(0,len(a),2)])
print(b+a[a.index(b)+1]) |
s050338782 | p03588 | u359856428 | 1548254392 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 138 |
n = int(input())
temp = 0
ans = 0
for i in range(n):
a,b = map(int,input().split(' '))
if a > temp:
ans = a + b
print ans |
s112416359 | p03588 | u393558821 | 1541515301 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 190 | maxx = 2**29
ans = 0
for _ in range(int(input())):
a, b = map(int, input().split(' '))
if b < maxx:
maxx = b
ans = a
print(ans + maxx) |
s091933708 | p03588 | u989385104 | 1540778823 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 162 | N = int(input())
grid = []
for i in range(N):
array = list(map(int, input().strip().split(' ')))
grid.append(array)
print (max(grid[0]) + min(grid[1]) |
s527290788 | p03588 | u853900545 | 1540684101 | Python | Python (3.4.3) | py | Runtime Error | 301 | 10996 | 111 | n=int(input())
a=[0]*n
b=[0]*n
for i in range(n):
a[i],b[i]=map(int,input().split())
y=max(a)
print(y+b[y]) |
s101845030 | p03588 | u433780933 | 1539902214 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 189 | n = int(input())
a =0
b =0
for i in range(n):
nums = [int(num) for num in input().split]
aa = nums[0]
bb = nums[1]
if aa > a:
a = aa
b = bb
print(a + b)
|
s249199241 | p03588 | u107077660 | 1523929366 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | N = int(input())
print(min([sum(list(map(int,input().split()))) for j in range(N)]) |
s212572428 | p03588 | u107077660 | 1523929166 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 64 | N = int(input())
print(min(sum(list(map(int,input().split()))))) |
s044695582 | p03588 | u107077660 | 1523929138 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 59 | N = int(input())
print(min(sum(*map(int,input().split())))) |
s381272414 | p03588 | u107077660 | 1523929074 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 58 | N = int(input())
print(min(sum(map(int,input().split())))) |
s570896260 | p03588 | u340781749 | 1514000852 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 105 | from operator import add
n=int(input())
print(min(map(add, map(int, input().split())) for _ in range(n))) |
s864276195 | p03588 | u714878632 | 1507352133 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 224 | def main():
n = int(input())
ab:[[int]] = []
for i in range(n):
ab.append([int(x) for x in input().split()])
a, b = max(ab, key=lambda x: x[0])
print(a + b)
if __name__ == "__main__":
main() |
s276997419 | p03588 | u098968285 | 1506983546 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 160 | n = int(input())
maxm = 0
num = -1
for i in range():
a, b = map(int, input().split())
if a > maxm:
maxm = a
num = b
print(maxm + num) |
s064965551 | p03588 | u895409580 | 1506820886 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 241 | #!user/bin/env python
# coding:utf-8
n = int(input())
info = []
for i in range(n):
ai = int(input())
bi = int(input())
info.append([ai, bi])
info = sorted(info, key=lambda inf: inf[1])
imp = info[0][0] + info[0][1]
print(imp) |
s753418336 | p03588 | u451017206 | 1506820689 | Python | Python (3.4.3) | py | Runtime Error | 297 | 3060 | 243 | N = int(input())
mn = 10**9 + 1
mx = 0
mnj = None
mxj = None
for i in range(N):
Ai,Bi = map(int, input().split())
if mn > Bi:
mn = Bi
mnj = Ai
if mx < Bi:
mx = Bi
mxj = Ai
print(mxj + mnj - mxj + mn) |
s218513276 | p03588 | u026537738 | 1506820411 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 199 | N = int(input())
ab = []
for i in range(N):
ab.append(tuple(map(int,input.split())))
ans = N
mx = max(ab,key=lambda x:x[1])[0]
ans += mx - 1
mn = min(ab,key=lambda x:x[1])[1]
ans += mn
print(ans) |
s563244150 | p03588 | u026537738 | 1506820340 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 192 | N = int(input())
ab = []
for i in N:
ab.append(tuple(map(int,input.split())))
ans = N
mx = max(ab,key=lambda x:x[1])[0]
ans += mx - 1
mn = min(ab,key=lambda x:x[1])[1]
ans += mn
print(ans) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.