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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s561725553 | p03631 | u545998622 | 1555388806 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 75 | a = map(int, input().split())
if a[0]==a[2]:
print(Yes)
else:print(No)
|
s396084801 | p03631 | u545998622 | 1555387861 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 75 | A, B, C, D = map(int, input().split())
print(max(0, min(B, D) - max(A, C))) |
s782674608 | p03631 | u466288389 | 1555090856 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 191 | num = input().split()
for (r,i) in enumerate(num):
num[r] = int(i)
start = num[0]
if num[0]<num[2] :
start = num[2]
finish = num[3]
if num[1]<num[3]:
finish = num[1]
print(finish-start) |
s373576621 | p03631 | u470735879 | 1554682706 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 59 | n = input()
ans = 'Yes' if n == [::-1] else 'No'
print(ans) |
s940990467 | p03631 | u824327681 | 1554677423 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3316 | 785 | from collections import deque
def solve1(rs, p, v, cost, costs):
costs[v] = cost
for e in rs[v]:
if p == e[0]:
continue
solve1(rs, v, e[0], cost+e[1], costs)
return costs
n = int(input())
rs = []
for i in range(n - 1):
abc = input().split(' ')
rs.append([int(x) for x in... |
s819072708 | p03631 | u121732701 | 1554582398 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 91 | N = input().split
N1 = list(reversed(N))
if N == N1:
print("Yes")
else:
print("No") |
s263010228 | p03631 | u121732701 | 1554582330 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 85 | N = input().split
if N == list(reversed(N)):
print("Yes")
else:
print("No") |
s632094645 | p03631 | u121732701 | 1554582267 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 63 | N = input().split
if N == list(reversed(N)):
print("Yes") |
s910109428 | p03631 | u092926023 | 1554406618 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 336 | n_in = int(input())
l = [int(input()) for i in range(n_in)]
p = l[0]
for i in range(1, len(l)):
q = l[i]
if p >= q:
m, n = p, q
else:
m, n = q, p
while True:
mod_value = m % n
if mod_value == 0:
break
m = n
n = mod_value
p = int(p//... |
s526817034 | p03631 | u092926023 | 1554406271 | Python | Python (3.4.3) | py | Runtime Error | 34 | 5076 | 373 | from decimal import Decimal
n_in = int(input())
l = [int(input()) for i in range(n_in)]
p = l[0]
for i in range(1, len(l)):
q = l[i]
if p >= q:
m, n = p, q
else:
m, n = q, p
while True:
mod_value = m % n
if mod_value == 0:
break
m = n
n... |
s937393867 | p03631 | u092926023 | 1554404227 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 335 | n_in = int(input())
l = [int(input()) for i in range(n_in)]
p = l[0]
for i in range(1, len(l)):
q = l[i]
if p >= q:
m, n = p, q
else:
m, n = q, p
while True:
mod_value = m % n
if mod_value == 0:
break
m = n
n = mod_value
p = int(q/n... |
s736447803 | p03631 | u092926023 | 1554403246 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 333 | n_in = int(input())
l = [int(input()) for i in range(n_in)]
p = l[0]
for i in range(1, len(l)):
q = l[i]
if p >= q:
m, n = p, q
else:
m, n = q, p
while True:
mod_value = m % n
if mod_value == 0:
break
m = n
n = mod_value
p = int(p*q... |
s236794282 | p03631 | u565204025 | 1554232040 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 230 | # -*- coding: utf-8 -*-
n = list(int(input()))
def digit_list(num):
num = str(num)
num = list(num)
num = list(map(int,num))
return num
n = digit_list(n)
if n[0] == n[-1]:
print("Yes")
else:
print("No")
|
s357729859 | p03631 | u989326345 | 1553568910 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 74 | N=int(input())
a=N//100
b=N%10
if a==b:
print('Yes')
else:
pritn('No') |
s455839468 | p03631 | u795630164 | 1553470454 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | N = str(input())
if N == N[::-1]
print('Yes')
else
print('No') |
s274678377 | p03631 | u366959492 | 1553193665 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 108 | a,b,c,d=(int(x) for x in input().split())
if b<=c or d<=a:
print(0)
else:
print(min(b,d)-max(a,c))
|
s380518118 | p03631 | u366959492 | 1553193282 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 69 | n=str(input())
if n[0]=n[2]:
print("Yes")
else:
print("No")
|
s939036350 | p03631 | u782654209 | 1553057379 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 65 | print('Yes') if str(input())==str(input())[::-1] else print('No') |
s418695967 | p03631 | u789562878 | 1552955410 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 296 | A, B, C, D = map(int, input().split())
if A<=C:
if B<=C:
print("0")
elif D<=B:
print("{}".format(D-C))
else:
print("{}".format(B-C))
else:
if D<=A:
print("0")
elif B<=D:
print("{}".format(B-A))
else:
print("{}".format(D-A))
|
s269317114 | p03631 | u789562878 | 1552955274 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 296 | A, B, C, D = map(int, input().split())
if A<=C:
if B<=C:
print("0")
elif D<=B:
print("{}".format(D-C))
else:
print("{}".format(B-C))
else:
if D<=A:
print("0")
elif B<=D:
print("{}".format(B-A))
else:
print("{}".format(D-A))
|
s460166241 | p03631 | u077019541 | 1552881808 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 168 | N = [i for i in input()]
check = True
for i in range(N):
if N[i] != N[-i]:
check = False
break
if check ==True:
print("Yes")
else:
print("No") |
s607146775 | p03631 | u859897687 | 1552851541 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 119 | a=input()
for i in range(len(a)):
if not a[i]==a[len(a)-1-i]:
ans=1
if ans==1:
print("No")
else:
print("Yes") |
s557824066 | p03631 | u878138257 | 1552634103 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 62 | a = input()
if a[0]==a[3]:
print("Yes")
else:
print("No")
|
s412185489 | p03631 | u878138257 | 1552634056 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 66 | a = int(input())
if a[0]==a[3]:
print("Yes")
else:
print("No") |
s385345290 | p03631 | u732870425 | 1552260590 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 45 | n=input()
print("Yes" if n=n[::-1] else "No") |
s137658478 | p03631 | u403984573 | 1552097029 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 59 | N=input()
if N(0)==N(2):
print("Yes")
else:
print("No") |
s431636059 | p03631 | u170324846 | 1551906383 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 59 | n=inupt()
if n==n[::-1]:
print("Yes")
else:
print("No") |
s909860022 | p03631 | u367130284 | 1551801136 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38512 | 689 | import collections as c
d=c.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])
def DFS(point,d,cost,TFlist): #入力と同じindex系
for s in d[point]:
try:
p=s[0]
c=s[1]+cost[point]
if TFlist[p-... |
s313202725 | p03631 | u029234056 | 1551656225 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | A,B,C,D=map(int,input().split())
ans=B-C
if ans<=0:
print(0)
else:
print(ans-A) |
s843622412 | p03631 | u865413330 | 1551607164 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 62 | n = int(input())
print("Yes") if n[0] == n[2] else print("No") |
s070696578 | p03631 | u652081898 | 1551117540 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 218 | a, b, c, d = map(int, input().split())
if b <= c or d <= a:
print(0)
elif a <= c:
if b <= d:
print(b-c)
else:
print(d-c)
else:
if b <= d:
print(b-a)
else:
print(c-b) |
s211000109 | p03631 | u007550226 | 1550780365 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | n = input()
if n = n[::-1]:
print('Yes')
else:
print('No') |
s371967305 | p03631 | u449555432 | 1550721147 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 51 | a=int(input());print('Yes' if a[0]==a[2] else 'No') |
s876919206 | p03631 | u518064858 | 1550272153 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | n=input()
for i in range(len(n)//2)
if n[i]!=n[-1-i]:
print("No")
exit()
print("Yes") |
s145672576 | p03631 | u766684188 | 1549232942 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 312 | n=int(input())
t=list(map(int,[input() for i in range(n)]))
def gcd(x,y):
if y==0:
return x
else:
return gcd(y,x%y)
def lcm(x,y):
return x*y//gcd(x,y)
if n==1:
print(t[0])
else:
ans=lcm(t[0],t[1])
for i in range(n-1):
ans=lcm(ans,lcm(t[i],t[i+1]))
print(ans) |
s758144809 | p03631 | u350997995 | 1547406969 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 79 | n = list(input().split())
if n[0]==n[2]:
print("Yes")
else:
print("No") |
s107991357 | p03631 | u795630164 | 1546212103 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 290 | N = int(input())
T = [int(input()) for i in range(N)]
def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a, b):
return a * b // gcd(a, b)
if N == 1:
print(T[0])
exit()
now = lcm(T[0], T[1])
for i in range(1, N):
now = lcm(now, T[i])
print(now)
|
s315242850 | p03631 | u785578220 | 1545931884 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 136 | a,b,c,d = map(int, input().split())
if a > c:
a,b,c,d = c,d,a,b
if b < c:print(0)
elif b >= c and b < d:print(b-c)
else : print(d-c) |
s370924580 | p03631 | u887207211 | 1545719269 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 111 | A, B, C, D = map(int,input().split())
x = max(A, C)
y = min(B, D)
if(y-x > 0):
print(y - x)
else:
print(0)
|
s338868983 | p03631 | u887207211 | 1545719054 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 111 | A, B, C, D = map(int,input().split())
x = max(A, B)
y = min(C, D)
if(y-x > 0):
print(y - x)
else:
print(0)
|
s577957128 | p03631 | u371467115 | 1545291800 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 43 | print(["No","Yes"][input()==input()[::-1]]) |
s618936073 | p03631 | u371467115 | 1545291641 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 68 | N=int(input())
if N==N[::-1]:
print("Yes")
else:
print("No") |
s521658745 | p03631 | u054106284 | 1544055933 | Python | PyPy3 (2.4.0) | py | Runtime Error | 172 | 38256 | 1236 | import sys
input = sys.stdin.readline
def make_Graph(N, edges):#頂点の名前はi - 1で受け付ける
graph = [ [] for i in range(N)]
for edge in edges:
a, b, c = edge
graph[a].append((b,c))
graph[b].append((a,c))
return graph
def BFS(N, graph, start):
Q = []
V = []
prev = [None] * N
d... |
s048458036 | p03631 | u054106284 | 1544049191 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 850 | def make_Graph(N, edges):#頂点の名前はi - 1で受け付ける
graph = [ [] for i in range(N)]
for edge in edges:
a, b, c = edge
graph[a].append((b,c))
graph[b].append((a,c))
return graph
def BFS(N, graph, start):
Q = []
V = []
d = [float("inf")] * N
Q.append(start)
d[start] = 0
... |
s656641500 | p03631 | u576434377 | 1543986311 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 362 | import itertools
import math
def gcd(a,b):
while b:
a, b = b, a % b
return a
def lcm(left, right):
return (int(left) * int(right)) / int(gcd(left, right))
N = int(input().strip())
Ts = []
for i in range(N):
Ts.append(int(input().strip()))
res = int(lcm(Ts[0], Ts[1]))
for T in Ts[2:]:
... |
s802768687 | p03631 | u576434377 | 1543985794 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 362 | import itertools
import math
def gcd(a,b):
while b:
a, b = b, a % b
return a
def lcm(left, right):
return (int(left) * int(right)) / int(gcd(left, right))
N = int(input().strip())
Ts = []
for i in range(N):
Ts.append(int(input().strip()))
res = int(lcm(Ts[0], Ts[1]))
for T in Ts[2:]:
... |
s537531240 | p03631 | u561828236 | 1541727033 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 73 | n = input()
if n[2]n[1]n[0] == n:
print("Yes")
else:
print("No")
|
s264001591 | p03631 | u561828236 | 1541726984 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 70 | n = input()
if n[2][1][0] == n:
print("Yes")
else:
print("No") |
s508153603 | p03631 | u106297876 | 1540664142 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 68 | N = list(input())
if N[0] == N[2]:
print('Yes')
else:
pritn('No') |
s274097874 | p03631 | u131405882 | 1540660237 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 83 | N = int(input())
M = N[2] + N[1] + N[0]
if N == M:
print('Yes')
else:
print('No') |
s226512108 | p03631 | u131405882 | 1540660172 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 46 | N = input()
M = N[2] + N[1] + N[0]
if N == M:
|
s935328793 | p03631 | u518556834 | 1540061040 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 123 | a,b,c,d = map(int,input().split())
ans = 0
for i in range(101):
if a <= i < b and c <= i < d:
ans += 1
print(ans)
|
s352416762 | p03631 | u518556834 | 1540060961 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 123 | a,b,c,d = map(int,input().split())
ans = 0
for i in range(101):
if a < i < b and c < i < d:
ans += 1
print(ans+1)
|
s361778552 | p03631 | u518556834 | 1540060880 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 119 | a,b,c,d = map(int,input().split())
ans = 0
for i in range(101):
if a < i < b and c < i < d
ans += 1
print(ans+1)
|
s804055641 | p03631 | u484856305 | 1538861297 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | n=input()
m=n[::-1]
if n=m:
print("Yes")
else:
print("No") |
s127079323 | p03631 | u484856305 | 1538860947 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 31 | n=input()
print(reverse[::-1])
|
s746030693 | p03631 | u484856305 | 1538860848 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 27 | n=input()
print(reverse(n)) |
s769940991 | p03631 | u940102677 | 1538420776 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 61 | print("YNeos"[if not int(input())%101 in range(0,100,10)::2]) |
s407688262 | p03631 | u476418095 | 1534520353 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 |
a=""
a=raw_input()
if a[0]==a[2]:
print "Yes"
else:
print "No" |
s735623151 | p03631 | u404629709 | 1534474543 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 141 | a,b,c,d=map(int,input().split())
if (b<c)|(a>d):
t=0
elif (a<=c)and(b>=d):
t=d-c
elif (a>c)and(b<d):
t=b-a
else:
t=abs(b-c)
print(t) |
s835786986 | p03631 | u263933075 | 1532478476 | Python | Python (3.4.3) | py | Runtime Error | 19 | 2940 | 67 | a=raw_input()
if a%10 == a/100:
print "Yes"
else
print "No" |
s963981476 | p03631 | u403301154 | 1532141281 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 250 | n = int(input())
t = [int(input()) for i in range(n)]
def gcd(a, b):
if a<b:
a, b = b, a
if b==0:
return a
return gcd(b, a%b)
def lcm(a, b):
g = gcd(a, b)
return a*b//g
ans = 1
for i in range(n):
ans = lcm(ans, t[i])
print(ans) |
s483435093 | p03631 | u004025573 | 1530927857 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | N=int(input())
if N//100=N%10:
print("Yes")
else:
print("No")
|
s141444337 | p03631 | u705974985 | 1530417169 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3828 | 349 | import math
import functools
N = int(input())
T = []
for i in range(N):
T.append(int(input()))
def gcd(A, B):
while(True):
if A and B:
if A > B:
A = A % B
else:
B = B % A
else:
return max(A, B)
def lcm(A, B):
return int(A * (B // gcd(A, B)))
print(functools.reduce(lcm... |
s110727135 | p03631 | u205561862 | 1528773214 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 58 | print(["Yes","No"][(lambda x:bool(x/100-x%10))(input())]) |
s068375043 | p03631 | u476418095 | 1527113651 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | a=""
a=raw_input()
if a[0]==a[2]:
print "Yes"
else:
print "No" |
s794486944 | p03631 | u263933075 | 1526689721 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 155 | #include<bits/stdc++.h>
using namespace std;
int main()
{
int a;
cin>>a;
if(a/100==a%10&&a/100==a/10%10)
cout<<"YES";
else
cout<<"NO";
return 0;
} |
s283641556 | p03631 | u591295155 | 1525746921 | Python | Python (3.4.3) | py | Runtime Error | 52 | 5560 | 112 | import fractions
t=1
for i in range(int(input())):
s = int(input())
t = t*s//fractions.gcd(s,t)
print(t) |
s363330802 | p03631 | u330176731 | 1525634837 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 70 | n = int(input().split())
if n[0]==n[2]: print('Yes')
else: print('No') |
s390969822 | p03631 | u426964396 | 1525539299 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 82 | a=int(input())
if a/100==a%100/10 and a/100=a%10:
print "Yes"
else:
print "No" |
s565135244 | p03631 | u263933075 | 1525539267 | Python | Python (2.7.6) | py | Runtime Error | 11 | 2692 | 77 | a=input()
if a/100==a%100/10 and a/100=a%10:
print "Yes"
else:
print "No" |
s806305474 | p03631 | u613028067 | 1525537924 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 61 | a=input()
if a[0]==a[2]:
print "Yes"
else:
print "No" |
s552933683 | p03631 | u613028067 | 1525537816 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 61 | a=input()
if a[0]==a[2]:
print "Yes"
else:
print "No" |
s152767512 | p03631 | u591295155 | 1524938544 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 166 | A,B, C, D = map(int,input().split())
if A <= C and min(D, B)-C >= 0:
print(min(D, B)-C)
elif A > C and min(D, B)-A >= 0:
print(min(D, B)-A)
else:
print(0) |
s842211702 | p03631 | u796424048 | 1524760289 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 109 | A,B,C,D = list(map(int,input.split(" ")))
if B<C:
res = 0
else:
res = min(B,D) - max(A<C)
print(res) |
s736931833 | p03631 | u591295155 | 1524075663 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 45 | N = input()
print (["No","Yes"][N[0] == N[2]) |
s079256664 | p03631 | u591295155 | 1524075617 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | N = int(input())
print (["No","Yes"][N[0] == N[2]) |
s826577411 | p03631 | u591295155 | 1524075549 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 49 | N = int(input())
print (["Yes", "No"][N[0]!=N[1]) |
s592272274 | p03631 | u461636820 | 1522387213 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 61 | n = input()
if n == n[::-1]:
print('Yes')
else:
print('No') |
s052552140 | p03631 | u493813116 | 1521903172 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 207 | # ABC 070 B
A, B, C, D = map(int, input().split())
def left(a, c):
if a < c:
return c
return a
def right(b, d):
if b < d:
return b
return d
print(right(B, D) - left(A, C)) |
s197870920 | p03631 | u352642493 | 1519707526 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 446 | #include <iostream>
#include<vector>
#include<algorithm>
#include<iomanip>
#include<queue>
using namespace std;
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define REP(i,m,n) for(int i=m;i<(int)(n);i++)
typedef pair<int,int> pint;
typedef long long ll;
typedef pair<ll,ll> pll;
const int inf = 510101010;
const ll lon... |
s626636018 | p03631 | u319612498 | 1519060387 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 64 | n=input()
if n[0]==n[2[]:
print("Yes")
else:
print("No") |
s782752928 | p03631 | u748135969 | 1518374632 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 179 | a, b, c, d = map(int, input().split())
before = 0
after = 0
if a >= c:
before = a - c
else:
before = c - a
if b >= d:
after = d
else:
after = b
print(after - before) |
s025211993 | p03631 | u550574002 | 1514290664 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 50 | a,b,c,d=map(int,input().split())
print(-a+b-c+d+2) |
s989989552 | p03631 | u143492911 | 1514188359 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 58 | a,b,c,d=map(int,input().split())
print(min(b,d)-max(a,c))
|
s919364138 | p03631 | u143492911 | 1514188310 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | a,b,c,d=map(int,input().split())
if b<c:
print(0)
else:
print(min(b,d)-max(a,c)) |
s457229847 | p03631 | u143492911 | 1514188133 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 112 | a,b,c,d=map(int,input().split())
s=max(b,d)-min(a,c)
s_i=(c-a)+(d-b)
if b<c:
print(0)
else:
print(s-s_i) |
s100182006 | p03631 | u143492911 | 1514188053 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 117 | a,b,c,d=map(int,input().split())
s=max(b,d)-min(a,c)
s_i=(c-a)+(d-b)
if b<c:
print(0)
else:
print(abs(s_i-s)) |
s944911191 | p03631 | u143492911 | 1514184785 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | n=list(map(int,input().split))
n_re=n.reverse()
if n==n_re:
print("Yes")
else:
print("No")
|
s028154692 | p03631 | u209594105 | 1511903695 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 256 | def gcd(a, b):
while b:
a, b = b, a % b
return a
def lcm(a,b):
return a*b // gcd(a,b)
n = int(input())
t_list = []
for x in range(n):
t_list.append(int(input()))
result = 1
for t in t_list:
result = lcm(result,t)
print(result) |
s337899422 | p03631 | u482969053 | 1511495720 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 151 | def solve():
A, B, C, D = list(map(int, input().split()))
ans = min(B,D) - max(A,C)
if ans < 0:
ans = 0
print(ans)
solve() |
s481306408 | p03631 | u391533749 | 1510083325 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | n = input()
a1 = n%10
a2 = (n-a1)%100
a3 = (n-a1-a2)/100
if a1==a3:
print("Hello World") |
s071933098 | p03631 | u391533749 | 1510083256 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 92 | n = input()
a1 = n%10
a2 = (n-a1)%100
a3 = (n-a1-a2)/100
if a1==a2:
print("Hello World") |
s491531630 | p03631 | u667024514 | 1509390211 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 69 | a = input()
A = a[0]
B = a[2]
if A == B:
print(Yes)
else:
print(No) |
s294197868 | p03631 | u667024514 | 1507740476 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 83 | a = input()
b = int(a[0])
c = int(a[2])
if b = c:
print("Yes")
else:
print("No")
|
s825102241 | p03631 | u667024514 | 1507740428 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 81 | a = input()
b = int(a[0])
c = int(a[2])
if b = c:
print("Yes")
else:
print("No")
|
s148204659 | p03631 | u667024514 | 1507740390 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 71 | a = input()
b = a[0]
c = a[2]
if b = c:
print("Yes")
else:
print("No")
|
s559203651 | p03631 | u667024514 | 1507740358 | Python | Python (3.4.3) | py | Runtime Error | 21 | 3188 | 73 | a = (input())
b = a[0]
c = a[2]
if b = c:
print("Yes")
else:
print("No")
|
s990746458 | p03631 | u667024514 | 1507469597 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 105 | a = input().split()
A = int(a[0])
B = int(a[1])
C = int(a[2])
if A == C:
print("Yes")
else:
print("No") |
s779560546 | p03631 | u197697186 | 1506770805 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 176 | a, b, c, d = map(int, input().split())
one = [i for i in range(a, b)]
two = [i for i in range(c, d)]
count = 0
for i in one:
if i in two:
count += 1
print(count) |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.