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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s209047201 | p03631 | u823885866 | 1594092367 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8936 | 36 | s=rr()
print('YNeos'[s[0]!=s[2]::2]) |
s231635796 | p03631 | u403436880 | 1593285264 | Python | Python (3.8.2) | py | Runtime Error | 26 | 8900 | 50 | N = input()
print("Yes" if N = N[::-1] else "No") |
s910100583 | p03631 | u750651325 | 1592371339 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | N = int(input())
if N[0] == N[2]:
print("Yes")
else:
print("No") |
s117638047 | p03631 | u392361133 | 1591788927 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | a = input()
print("Yes" if a == a.reverse() else "No") |
s600374050 | p03631 | u343490140 | 1591589328 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | n = str(input())
if n == n[::-1]:
print("Yes")
else("No") |
s293719888 | p03631 | u757274384 | 1591566884 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | n = input()
#3桁なのでとても簡単
if n[0] == n[2]:
print("Yes"):
else:
print("No") |
s870376908 | p03631 | u685244071 | 1591490080 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | N = int(input())
N_reverse = N[::-1]
if N == N_reverse:
print('Yes')
else:
print('No')
|
s090104300 | p03631 | u685244071 | 1591490062 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | N = int(input())
N_reverse = N[::-1]
if N = N_reverse:
print('Yes')
else:
print('No') |
s172623414 | p03631 | u357751375 | 1591280036 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | n = int(input())
m = n // 100
if m == n[-1]:
print('Yes')
else:
print('No') |
s233301079 | p03631 | u777923818 | 1591143369 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 104 | A, B, C, D = map(int, input().split())
if A > C:
A, B, C, D = C, D, A, B
print(max(0, min(D, B)-C))
|
s288898584 | p03631 | u922487073 | 1590808527 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | s=map(int, input().split())
print("Yes" if s[0]==s[-1] else "No") |
s545016042 | p03631 | u350093546 | 1590430641 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | n=input()
if n(0)==n(2):
print('Yes')
else:
print('No') |
s475346089 | p03631 | u611090896 | 1590333791 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | N = int(input())
print('Yes' if N[0] == N[-1] else 'No') |
s941508949 | p03631 | u559346857 | 1589741299 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | n=input()
pirnt("Yes" n[0]==n[2] else "No") |
s191151777 | p03631 | u559346857 | 1589741222 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 42 | n=input()
print("Yes" n[0]==n[2] else"No") |
s904946261 | p03631 | u559346857 | 1589740994 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | a,b,c=input()
print("Yes" if a==c else "No") |
s123504166 | p03631 | u702208001 | 1589642570 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | n = int(input())
print('Yes' if n[0] == n[2] else 'No')
|
s481496252 | p03631 | u702208001 | 1589642510 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 56 | n = int(input())
print('Yes' if n[::-1] == n else 'No')
|
s025784381 | p03631 | u039192119 | 1589511805 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | a,b,c=int(input())
if a==c:
print("Yes")
else:
print("No") |
s671504274 | p03631 | u682191329 | 1589428674 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9096 | 65 | n = input()
if n%100 == n/100:
print("Yes")
else:
print("No") |
s767741105 | p03631 | u423665486 | 1589349553 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 159 | from math import gcd
def resolve():
n = int(input())
ans = int(input())
for i in range(n-1):
v = int(input())
ans = ans * v // gcd(ans, v)
print(ans)
|
s286682224 | p03631 | u693929358 | 1589151188 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | a,b,c,d=list(map(int,input().split()))
print(max(max(b,d)-min(a,c),0)) |
s137682312 | p03631 | u709799578 | 1589150275 | Python | Python (3.4.3) | py | Runtime Error | 36 | 5128 | 192 | import functools
import fractions
n = int(input())
t = [int(input()) for _ in range(n)]
def lcm(x, y):
return (x * y) // fractions.gcd(x, y)
ans = functools.reduce(lcm, t)
print(ans) |
s550269398 | p03631 | u709799578 | 1589150221 | Python | Python (3.4.3) | py | Runtime Error | 23 | 3572 | 175 | import functools
n = int(input())
t = [int(input()) for _ in range(n)]
def lcm(x, y):
return (x * y) // functools.gcd(x, y)
ans = functools.reduce(lcm, t)
print(ans) |
s130978281 | p03631 | u122428774 | 1588910361 | Python | PyPy3 (2.4.0) | py | Runtime Error | 182 | 38256 | 57 | a,b,c,d=map(int,input().split());print(min(b,d)-max(a,c)) |
s819541107 | p03631 | u821588465 | 1588801197 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | n = input()
print("Yes" if n[0] == n[2] else "No) |
s265084228 | p03631 | u702208001 | 1588561178 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 57 | n = int(input())
print('Yes' if s[0] == s[-1] else 'No')
|
s570667242 | p03631 | u711238850 | 1588226240 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3444 | 3864 | import heapq
class Graph:
def __init__(self,v,edgelist,w_v = None,directed = False):
super().__init__()
self.v = v
self.w_e = [{} for _ in [0]*self.v]
self.neighbor = [[] for _ in [0]*self.v]
self.w_v = w_v
self.directed = directed
for i,j,w in edgelist:
... |
s814292035 | p03631 | u550114433 | 1587507665 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 101 | A, B, C, D = map(int, input().split())
if B <= C:
print(0)
else:
print(min(B, D) - max(A,C)) |
s553633601 | p03631 | u106181248 | 1587442632 | Python | Python (3.4.3) | py | Runtime Error | 29 | 3820 | 237 | import math
from functools import reduce
def lcm_base(x, y):
return (x * y) // math.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
n = int(input())
t = [int(input()) for i in range(n)]
print(lcm_list(t)) |
s563430184 | p03631 | u207799478 | 1587344691 | Python | PyPy3 (2.4.0) | py | Runtime Error | 190 | 38512 | 767 | import itertools
import math
import string
import collections
from collections import Counter
from collections import deque
import sys
sys.setrecursionlimit(2*10**5)
INF = 2**60
def readints():
return list(map(int, input().split()))
def nCr(n, r):
return math.factorial(n)//(math.factorial(n-r)*math.factoria... |
s222382549 | p03631 | u217547685 | 1587077606 | Python | PyPy3 (2.4.0) | py | Runtime Error | 167 | 38768 | 55 | n = int(input())
print("Yes" if n[0] == n[2] else "No") |
s981672710 | p03631 | u054717609 | 1586976117 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 137 | n=input()
n=int(n)
og=n
rev=0
while(n>0):
d=n%10
n=n/10
rev=rev+d
if(og==rev):
print("Yes)
else:
print("No")
|
s729098626 | p03631 | u529870875 | 1586579107 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 82 | a,b,c,d = map(int,input().split())
if b<c:
print(0)
if b >= c:
print(b-c) |
s252730036 | p03631 | u246639932 | 1586493763 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | N = int(input())
print("YES" if N[0]==N[-1] else "NO") |
s526398383 | p03631 | u698988260 | 1586364630 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | N = input()
if (N = N[::-1]):
print('Yes')
else:
print('No')
|
s990771419 | p03631 | u263691873 | 1586233315 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | N = int(input())
print("Yes" if N[0]==N[2] else "No") |
s327874598 | p03631 | u975719989 | 1586023644 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 69 | n = int(input())
if n[0] == n[2]:
print("Yes")
else:
print("No") |
s798093170 | p03631 | u214936751 | 1585839605 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 79 | a, b, c = map(int, input().split())
if a == c: print("yes")
else: print("No")
|
s463107347 | p03631 | u102242691 | 1585650786 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 71 |
n = input()
if n(0) == n(-1):
print("Yes")
else:
print("No")
|
s255908267 | p03631 | u320763652 | 1585573666 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | N = int(input())
if N[0] == N[2]:
print("Yes")
else:
print("No") |
s738534365 | p03631 | u469281291 | 1585351615 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 482 | def gcd(a, b):
while a != b:
if (a <= 1 or b <= 1):
break
else:
print(a,b)
print(a % b)
if a < b:
b = b % a
elif a > b:
a = a % b
if (a <= 1 or b <= 1):
return 1
else:
... |
s488646067 | p03631 | u211747108 | 1585148220 | Python | Python (3.4.3) | py | Runtime Error | 36 | 5076 | 252 | import fractions
from functools import reduce
N = int(input())
T = list(int(input()) for _ in range(N))
def lcm_base(x, y):
return (x * y) // fractions.gcd(x, y)
def lcm_list(numbers):
return reduce(lcm_base, numbers, 1)
print(lcm_list(T))
|
s538741935 | p03631 | u692515710 | 1584649668 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 359 | import sys
sys.setrecursionlimit(200000000)
N = int(input())
NUMS = [int(input()) for _ in range(N)]
NUMS = list(set(NUMS))
def gcd(num1, num2):
if num2 == 0:
return num1
elif num1 == 0:
return 1
else:
return gcd(num2, num1 % num2)
res = NUMS[0]
for num in NUMS[1:]:
res = res... |
s380500852 | p03631 | u843318346 | 1584526170 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | n = input()
if n[0]=n[2]:
print('Yes')
else:
print('No')
|
s481689532 | p03631 | u843318346 | 1584526140 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | n = input()
if n[0]=n[2]:
priint('Yes')
else:
print('No') |
s012398572 | p03631 | u813174766 | 1583969021 | Python | Python (3.4.3) | py | Runtime Error | 37 | 5176 | 114 | import fractions
n=int(input())
a=1
for i in range(n):
b=int(input())
a=a//fractions.gcd(a,b)*b
print(int(a))
|
s238217925 | p03631 | u163874353 | 1583784299 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | l = int(input())
if l[0] == l[2]:
print("Yes")
else:
print("No") |
s705651691 | p03631 | u163874353 | 1583784233 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 81 | l = int(input())
if l[0] = l[2]:
print("Yes")
else:
print("No")
|
s001478387 | p03631 | u480038302 | 1583272264 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 54 | print("Yes" if input() == reversed(input()) else "No") |
s170547513 | p03631 | u757030836 | 1583186121 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 113 | a,b,c,d = map(int,input().split())
if b <= c:
print(0)
exit()
if b <= d:
print(b-c)
else:
print(d-c)
|
s527069610 | p03631 | u766566560 | 1582342219 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | N = input()
if N[0] =- N[2]:
print('Yes')
else:
print('No') |
s856709028 | p03631 | u553070631 | 1581793307 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 97 | a,b,c,d=map(int,input().split())
if b<=c or d<=a:
print(0)
else:
print(min(d,b)-max(a,c)) |
s938333214 | p03631 | u441320782 | 1581304296 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | x=int(input())
if x[0]==x[2]:print("Yes")
else:
print("No") |
s296913402 | p03631 | u857070771 | 1580258630 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 196 | from fraction import gcd
n=int(input())
t=[]
for _ in range(n):
a=int(input())
t.append(a)
def lcm_base(x,y):
return (x*y // gcd(x,y))
def lcm_list(l):
return reduce(lcm_base,l,1)
|
s738680799 | p03631 | u329049771 | 1579812082 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 55 | a,b,c=input()
if a == c: print('Yes') else: print('No') |
s249699535 | p03631 | u880911340 | 1579022272 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 209 |
if b<=c or d<=a:
print(0)
elif c>=a and d<=b:
print(d-c)
elif c>=a and c<=b and d>=b:
print(b-c)
elif a>=c and a<=d and d<=b:
print(d-a)
elif a>=c and b<=d:
print(b-a)
else:
print(err) |
s996535128 | p03631 | u072717685 | 1578855221 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 76 | N = input()
rN = N[::-1]
if N = rN:
r = 'Yes'
else:
r = 'No'
print(r) |
s282648214 | p03631 | u072717685 | 1578855159 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | N = input()
if N = N[::-1]:
r = 'Yes'
else:
r = 'No'
print(r) |
s786998765 | p03631 | u686036872 | 1578782526 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | a, b, c=input()
print('Yes' if a==c else 'No') |
s922263928 | p03631 | u686036872 | 1578782401 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | A=input()
print('Yes' if A==sorted(A) else 'No') |
s514951687 | p03631 | u823044869 | 1578431267 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | n = input()
if n[0] == n[3]:
print("Yes")
else:
print("No")
|
s371584439 | p03631 | u474423089 | 1578350089 | Python | Python (3.4.3) | py | Runtime Error | 268 | 29388 | 413 | import numpy as np
from scipy.sparse.csgraph import dijkstra
#from scipy.sparse import csr_matrix
N=int(input())
tree=np.array([[0]*N for i in range(N)])
for i in range(N-1):
a,b,c=map(int,input().split(' '))
tree[a-1][b-1] = c
tree[b-1][a-1] = c
Q,K=map(int,input().split(' '))
ans = dijkstra(tree,indices=K... |
s954269952 | p03631 | u948524308 | 1577474945 | Python | PyPy3 (2.4.0) | py | Runtime Error | 178 | 38640 | 760 | N=int(input())
R=[[] for i in range(N)]
for i in range(N-1):
a,b,c=map(int,input().split())
R[a-1].append([b-1,c])
R[b-1].append([a-1,c])
Q,K=map(int,input().split())
C=[0]*N
stack=[]
for i in range(N):
if i==K-1:
C[i]=0
else:
chk = [0] * N
stack=[[K-1,i,0]]
f=True... |
s267840786 | p03631 | u948524308 | 1577474918 | Python | PyPy3 (2.4.0) | py | Runtime Error | 189 | 38384 | 760 | N=int(input())
R=[[] for i in range(N)]
for i in range(N-1):
a,b,c=map(int,input().split())
R[a-1].append([b-1,c])
R[b-1].append([a-1,c])
Q,K=map(int,input().split())
C=[0]*N
stack=[]
for i in range(N):
if i==K-1:
C[i]=0
else:
chk = [0] * N
stack=[[K-1,i,0]]
f=True... |
s520641247 | p03631 | u374146618 | 1577041249 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | n = int(input())
if n[::-1]==n:
print("Yes")
else:
print("No") |
s754134154 | p03631 | u972892985 | 1576889029 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | n = list(input())
if n(0) == n(2):
print("Yes")
else:
print("No") |
s544299641 | p03631 | u656995812 | 1576451314 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 101 | n = input()
for i in range(len(n)//2){
if n[i] != n[-(i+1)]:
print('No')
exit(0)
print('Yes') |
s567997788 | p03631 | u794910686 | 1576101284 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | a,b,c=input()
print("yes" if a==c, else "No") |
s911092416 | p03631 | u038815010 | 1575054391 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 147 | n=int(input())
a=[int(input()) for _ in range(n)]
ans=a[0]
import math
for i in range(1, n):
ans = ans * a[i] // math.gcd(ans, a[i])
print(ans) |
s468472306 | p03631 | u424763114 | 1574985874 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 261 | def main():
i = list(map(int, input().split()))
n = i[0]
if n < 100 or 999 < n or isinstance(n, int) == False:
return
if(str(n[0]) == str(n[2])):
print('Yes')
else:
print('No')
if __name__ == "__main__":
main() |
s232905184 | p03631 | u123745130 | 1574919867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 40 | a=input()
print(["No","Yes"][a[0]==a[2]) |
s846931791 | p03631 | u633548583 | 1573526738 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | N=list(int(input()))
N_=reversed(N)
if N==N_:
print('Yes')
else:
print('No') |
s336354732 | p03631 | u182765930 | 1572748191 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | n = int(inout())
if n//100 == n%10:
print('YES')
else:
print('NO') |
s715538304 | p03631 | u402467563 | 1572536749 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | N = map(str, input())
if N[0]==N[2]:
print('Yes')
else:
print('No') |
s858712974 | p03631 | u000113982 | 1572462418 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 76 | n = int(input())
if (int)n/100==n%10:
print("Yes")
else:
print("No") |
s054679767 | p03631 | u768559443 | 1571808573 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 51 | n=int(input())
print("Yes" if n[0]==n[2] else "No") |
s866290699 | p03631 | u246572032 | 1571368736 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 57 | n = input().range(3)
print('Yes' if n[0]==n[2] else 'No') |
s859552034 | p03631 | u246572032 | 1571366438 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | n = input()
print('YES' if n==::n else 'NO') |
s505429899 | p03631 | u574483499 | 1571347083 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | print("Yes" if input()[0] == input()[2] else "No") |
s428116233 | p03631 | u066455063 | 1571188297 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 212 | import math
def lcm(x, y):
return (x*y) // math.gcd(x, y)
N = int(input())
ans = 0
for i in range(N):
T = int(input())
if i == 0:
ans = T
else:
ans = lcm(ans, T)
print(ans)
|
s118237072 | p03631 | u066455063 | 1571188230 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 216 | from math import gcd
def lcm(x, y):
return (x*y) // gcd(x, y)
N = int(input())
ans = 0
for i in range(N):
T = int(input())
if i == 0:
ans = T
else:
ans = lcm(ans, T)
print(ans)
|
s567075547 | p03631 | u015187377 | 1570240045 | Python | PyPy3 (2.4.0) | py | Runtime Error | 279 | 63980 | 251 | import fractions as fr
from functools import reduce
n=int(input())
t=[input() for i in range(n)]
t=[int(i) for i in t]
def lcm_base(x, y):
return (x * y) // fr.gcd(x, y)
def lcm(*numbers):
return reduce(lcm_base, numbers, 1)
print(lcm(*t)) |
s427248869 | p03631 | u167908302 | 1569798049 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 101 | #coding:utf-8
a, b, c, d = map(int, input().split())
time = max(b,d) - min(a,c)
print(max(0, time))
|
s795012306 | p03631 | u167908302 | 1569797958 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | #coding:utf-8
a, b, c, d = map(int, input().split())
print(max(b,d) - min(a,c))
|
s217344268 | p03631 | u167908302 | 1569797913 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3068 | 81 | #coding:utf-8
a, b, c, d = map(int, input().split())
print(min(a,c)- max(b,d))
|
s771599919 | p03631 | u071916806 | 1569794983 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | n=int(input())
a=n%10
b=n%100
c=n-a-(10*b)
if a=c:
print("Yes")
else:
print("No") |
s035048302 | p03631 | u071916806 | 1569794942 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 85 | n=int(input())
a=n%10
b=n%100
c=n-a-(10*b)
if a=c:
print('Yes')
else:
print('No') |
s823352738 | p03631 | u385244248 | 1569579982 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 194 | A,B,C,D = map(int,input().split())
if C >= B or D <= A:
print(0)
elif A <= C <= D <= B:
print(D-C)
elif C <= A <= B <= D:
print(B-A)
elif C <= B:
print(B-C)
else:
print(D-A)
|
s040139840 | p03631 | u740047492 | 1569354014 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 95 | sorted(a) = list[map(int, input().split(,))]
if a[0] == a[1]:
print("Yes")
els:
print("No") |
s467360773 | p03631 | u740047492 | 1569353977 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 94 | sorted(a) = list[map(int, input().split())]
if a[0] == a[1]:
print("Yes")
els:
print("No") |
s779029157 | p03631 | u740047492 | 1569353953 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 86 | a = list[map(int, input().split())]
if a[0] == a[1]:
print("Yes")
els:
print("No") |
s780398113 | p03631 | u740047492 | 1569353852 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 75 | sorted(a) = int(input())
if a[0] == a[1]:
print("Yes")
els:
print("No") |
s099786465 | p03631 | u740047492 | 1569353707 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 76 | a = int(input())
a.sort()
if a[0] == a[1]:
print("Yes")
els:
print("No") |
s563382714 | p03631 | u740047492 | 1569353662 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | a = int(input())
if a[0] == a[2]:
print("Yes")
els:
print("No") |
s950424791 | p03631 | u556371693 | 1569296328 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | n=input()
ck=0
for i in range(n//2):
if not n[i]==n[-1-i]:
ck+=1
if ck==0:
print('Yes')
else:
print('No')
|
s653984763 | p03631 | u556371693 | 1569296244 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 115 | n=input()
ck=0
for _ in range(n//2):
if not n[_]==n[-1-_]:
ck+=1
if ck==0:
print('Yes')
else:
print('No') |
s029513832 | p03631 | u477977638 | 1569209756 | Python | PyPy3 (2.4.0) | py | Runtime Error | 202 | 39792 | 439 | from collections import defaultdict
n=int(input())
dct=defaultdict(list)
for i in range(n-1):
a,b,c=map(int,input().split())
dct[a]+=[[b,c]]
dct[b]+=[[a,c]]
q,k=map(int,input().split())
lk=[0]*(n)
def dfs(v,p,d):
lk[v-1]=d
for l in dct[v]:
if l[0]==p or lk[l[0]-1]!=0:
continue
else:
... |
s893236770 | p03631 | u661980786 | 1569125370 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | n = input()
if n(0) == n(2):
print("Yes")
else:
print("No")
|
s299637012 | p03631 | u623687794 | 1568571634 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3316 | 586 | import sys
sys.setrecursionlimit(100002)
input=sys.stdin.readline
n=int(input())
graph=[{} for i in range(n)]
visited=[False]*n
for i in range(n-1):
a,b,c=map(int,input().split())
a-=1;b-=1
graph[a][b]=c
graph[b][a]=c
q,k=map(int,input().split())
dist=[0]*n
def dfs(chi,par,cost):
dist[chi]=cost
... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.