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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s391192891 | p03619 | u556812955 | 1503803710 | Python | PyPy3 (2.4.0) | py | Runtime Error | 978 | 68904 | 1097 | from sys import stdin
from math import pi
# 그냥 가면 100(|x1 - x2| + |y1 - y2|)
# junction 통과할 때마다 답이 좋아짐. 이 개수를 늘려야?
C = 100
J = -20 + pi * 2*10/4
x1, y1, x2, y2 = map(int, stdin.readline().split())
N = int(stdin.readline())
x = [0] * N
y = [0] * N
for i in range(N):
x[i], y[i] = map(int, stdin.readline().split())
... |
s320323083 | p03619 | u382748202 | 1503803231 | Python | Python (3.4.3) | py | Runtime Error | 2154 | 1564828 | 1556 | import math
def step(cur_y, cur_idx, S, dp, end_y):
for idx, (x, y) in enumerate(S[cur_idx:], cur_idx):
if cur_y <= y and dp[y] < dp[cur_y] + 1:
dp[y] = dp[cur_y] + 1
step(y, idx + 1, S, dp, end_y)
x_1, y_1, x_2, y_2 = map(int, input().split())
N = int(input())
if x_1 <= x_2:
... |
s182145969 | p03619 | u177721681 | 1503802928 | Python | Python (2.7.6) | py | Runtime Error | 2110 | 42984 | 2068 | import sys
import math
def link( pool, f):
def subset( a, b):
return a[0] > b[0] and a[1] > b[0]
notsubset = []
max_value = 0
for n,p in enumerate(pool): ##(X, Y, V)
if subset(p[:2], f):
max_value = max(max_value, p[2])
else:
notsubset.append(n)
new_po... |
s589305175 | p03619 | u340781749 | 1503801484 | Python | Python (3.4.3) | py | Runtime Error | 2108 | 97164 | 1568 | from math import pi
def solve():
x1, y1, x2, y2 = map(int, input().split())
if x1 > x2:
x1, y1, x2, y2 = x2, y2, x1, y1
is_down = y1 > y2
if is_down:
y1, y2 = -y1, -y2
n = int(input())
fountains = []
for _ in range(n):
x, y = map(int, input().split())
if is... |
s987382807 | p03619 | u340781749 | 1503801205 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1562 | from math import pi
def solve():
x1, y1, x2, y2 = map(int, input().split())
if x1 > x2:
x1, y1, x2, y2 = x2, y2, x1, y1
is_down = y1 > y2
if is_down:
y1, y2 = -y1, -y2
n = int(input())
fountains = []
for _ in range(n):
x, y = map(int, input().split())
if is... |
s768380379 | p03619 | u637175065 | 1503800875 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1471 | 124120 | 2305 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def L... |
s156294572 | p03619 | u637175065 | 1503800811 | Python | Python (3.4.3) | py | Runtime Error | 2106 | 48056 | 2305 | import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools
sys.setrecursionlimit(10**7)
inf = 10**20
gosa = 1.0 / 10**10
mod = 998244353
def LI(): return [int(x) for x in sys.stdin.readline().split()]
def LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]
def L... |
s525650712 | p03619 | u945080461 | 1503798270 | Python | Python (2.7.6) | py | Runtime Error | 666 | 44788 | 2076 | from sys import stdin
from math import pi
from bisect import bisect
from itertools import repeat
def main():
x1, y1, x2, y2 = map(int, stdin.readline().split())
sx = 1
if x1 > x2:
x1, x2 = -x1, -x2
sx = -1
sy = 1
if y1 > y2:
y1, y2 = -y1, -y2
sy = -1
n = int(stdin... |
s847370520 | p03620 | u366541443 | 1590078005 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1823 | 122324 | 4420 | import math
import fractions
#import sys
#input = sys.stdin.readline
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def Valu... |
s477440319 | p03620 | u366541443 | 1590077893 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1863 | 122580 | 4386 | import math
import fractions
#import sys
#input = sys.stdin.readline
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def Valu... |
s277666028 | p03620 | u366541443 | 1590077778 | Python | PyPy3 (2.4.0) | py | Runtime Error | 1906 | 122452 | 4387 | import math
import fractions
#import sys
#input = sys.stdin.readline
def make_divisors(n):
divisors = []
for i in range(1, int(n**0.5)+1):
if n % i == 0:
divisors.append(i)
if i != n // i:
divisors.append(n//i)
# divisors.sort()
return divisors
def Valu... |
s740335457 | p03621 | u675317308 | 1534460537 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 2458 | #include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<vector>
using namespace std;
#define Whats(x) cout<<#x<<" is "<<x<<endl
#define Divhe() cout<<"<<<<<<<<<<<<<<"<<endl
#define Divshe() cout<<">>>>>>>>>>>>>>>"<<endl
#define Oops() cout<<"!!!!!!!!!!!!!!"<<endl
#define Poly vector<int>
... |
s090916420 | p03622 | u969708690 | 1598371889 | Python | Python (3.8.2) | py | Runtime Error | 2232 | 817844 | 752 | import math
import sys
from functools import lru_cache
mod=998244353
sys.setrecursionlimit(1000000)
@lru_cache(maxsize=1000000)
def ans(p,q,wa):
if p<q:
p,q=q,p
if q==0:
return wa+p
else:
return (ans(p-1,q,wa+1)+ans(p,q-1,wa))%mod
def cmb(n, r, mod):
if ( r<0 or r>n ):
return 0
r = min... |
s734671580 | p03622 | u969708690 | 1598362214 | Python | Python (3.8.2) | py | Runtime Error | 2223 | 562296 | 362 | import math
import sys
from functools import lru_cache
sys.setrecursionlimit(1000000)
@lru_cache(maxsize=1000)
def ans(a,b,p,q,wa):
if p<q:
p,q=q,p
if q==0:
return a*(wa+p)*pow(b,-1,mod)%mod
else:
return (ans(a*p%mod,b*(p+q)%mod,p-1,q,wa+1)+ans(a*q%mod,b*(p+q)%mod,p,q-1,wa))%mod
mod=998244353
N,M=map(... |
s377623940 | p03622 | u969708690 | 1598322340 | Python | Python (3.8.2) | py | Runtime Error | 2206 | 14188 | 391 | import math
def tasizan(a,b,c,d):
return a*d+b*c,b*d
mod=998244353
#N=M
N,M=map(int,input().split())
def ans(a,b,p,q,wa):
if p<q:
p,q=q,p
if q==0:
return a*(wa+p),b
else:
s,t=ans(a*p,b*(p+q),p-1,q,wa+1)
c,d=ans(a*q,b*(p+q),p,q-1,wa)
return tasizan(s,t,c,d)
a,b=ans(1,1,N,M,0)
p=math.gcd(a,b)
... |
s955761820 | p03622 | u168578024 | 1596762001 | Python | Python (3.8.2) | py | Runtime Error | 32 | 9004 | 236 | M=8**7
m,f,g,i=M*476+1,[j:=1],[k:=1]*M,0
while i<M:i+=1;f+=f[-1]*i%m,
g+=pow(f[-1],m-2,m),
while i:g[i-1]=g[i]*i%m;i-=1
A,B=map(int,input().split())
if A<B:A,B=B,A
while j<=B:i+=k*f[A+B-j]*g[B-j];k=k*2%m;j+=1
print((i*f[B]*g[A+B]+A)%m)) |
s371677826 | p03622 | u076936237 | 1503803608 | Python | Python (3.4.3) | py | Runtime Error | 2105 | 17300 | 650 | import sys
from fractions import Fraction
import json
sys.setrecursionlimit(10000)
memo = {}
def e(m, n):
if m < n:
m, n = n, m
if (m,n) in memo:
return memo[(m,n)]
if m == 0:
return n
if n == 0:
return m
if m == n:
memo[(m,n)] = e(m-1, n)+Fraction(1,2)
... |
s958582010 | p03622 | u844771757 | 1503803318 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 5956 | 409 | from fractions import *
def E(n,m):
if not m:return Fraction(n,1)
if(n<m):return E(m,n)
return Fraction(n*E(n-1,m)+m*E(n,m-1)+max(n,m),n+m)
def sqr_mod(a,m):return a*a%m
def pow_mod(a,n,m):
if not n:return 1
if n%2:return sqr_mod(pow_mod(a,n>>1,m),m)*a%m
return sqr_mod(pow_mod(a,n>>1,m),m)
n,m=map(int,input()... |
s545745295 | p03622 | u076936237 | 1503803304 | Python | Python (3.4.3) | py | Runtime Error | 2104 | 12560 | 598 | from fractions import Fraction
memo = {}
def e(m, n):
if m < n:
m, n = n, m
if (m,n) in memo:
return memo[(m,n)]
if m == 0:
return n
if n == 0:
return m
if m == n:
memo[(m,n)] = e(m-1, n)+Fraction(1,2)
else:
memo[(m,n)] = (e(m-1, n)+1)*Fractio... |
s279144084 | p03623 | u630211216 | 1599941471 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 89 | x,a,b=map(int,input().split())
if abs(x-a)<abs(x-b):
pirnt('A')
else:
print('B')
|
s269742733 | p03623 | u886902015 | 1599848732 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8940 | 60 | x,a,b=map(int,input().split())
print(min(abs(x-a),abs(x-b))
|
s329727559 | p03623 | u010777300 | 1599258563 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8932 | 102 | x, a, b = map(int, input.split())
print("A" if max(x, a) - min(x, a) < max(x, b) - min(x, b) else "B") |
s933575518 | p03623 | u835575472 | 1598647216 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9032 | 76 | x, a, b = map(int, input().split())
print((abs(x-a) > abs(x-b)) ? "A" : "B") |
s856775093 | p03623 | u477696265 | 1598403545 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8916 | 217 | a,b,c=(int(x) for x in input().split())
if a < b < c:
print( 'A' )
elif a < c < b:
print( 'A' )
elif b < a < c:
print( 'B' )
elif b < c < a:
print( 'B' )
elif c < a < b:
print( 'C' )
elif c < b < a |
s569255181 | p03623 | u477696265 | 1598403530 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8888 | 217 | a,b,c=(int(x) for x in input().split())
if a < b < c:
print( 'A' )
elif a < c < b:
print( 'A' )
elif b < a < c:
print( 'B' )
elif b < c < a:
print( 'B' )
elif c < a < b:
print( 'C' )
elif c < b < a |
s839189587 | p03623 | u612975321 | 1598216562 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9060 | 84 | x, a, b = map(int,input().split())
print('A') if abs(x-a) < abs(s-b) else print('B') |
s520962794 | p03623 | u692453235 | 1596928671 | Python | Python (3.8.2) | py | Runtime Error | 22 | 8924 | 66 | X, A, B = map(int, input().split())
print(min(abs(X-A), abs(B-X)) |
s582986548 | p03623 | u243159381 | 1596425001 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9100 | 89 | x,a,c=map(int,input().split())
if abs(x-a)<=abs(x-b):
print('A')
else:
print('B') |
s808219439 | p03623 | u243159381 | 1596424919 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9144 | 110 | import math
x,a,c=map(int,input().split())
if math.abs(x-a)<math.abs(x-b):
print('A')
else:
print('B') |
s107308551 | p03623 | u243159381 | 1596424803 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9056 | 112 | import math
x,a,c=map(int,input().split())
if math.fabs(x-a)<math.fabs(x-b):
print('A')
else:
print('B') |
s730769097 | p03623 | u313043608 | 1594228395 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9104 | 84 | x,a,b=map(int,input().split())
if abs(a-x)>abc(b-x):
print('A')
else:
print('B') |
s667755645 | p03623 | u706414019 | 1594168131 | Python | Python (3.8.2) | py | Runtime Error | 20 | 9156 | 99 | import sys
input = sys.stdin.readline
int(input())
list(map(int,input().split()))
input().rstrip() |
s313256073 | p03623 | u285891772 | 1593737930 | Python | Python (3.8.2) | py | Runtime Error | 37 | 10396 | 1250 | import sys, re
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, tan, asin, acos, atan, radians, degrees, log2, gcd
from itertools import accumulate, permutations, combinations, combinations_with_replacement, product, groupby
from operator import itemgetter... |
s504775276 | p03623 | u994101538 | 1593502781 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9112 | 287 | n=int(input())
a=list(map(int,input().split(' ')))
x=0
y=0
a.sort()
a.reverse()
for i in range(len(a)-1):
if a[i]==a[i+1]:
x=a[i]
p=i+1
break
if x!=0:
for i in range((p+1),len(a)-1):
if a[i]==a[i+1]:
y=a[i]
break
print(x*y) |
s315979367 | p03623 | u917558625 | 1593231045 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9020 | 80 | x,a,b=map(int,input().split())
if abs(a-x)>abs(b-x):
print(B)
else:
print(A) |
s540906074 | p03623 | u827202523 | 1593142222 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 68788 | 127 | getList = lambda: list(map(int, input().split()))
a,b,x = getList()
if abs(a - x) < abs(b = x):
print("A")
else:
print("B") |
s539877538 | p03623 | u742960659 | 1593133377 | Python | Python (3.8.2) | py | Runtime Error | 19 | 8944 | 546 | using System;
using System.Collections.Generic;
using System.Linq;
using System.Text;
using static System.Math;
namespace ConsoleApp15
{
class Class404
{
static void Main()
{
var r = Console.ReadLine().Split().Select(int.Parse).ToArray();
int a = Abs(r[0] - r[1]);
... |
s399977552 | p03623 | u253011685 | 1592710848 | Python | PyPy3 (7.3.0) | py | Runtime Error | 83 | 68680 | 213 | n=int(input())
A=list(map(int,input().split()))
rec=set()
for i in range(n):
if A.count(A[i])>=2:
rec.add(A[i])
if len(rec)<2:
print(0)
else:
rec=sorted(list(rec), reverse=True)
print(rec[0]*rec[1]) |
s192489599 | p03623 | u860546679 | 1592670716 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8876 | 59 | x,a,b=map(int,input().split())
print(min(abs(x-a),abs(x-b)) |
s137468807 | p03623 | u278379520 | 1592611658 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9024 | 113 | x,a,b=map(int,input().split())
y=abs(x-a)
z=abs(b-x)
if y<z:
print('A')
else:
print('B')
|
s990630273 | p03623 | u278379520 | 1592611366 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9012 | 105 | x,a,b=map(int,input().split())
if abs(x-a)<abs(b-x):
print('A')
else:
print('B')
|
s913872478 | p03623 | u061361273 | 1592607075 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9016 | 140 | def dis():
x = int(input())
a = int(input())
b = int(input())
if abs(x-a)>abs(x-b):
print("B")
else:
print("A")
dis() |
s317093998 | p03623 | u228223940 | 1592358992 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | x,a,b = map(int.input().split())
if abs(x-a) > abs(x-b):
print('B')
else:
print('A') |
s959866256 | p03623 | u629540524 | 1590693051 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | a, b, c = map(int, input().split())
if abs(x - a) > abs(x - b):
print('B')
else:
print('A') |
s665945150 | p03623 | u629540524 | 1590692679 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | a, b, c = map(int, input().split())
if abs(x - a) > abs(x - b):
print('B')
else:
print('A') |
s611520602 | p03623 | u834248129 | 1590265631 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | x,a,b = map(int, input().split())
if abs(x-a) > abs(x-b):
print(B)
else:
print(A) |
s472145104 | p03623 | u760636024 | 1589428796 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 68688 | 270 | n = int(input())
A = sorted(list(map(int, input().split())), reverse = True)
l = 0
ln = []
for a in A:
if l == a:
ln.append(a)
l = 0
else:
l = a
if len(ln) == 2:
break
if len(ln) == 2:
print(ln[0]*ln[1])
else:
print(0) |
s784245939 | p03623 | u027403702 | 1589234386 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | x,a,b = map(int,input())
if abs(a-x) > abs(b-x):
print("B")
else:
print("A") |
s761323994 | p03623 | u027403702 | 1589234331 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 84 | x,a,b = map(int,input())
if abs(a-x) > abs(b-x):
print("A")
else:
print("B") |
s861271243 | p03623 | u947327691 | 1588815115 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | x,a,b=map(int,input().split())
ad=abs(x-a)
bd=abs(x-b)
if ad > bd:
print("A")
elif ad < bd
print("B") |
s173988024 | p03623 | u263830634 | 1588696199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 107 | X, A, B = map(int, input().split())
if min(abs(X - A) < abs(X - B)):
print ('A')
else:
print ('B') |
s730675645 | p03623 | u115877451 | 1588444477 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | a,b,c=map(int,input().split())
if abs(a-b)<abs(a-c):
prinnt('A')
else:
print('B') |
s092646790 | p03623 | u681323954 | 1588119383 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 126 | x,a,b = map(int, input().split())
A = max(x,a) - min(x,a)
B = max(x,b - min(x,b)
if A > B:
print("B")
else:
print("A") |
s627277800 | p03623 | u227085629 | 1587745792 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | x,a,b = map(int, input().split)
if abs(a-x) < abs(b-x):
print('A')
else:
print('B') |
s696516977 | p03623 | u457957084 | 1586916132 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | x, a, b = map(int,input().split())
if |x - b| > |x - a|:
print("A")
else:
print("B")
|
s075559224 | p03623 | u969848070 | 1586834972 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | x, a, b = map(int, input())
if abs(x-a) > abs(x-b):
print('B')
else:
print('A') |
s531232749 | p03623 | u698919163 | 1586830857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | x,a,n = map(int,input().split())
A = abs(x-a)
B = abs(x-b)
if A < B:
print('A')
else:
print('B') |
s245674822 | p03623 | u652656291 | 1586811101 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 89 | x,a,b = map(int,input(),split())
if abs(x-a) >= abs(x-b):
print('A')
else:
print('B') |
s216561245 | p03623 | u755180064 | 1585620298 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38384 | 120 | t = [int(v) for v in split(input())]
n = t[0] - t[1]
n2 = t[0] - t[2]
if abs(n) > abs(n2):
print(n2)
else:
print(n) |
s749644268 | p03623 | u440129511 | 1585318776 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | x,a,b=map(int,input().split())
if |a-x|<|b-x|:print('A')
else:print('B') |
s495712252 | p03623 | u286754585 | 1584056634 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 73 | x,a,b=map(int,input().split())
print("A" if (abs(a-b)<abs(a-c)) else "B") |
s136053590 | p03623 | u527993431 | 1583460560 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 101 | L=list(map(int,input().split()))
A=L[0]-L[1]
B=L[0]-L[2]
if min(A,B)=A:
print("A")
else:
print("B") |
s999696965 | p03623 | u217627525 | 1582094966 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 104 | x,a,b=map(int,input().split())
a_x=abs(a,x)
b_x=abs(b,x)
if a_x<b_x:
print("A")
else:
print("B") |
s301829677 | p03623 | u918601425 | 1581217285 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | x,a,b=[int(s) for s in input().split()]
if abs(a-x)<abs(b-x):
print('A'):
else:
print('B') |
s612118709 | p03623 | u871596687 | 1579387188 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 273 | s = str(input())
alphabet = ["a","b","c","d","e","f"
,"g","h","i","j","k","l","m","n",
"o","p","q","r","s","t","u","v","w","x","y","z"]
for i in s:
if i in alphabet:
alphabet.remove(i)
if len(alphabet)!=:
print(alphabet[0])
else:
print("Nome")
|
s502699033 | p03623 | u508405635 | 1579021454 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 578 | S = list(input())
# 重要：アルファベットの配列を生成
alphabets = [chr(ord('a') + i) for i in range(26)]
# 除外文字を配列に入れる
excludeS = []
for i in range(len(alphabets)):
if alphabets[i] not in S:
excludeS.append(alphabets[i])
flag = False
if alphabets[i] == 'Z'
flag = True
else:
flag = T... |
s854652538 | p03623 | u404556828 | 1578419386 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 286 | n = int(input())
list1 = [int(x) for x in input().split()]
#print(list1)
set1 = set(list1)
#print(set1)
listans = []
for i in set1:
if list1.count(i) > 1:
listans.append(i)
#print(listans)
if len(listans) < 2:
print(0)
else:
print(sorted(listans)[-1]*sorted(listans)[-2]) |
s594610595 | p03623 | u404556828 | 1578419258 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 241 | n = int(input())
list1 = [int(x) for x in input().split()]
set1 = set(list1)
listans = []
for i in set1:
if list1.count(i) > 2:
listans.append(i)
if len(listans) < 2:
print(0)
else:
print(sorted(listans)[-1]*sorted(listans)[-2]) |
s844190011 | p03623 | u404556828 | 1578419191 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 286 | n = int(input())
list1 = [int(x) for x in input().split()]
#print(list1)
set1 = set(list1)
#print(set1)
listans = []
for i in set1:
if list1.count(i) > 2:
listans.append(i)
#print(listans)
if len(listans) < 2:
print(0)
else:
print(sorted(listans)[-1]*sorted(listans)[-2]) |
s800854503 | p03623 | u652569315 | 1577985811 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | x,a,b=map(int,input().split())
if abs(x-a)>abs(x-b):
print(B)
else:
print(A)
|
s724507960 | p03623 | u652569315 | 1577985744 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 81 | x,a,b=mapt(int,input().split())
if abs(x-a)>abs(x-b):
print(B)
else:
print(A) |
s477615453 | p03623 | u153419200 | 1577390343 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | x,a,b=map(int,input().split())
if abs(x-a)>=abs(x-b)
print('B')
else:
print('A')
|
s616455303 | p03623 | u153419200 | 1577390184 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | x,a,b=map(int,input().split())
if |x-a|>=|x-b|:
print('B')
else:
print('A') |
s988725158 | p03623 | u994521204 | 1576618737 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | a,b,c=map(int,input().split())
print(print 'A' if max(abs(b-a),abs(c-a))==abs(b-a) else 'B') |
s643170188 | p03623 | u288786530 | 1575893581 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 80 | x,a,b = map(int,input().split())
s = abs(a - x)
t = abs(b - x)
print(min[s, t]) |
s494633965 | p03623 | u957872856 | 1575087313 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 326 | n = int(input())
L = [int(i) for i in input().split()]
cnt = 0
ans = 1
for i in sorted(set(L),reverse=True):
if L.count(i)>=4 and cnt==0:
ans = i*i
break
elif 2<=L.count(i)<4:
ans *= i
cnt += 1
if cnt == 2:
break
elif L.count(i)>=4 and cnt==1:
ans *=i
break
print(0 if ans==1 else... |
s368382852 | p03623 | u057079894 | 1570247960 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 86 | x,a,b=map(int,input().split())
if abs(a-t) > abs(b-t):
print('B')
else:
print('A') |
s423033137 | p03623 | u740047492 | 1569354567 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa < xb:
print(A)
elif xa > xb:
print(B) |
s176671235 | p03623 | u740047492 | 1569354491 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 103 | x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa < xb:
print(A)
else:
print(B) |
s186478893 | p03623 | u740047492 | 1569354460 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 103 | x, a, b = map(int, input().split())
xa = abs(x-a)
xb = abs(x-b)
if xa > xb:
print(A)
else:
print(B) |
s036248890 | p03623 | u961674365 | 1569211695 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 60 | x,a,b=map(int,input().split())
print(min(abs(x-a)),abs(x-b)) |
s662386872 | p03623 | u404556828 | 1568825574 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 190 | x, a, b = input().split()
x = int(x)
a = int(a)
b = int(b)
if x > a:
x_a = x - a
else:
x_a = a - x
if x > b:
x_b = x - b
else:
x_b = b - x
if x_a > x_b:
print("B")
else:
print("A") |
s471653130 | p03623 | u305732215 | 1568775842 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 103 | x, a, b = map(int, input().split())
ax = abs(a-x)
bx = abs(b-x)
if ax > bx:
print(B)
else:
print(A) |
s003875894 | p03623 | u735233212 | 1568680095 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 143 | #ABC071A
import math
x, a, b =list(map(int, input().split()))
ax = math.abs(a-x)
bx = math.abs(b-x)
if (ax < bx): print("A")
else: print('B') |
s648504528 | p03623 | u845442154 | 1568490427 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 204 | x, a, b = map(int, (inp.readline().rstrip().split()))
if a < x:
a_abs = x-a
else:
a_abs = a-x
if b < x:
b_abs = x-b
else:
b_abs = b-x
if a_abs > b_abs:
print("B")
else:
print("A") |
s216850729 | p03623 | u845442154 | 1568490410 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 150 | if a < x:
a_abs = x-a
else:
a_abs = a-x
if b < x:
b_abs = x-b
else:
b_abs = b-x
if a_abs > b_abs:
print("B")
else:
print("A") |
s266380315 | p03623 | u288500098 | 1568133380 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | x,a,b = map(int, input().split())
if (abs(x-a) > abc(x-b)):
print("A")
else:
print("B") |
s623186579 | p03623 | u275861030 | 1567363019 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | x, a, b = map(int, input().split())
if |x - a| >= |x-b|:
print('A')
else:
print('B') |
s912909319 | p03623 | u053856575 | 1566858660 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | x,a,b=map(int,inpur().split())
if min(abs(x-a),abs(x-b))==abs(x-a):
print("A")
else:
print("B") |
s058767099 | p03623 | u045408189 | 1566751222 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | x,a,b=map(int,input().split())
print('A' if min(abs(a-x),abs(b-x)))==abs(a-x) else 'B')
|
s096056461 | p03623 | u258469084 | 1565826763 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 125 | nlist = list(map(int,input.split()))
if abs(nlist[0] - nlist[1]) < abs(nlist[0] - nlist[1]) :
print("A")
else:
print("B") |
s712789981 | p03623 | u204523044 | 1565581698 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | x, a, b = map(int, input().split())
if abs(a-x) < abs(b-x):
print('A')
elif:
print('B') |
s264832838 | p03623 | u558764629 | 1565555508 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 37 | a,b,c=input();print('YNeos'[a!=c::2]) |
s967206137 | p03623 | u871841829 | 1564801328 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | x, a, b = list(map(int, input().split())
print("a" if abs(x-a) < abs(x-b) else "b") |
s286819053 | p03623 | u298297089 | 1563399936 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | x,a,b = map(int,input().split())
print(min(abs(x-a, x-b)) |
s388413790 | p03623 | u298297089 | 1563399921 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | x,a,b = map(int,input().split())
print(min(abs(x-a, x-b))) |
s795199944 | p03623 | u668503853 | 1563333558 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 278 | N=int(input())
A=[int(x) for x in input().split()]
AA=sorted(set(A),reverse=True)
li=[]
for aa in AA:
if A.count(aa)>=4:
print(aa**2)
break
if A.count(aa)>=2:
li.append(aa)
if len(li)==2:
break
if len(li)==0:
print(0)
if len(li)==2:
print(li[0]*li[1])
|
s188505484 | p03623 | u069450081 | 1562866668 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 1245 | #include <bits/stdc++.h>
using namespace std;
#define rep(i,N) for(int i=0,i##_max=(N);i<i##_max;++i)
#define repp(i,l,r) for(int i=(l),i##_max=(r);i<i##_max;++i)
#define per(i,N) for(int i=(N)-1;i>=0;--i)
#define perr(i,l,r) for(int i=r-1,i##_min(l);i>=i##_min;--i)
#define all(arr) (arr).begin(), (arr).end()
#define S... |
s779074687 | p03623 | u379959788 | 1562682474 | Python | PyPy3 (2.4.0) | py | Runtime Error | 174 | 38256 | 590 | # ABC071-C
N = int(input())
A_list = list(map(int, input().split()))
A_set = set(A_list)
A_set = sorted(A_set, reverse=True)
side_list = [0, 0]
for i in range(len(A_set)): # 大きい順に取っていき，リストで個数を確認する
if len(side_list) >= 4:
break
count = A_list.count(A_set[i]) # リストの個数を確認
if count == 2 or coun... |
s526790329 | p03623 | u375500286 | 1562552038 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | x,a,b=map(int,input().split())
if min(abs(x-a)>abs(x-b)):
print("A")
else:
print("B")
|
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.