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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s551500808 | p03631 | u759412327 | 1568259236 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = input().split()
print(["Yes","No"][a!=c]) |
s078091488 | p03631 | u597017430 | 1568131025 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | print('Yes' if input()[0] == input()[2] else 'No') |
s018405950 | p03631 | u597455618 | 1567995278 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | n = int(input())
if n[0] == n[2]:
print("Yes")
else:
print("No") |
s395579655 | p03631 | u008357982 | 1567978252 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 41 | print('YNeos'[input()!=input()[::-1]::2]) |
s692652152 | p03631 | u971282165 | 1567886657 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 319 | def gcd(a,b):
for i in range(1000):
a,b=b,a%b
if b==0:
break
return a
length = int(input())
trues = 1
ans = int(input())
for i in range(length-1):
input_val = int(input())
trues = trues*input_val
if ans>input_val:
ans = gcd(ans,input_val)
else:
ans = gcd(input_val,ans)
print(trues/ans) |
s964555021 | p03631 | u845442154 | 1567884895 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 160 | n_str = input()
n_list = list(n_str)
n_list_reverse = list(n_str)
n_list_reverse.reverse()
if n_list == n_list_reverse():
print("Yes")
else:
print("No") |
s371922206 | p03631 | u990987804 | 1567878153 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 700 | N = int(input())
ds = [[0]*N for i in range(N)]
for i in range(N-1):
a, b, c = list(map(int, input().split(" ")))
ds[a-1][b-1] = c
ds[b-1][a-1] = c
q, k = list(map(int, input().split(" ")))
def dfs(path, dist, c):
if c==g:
return dist
dists = []
for i in range(N):
if ds[i][c]>0 and i not in path:
... |
s446868301 | p03631 | u131264627 | 1567549610 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | n = list(input())
m = n.reverse()
print('Yes' if ''.join(n) == ''.join(m) else 'No') |
s841226243 | p03631 | u951480280 | 1567369101 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 64 | a,b,c,d = map(int,input().split())
print(min(b, d) - max(a, c)) |
s524442108 | p03631 | u275861030 | 1567286024 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | N = input()
if N = N[::-1]:
print('Yes')
else:
print('No') |
s913584955 | p03631 | u562472335 | 1567194758 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | n=input()
if("Yes" if n[0]==n[2] else "No") |
s411283039 | p03631 | u673361376 | 1567131905 | Python | PyPy3 (2.4.0) | py | Runtime Error | 170 | 38512 | 1226 | from collections import defaultdict
inf = float('inf')
def solve(graph, n, start_node, end_node):
if start_node == end_node:
return 0
global costs_dict
key = str(start_node) + '-' + str(end_node)
if key in costs_dict:
return costs_dict[key][end_node]
costs = [inf for _ in range(n)]
costs[start_no... |
s341304516 | p03631 | u131625544 | 1567021133 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 228 | N = input()
half = N // 2
if N%2 == 0:
left_N = N[:half]
right_N = N[half:]
else:
left_N = N[:half]
right_N = N[half+1:]
for l,r in zip(left_N, right_N[::-1]):
if l != r:
print('No')
exit()
print('Yes') |
s587239687 | p03631 | u395202850 | 1567018078 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | s = input()
print("Yes" if s[::-1]=s else "No") |
s313539607 | p03631 | u756696693 | 1566777827 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 42 | a,b,c=input()
print("Yes" if a==c else No) |
s503622523 | p03631 | u756696693 | 1566777798 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 42 | a,b,c=input()
print("Yes" if a==2 else No) |
s094209173 | p03631 | u045408189 | 1566663758 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | N=input()
print("Yes" if N[0]=N[2] else "No") |
s033833025 | p03631 | u784341473 | 1566587700 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 38 | s=input();if(s[0]==s[2] and s[0]<s[1]) |
s325424157 | p03631 | u703890795 | 1566507163 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 138 | N = input()
f = True
L = len(N)
for i in range(N):
if N[i] != N[L-1-i]:
f = False
break
if f:
print("Yes")
else:
print("No") |
s265442363 | p03631 | u273038590 | 1566445700 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 143 | a,b,c,d = map(int,input().split())
if b<c or d<a:
print(0)
elif a<=c<d<=b:
print(d-c)
elif c<a<b<d:
print(b-a)
else:
print(b-c) |
s443048952 | p03631 | u273038590 | 1566445415 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 143 | a,b,c,d = map(int,input().split())
if b<c or d<a:
print("0")
elif a<c<d<b:
print(d-c)
elif c<a<b<d:
print(b-a)
else:
print(b-c) |
s653782927 | p03631 | u264265458 | 1566314377 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | print("Yes" if input()[0]==input()[2] else "No") |
s931337557 | p03631 | u492447501 | 1566146243 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 49 | l = input()
print("Yes" if l[0]=l[2] else "No")
|
s467245111 | p03631 | u284999381 | 1566077134 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | a,b,c = int(input())
print('Yes' if a == c else 'No') |
s535572312 | p03631 | u229333839 | 1566075581 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 65 | a,b,c=input().split()
if a==c:
print("Yes")
else:
print("No") |
s626522604 | p03631 | u229333839 | 1566075526 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | a,b,c=map(int,input().split())
if a==c:
print("Yes")
else:
print("No") |
s690596571 | p03631 | u175743386 | 1566015417 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 139 | N = list(map(int, input()))
x = 0
for i in range(N // 2):
if N[i] != N[-i]:
print('No')
x = 1
break
if x == 0:
print('Yes') |
s332348288 | p03631 | u175743386 | 1566015395 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 139 | N = list(map(int, input()))
x = 0
for i in range(N // 2):
if N[i] != N[-i]:
print('No')
x = 1
break
if x == 0:
prin('Yes')
|
s025392829 | p03631 | u921027074 | 1565906199 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 52 | a,b,c=input()
if a==c, print('Yes')
else print('No') |
s495232445 | p03631 | u412481017 | 1565881903 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | a,b,c,d =map(int,input().split())
print(min(b,d)-max(a,c)) if min(b,d)-max(a,c)>0 else print(0) |
s405419430 | p03631 | u464912173 | 1565857943 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 51 | a,b,c = input()
print('Yes' if a==c else ;'No') |
s281557552 | p03631 | u318165580 | 1565833987 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 51 | N=int(input())
print("Yes" if N[::-1]==N else "No") |
s363591567 | p03631 | u256464928 | 1565814842 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 47 | n = input()
print("Yes" if n==n[::-] else "No") |
s612937610 | p03631 | u962356464 | 1565743319 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 221 | a, b , c, d = map(int, input().split())
if b <= c or d<=a:
print(0)
elif b > c and b <= d:
print(b-c)
elif c <= a and d<= b:
print(d-a)
elif (d-c)>=(b-a):
print(b-a)
elif (b-a)>= (d-c):
print(d-c)
|
s983405698 | p03631 | u999669171 | 1565732116 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 302 | #include <bits/stdc++.h>
#include <unordered_map>
using namespace std;
#define rep(i, n) for ( int i = 0; i < n; ++i )
typedef long long ll ;
int main() {
string n_str = 0;
cin >> n_str ;
if ( n_str[0] == n_str[2] ) puts( "Yes" ) ;
else puts( "No" ) ;
return 0 ;
}
|
s102091207 | p03631 | u867849998 | 1565721934 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | print("Yes" if input()[0]==input()[1] else "No") |
s350947002 | p03631 | u867849998 | 1565721566 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | a,b,c = input()
print("Yes" if a=c else "No") |
s867487614 | p03631 | u280552586 | 1565695974 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 55 | n = int(input())
print("Yes" if n[0]== n[2] else 'No' ) |
s249874203 | p03631 | u280552586 | 1565695883 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 55 | n = int(input())
print('Yes' if n[0] == n[2] else 'No') |
s976131893 | p03631 | u921027074 | 1565634875 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 44 | a,b,c=input()
print('Yes' if a==c,else 'No') |
s641851663 | p03631 | u921027074 | 1565634807 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 44 | a,b,c=input()
print('yes' if a==c,else 'no') |
s353676725 | p03631 | u574117646 | 1565629483 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 67 | num=input()
if num%100==num:
print("YES")
else:
print("NO") |
s869246322 | p03631 | u946424121 | 1565581275 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | n = input()
if n[0] == n[2]:
print("Yes)
else:
print("No") |
s454035023 | p03631 | u160659351 | 1565320377 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 84 | #70
N = list(int(input()))
if N[0] == N[2]:
print("Yes")
else:
print("No") |
s647640681 | p03631 | u971715376 | 1565306732 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 67 | a,b,c=int(input())
if a==c:
print("Yes")
elif a!=c:
print("No") |
s689449162 | p03631 | u971715376 | 1565306528 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | a,b,c=int(input())
if a==c:
print("Yes")
else:
print("No") |
s490754439 | p03631 | u971715376 | 1565306481 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | a,b,c=int(input())
if a==b:
print("Yes")
else:
print("No") |
s587968404 | p03631 | u027641915 | 1565064853 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = input()
print("Yes" if a == c else: "No") |
s487515563 | p03631 | u027641915 | 1565064831 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = input()
print("Yes" if a == c else: "No") |
s562428917 | p03631 | u027641915 | 1565064783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = input()
print('Yes' if a == c else: 'No') |
s806618692 | p03631 | u027641915 | 1565064769 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | a,b,c = input()
print('Yes' if a == c:else: 'No') |
s316371286 | p03631 | u324549724 | 1563842913 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | if (n = input().split())[0] == n[2] : print('Yes')
else : print('No')
|
s527526074 | p03631 | u606393507 | 1563828617 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 354 | s=input().split()
if int(s[2])>int(s[0]):
if int(s[2])>int(s[1]):
print("0")
else:
if int(s[3])>int(s[1]):
print(int(s[1])-int(s[2]))
else:
print(int(s[3])-int(s[2]))
else:
if int(s[0])>int(s[3]):
print("0")
else:
if int(s[3])>int(s[1]):
print(int(s[1])-int(s[0]))
else... |
s862540788 | p03631 | u374802266 | 1563325867 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 65 | if input()[0]==input()[2]:
print('Yes')
else:
print('No') |
s141088945 | p03631 | u919633157 | 1562934972 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 810 | # 2019/07/11
import sys
from heapq import heappop,heappush
input=sys.stdin.readline
n=int(input())
edge=[[] for _ in range(n)]
for _ in range(n-1):
u,v,c=map(int,input().split())
u-=1
v-=1
edge[u].append((c,v))
edge[v].append((c,u))
def dijkstra(s):
d=[float('inf')]*n
visited=[False]*n
... |
s890817722 | p03631 | u668503853 | 1562295584 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 89 | a,b,c,d=map(int,input().split())
s=min(a+b,c+d) - max(a,c)
if s>0:print(s)
else:print(0)
|
s309608834 | p03631 | u759412327 | 1562220841 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | a = list(map(int,input().split()))
if a[1]<a[2]:
print(0)
else:
print(min(a[1],a[3])-max(a[0],a[2]))
|
s561462438 | p03631 | u759412327 | 1562220807 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 106 | a = list(map(int,input().split()))
if a[1]<a[2]:
print(0)
else:
print(min(a[1],a[3])-max(a[0],a[2]))
|
s198287971 | p03631 | u414558682 | 1561496926 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | N = input().split()
if N[0] == N[2]:
print('Yes')
else:
print('No') |
s253214940 | p03631 | u247554097 | 1560895343 | Python | PyPy3 (2.4.0) | py | Runtime Error | 192 | 40048 | 603 | # KからDFS -> xからKまでとyからKまで
import sys
sys.setrecursionlimit(10**8)
n = int(input())
graph = [[] for _ in range(n)]
costs = [0 for _ in range(n)]
for _ in range(n-1):
a, b, c = map(int, input().split())
graph[a - 1].append((b-1, c))
graph[b - 1].append((a-1, c))
q, k = map(int, input().split())
def dfs(... |
s036092443 | p03631 | u226108478 | 1560630786 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3692 | 995 | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(input())
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [float('inf') for _ in range(n)]
for i in range(n - 1):
ai, bi, ci = map(... |
s424694928 | p03631 | u226108478 | 1560630627 | Python | PyPy3 (2.4.0) | py | Runtime Error | 181 | 39408 | 912 | # -*- coding: utf-8 -*-
def main():
from collections import defaultdict
from collections import deque
n = int(input())
graph = [defaultdict(int) for _ in range(n)]
visited = [False for _ in range(n)]
dist = [0 for _ in range(n)]
for i in range(n - 1):
ai, bi, ci = map(int, input(... |
s809125564 | p03631 | u874549552 | 1560266225 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | moji = input()
if (moji[0]==moji[2]):
print("Yes")
else:
print("No) |
s819797285 | p03631 | u874549552 | 1560266213 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | moji = input()
if (moji[0]==moji[1]):
print("Yes")
else:
print("No) |
s204016255 | p03631 | u410118019 | 1559924366 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 67 | s=input()
t=s.reverse()
if s==t:
print("Yes")
else:
print("No") |
s919481292 | p03631 | u733774002 | 1559761273 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | N = list(input())
if N.sorted(reverse = True) == N:
print("Yes")
else:
print("No")
|
s698130146 | p03631 | u266874640 | 1558821607 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 152 | A,B,C,D = map(int,input().split())
if B <= C:
print(0)
elif C < B <= D:
print(B - C)
elif C < D <= B:
print(D - C)
elif D <= A:
print(0) |
s083801236 | p03631 | u564060397 | 1558581116 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 52 | a=int(input())
print("Yes" if a[0]==a[2] else "No") |
s868132817 | p03631 | u508570129 | 1557981351 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | n = input()
if n == ins[::-1]:
print("Yes")
else:
print("No")
|
s133099060 | p03631 | u182047166 | 1557461589 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 306 | import sys
def input():
return sys.stdin.readline()[:-1]
# N = int(input())
# A = [int(x) for x in input().split()]
# a, b, c = map(int, input().split())
# name1 = str(input())
# alph = {"A": 1, "B": 2, "C": 3, "D": 4, "E": 5}
a = str(input())
if a[0]=a[-1]:
print("Yes")
else:
print("No") |
s763087183 | p03631 | u532966492 | 1557159553 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 43 | print(["No","Yes"][input()[0]==input()[2]]) |
s195508628 | p03631 | u507116804 | 1556684543 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 103 | n=int(input())
h=n//100
t=(n-h*100)//10
o=(n-h*100-t*10)
if h=o:
print("Yes")
else:
print("No") |
s020376332 | p03631 | u041075929 | 1556569424 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 295 | import sys, os
f = lambda:list(map(int,input().split()))
if 'local' in os.environ :
sys.stdin = open('./input.txt', 'r')
def solve():
s = input()
for i in range(len(s)/2):
if s[i] = s[len(s)-1 -i]:
print('No')
return
print('Yes')
solve()
|
s313747074 | p03631 | u806855121 | 1556547412 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 219 | A, B, C, D = map(int, input().split())
if B < C or D < A:
print(0)
elif A < C and B < D:
print(B-C)
elif A < C and B > D:
print(D-C)
elif C < A and B < D:
print(B-A)
elif A < D and B > D:
print(D-A) |
s279091547 | p03631 | u436110200 | 1556309525 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 46 | s=(input)
print("YES" if s[0]==s[2] else "No") |
s265112689 | p03631 | u436110200 | 1556309112 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | s=(input)
print("YES" if s[0]==s[2] else "No") |
s793942671 | p03631 | u436110200 | 1556308868 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | print("YES" if input()[0]==input()[2] else "No") |
s385424026 | p03631 | u481026841 | 1556054972 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | n = int(input())
if n[0] == n[-1]:
print('Yes')
else:
print('No') |
s329705339 | p03631 | u481026841 | 1556054888 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 81 | n = int(input())
if str(n[0]) = str(n[2]):
print('Yes')
else:
print('No') |
s472545306 | p03631 | u481026841 | 1556054828 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 82 | n = int(input())
if str(n[0]) == str(n[2]):
print('Yes')
else:
print('No') |
s236715877 | p03631 | u481026841 | 1556054777 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | n = int(input())
if n[0] == n[2]:
print('Yes')
else:
print('No') |
s204147872 | p03631 | u767664985 | 1555737344 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 | n = list(map(str, input()))
if n[0] = n[2]:
print("Yes")
else:
print("No")
|
s777423792 | p03631 | u367130284 | 1555657408 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 949 | from collections import *
from heapq import*
import sys
input=lambda:sys.stdin.readline()
d=defaultdict(list)
n=int(input())
for s in range(n-1):
a,b,c=map(int,input().split())
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, 3]], 3: [[1, 1], [2, 3]]... |
s781276090 | p03631 | u367130284 | 1555654399 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38384 | 1337 | from collections import *
d=defaultdict(list)
n=int(input())
for s in range(n-1):
a,b,c=map(int,input().split())
d[a].append([b,c])
d[b].append([a,c])
#defaultdict(<class 'list'>, {1: [[2, 1], [3, 1]], 2: [[1, 1], [3, 3]], 3: [[1, 1], [2, 3]]})
def DIJKSTRA(point,d):
cost = {node:float("inf") f... |
s947059512 | p03631 | u660018248 | 1555646625 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | a, b, c, d = map(int, input().split())
print(max(0, min(d,b)-max(c,a))) |
s218304300 | p03631 | u660018248 | 1555646502 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | a, b, c, d = map(int, input().split())
print(max(0), min(d,c)-max(c,a)) |
s547484747 | p03631 | u660018248 | 1555646337 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 175 | a, b, c, d = map(int, input().split())
if b<=c:
print ('0')
else:
if b>=d:
print(str(d-c))
elif b<d:
print(str(b-c))
else:
print('0') |
s203361930 | p03631 | u660018248 | 1555645691 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 146 | a, b, c, d = map(int, input().split())
if b<=c:
print ('0')
else:
if b>=d:
print(str(d-c))
elif b<d:
print(str(b-c)) |
s357078059 | p03631 | u660018248 | 1555645515 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 187 | a, b, c, d = map(int, input().split())
if b<=c:
print ('0')
exit()
else:
if b>=d:
print(str(d-c))
exit()
elif b<d:
print(str(b-c))
exit() |
s117858017 | p03631 | u660018248 | 1555645432 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 177 | a, b, c, d = map(int, input().split())
if b<=c:
print ('0')
exit()
else:
if b>=d:
print(d-c)
exit()
elif b<d:
print(b-c)
exit() |
s039814871 | p03631 | u476048753 | 1555467337 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 82 | a, b ,c = map(int, input().split())
if a == c:
print("Yes")
else:
print("No") |
s809534309 | p03631 | u331464808 | 1555447923 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | a=input()
if a[0]==c[2]:
print("Yes")
else:
print("No") |
s130892852 | p03631 | u331464808 | 1555447843 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | a=int(input())
if a[0]==c[2]:
print("Yes")
else:
print("No") |
s241878687 | p03631 | u331464808 | 1555447818 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 72 | a=int(input().split())
if a[0]==c[2]:
print("Yes")
else:
print("No") |
s732633248 | p03631 | u331464808 | 1555447770 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 77 | a,b,c = list(int,input().split())
if a==c:
print("Yes")
else:
print("No") |
s658339619 | p03631 | u331464808 | 1555447709 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 77 | a,b,c = list(int,input().split())
if a==c:
print("YES")
else:
print("NO") |
s451371802 | p03631 | u331464808 | 1555447672 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | a = list(int,input().split())
if a[0]=a[-1]:
print("YES")
else:
print("NO") |
s116309637 | p03631 | u331464808 | 1555447161 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | a = list(int.input().split())
if a[0]=a[-1]:
print("YES")
else:
print("NO") |
s811435804 | p03631 | u331464808 | 1555447139 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 78 | a = map(int.input().split())
if a[0]=a[-1]:
print("YES")
else:
print("NO") |
s994674821 | p03631 | u331464808 | 1555447083 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | a = int(input().split())
if a[0]=a[-1]:
print("YES")
else:
print("NO") |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.