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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s320803525 | p03485 | u865646085 | 1513693201 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 53 | a = int(input())
b = int(input())
ans = a+b
print a/b |
s561130047 | p03485 | u909643606 | 1513637198 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 73 | s=input()
x,y=[int(i) for i in input().split()]
if x==0:
print("No") |
s334990530 | p03485 | u126747509 | 1513635452 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 161 | #include <iostream>
#include <cmath>
using namespace std;
int main()
{
float a, b;
cin >> a >> b;
cout << (int)round((a+b)/2) << endl;
return 0;
}
|
s006417942 | p03485 | u939702463 | 1513567463 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | -*- coding: utf-8 -*-
import math
l = rawinput().split()
print(math.ceil(l[0] + l[1])
|
s873613052 | p03485 | u939702463 | 1513565550 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 90 | -*- coding: utf-8 -*-
import math
l = raw_input().split()
print(math.ceil(l[0] + l[1]) |
s557431760 | p03485 | u939702463 | 1513565056 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 88 | -*- coding: utf-8 -*-
import math
l = rawinput().split()
print(math.ceil(l[0] + l[1])
|
s497064813 | p03485 | u103539599 | 1513551792 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 476 | def compare(a, A):
R=0
for i in range(0, len(A)):
if(a==A[i]):
R+=1
elif(a<A[i]):
break
return R
def result(R,a):
if(R==a):
return 0
elif(a<R):
return R-a
return R
N = int(input())
a = list(map(int, input().split()))
a.sort()
R=0
T=comp... |
s119944130 | p03485 | u103539599 | 1513549296 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 348 | def compare(a, A):
R=0
for i in range(0, len(A)):
if(a==A[i]):
R+=1
if(R==a):
return 0
elif(a<R):
return R-a
return R
N = int(input())
a = list(map(int, input().split()))
a.sort()
R=0
R+=compare(a[0],a)
for i in range(1, N):
if(a[i] != a[i-1]):
R... |
s409306549 | p03485 | u612721349 | 1513542077 | Python | PyPy3 (2.4.0) | py | Runtime Error | 164 | 38384 | 189 | print((lambda x: int((int(x[0]) + int(x[1])) / 2 + 0.999999999999999999999999999999))(input().split())print((lambda x: int(0.999999999999 + ((int(x[0]) + int(x[1])) / 2)))(input().split())) |
s566945705 | p03485 | u562016607 | 1513487925 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 139 | s=list(input())
t=list(input())
ss=''.join(sorted(ss))
tt=''.join(sorted(tt,reverse=true))
if ss<tt:
print("Yes")
else:
print("No") |
s645681976 | p03485 | u945427450 | 1513486046 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 173 | s=input()
p=list(map(int,input().split()))
t=[0,0]
k=0
for i in s:
if i=='T':k^=1
else:
if t[k]>p[k]:t[k]-=1
else:t[k]+=1
print(['No','Yes'][p==t])
|
s662325640 | p03485 | u945427450 | 1513485961 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 173 | s=input()
p=list(map(int,input().split()))
t=[0,0]
k=0
for i in s:
if i=='T':k^=1
else:
if t[k]>p[k]:t[k]-=1
else:t[k]+=1
print(['NO','YES'][p==t])
|
s711029077 | p03485 | u537905693 | 1513484293 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 1552 | #!/usr/bin/env python
# coding: utf-8
def no():
print("No")
return
def main():
s = input()
x, y = list(map(int, input().split()))
x_start = 0
f_count = 0
x_dirs = []
y_dirs = []
is_x = True # xを向いてるか
t_exist = False
for c in s:
if c == "F":
f_count += 1
... |
s503798128 | p03485 | u259569723 | 1513484189 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 181 | def solv():
s = sorted(input())
t = sorted(input(),reverse=True)
if(s<t):
print('Yes')
else:
print('No')
if __name__ == '__main__':
solv()
|
s777965760 | p03485 | u259569723 | 1513484131 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 194 | def solv():
s = ''.join(sorted(input()))
t = ''.join(sorted(input(),reverse=True))
if(s<t):
print('Yes')
else:
print('No')
if __name__ == '__main__':
solv() |
s254447624 | p03485 | u259569723 | 1513483943 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 191 | def solv():
s = ''.join(sorted(input()))
t = ''.join(reversed(sorted(input())))
if(s<t):
print('Yes')
else:
print('No')
if __name__ == '__main__':
solv() |
s170852230 | p03485 | u259569723 | 1513483739 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | def solv():
s = ''.join(sorted(input()))
t = ''.join(sorted(input()))[::-1]
if(s<t):
print('Yes')
else:
print('No')
if __name__ == '__main__':
solv() |
s852289212 | p03485 | u259569723 | 1513483692 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3056 | 187 | def solv():
s = ''.join(sorted(input()))
t = ''.join(sorted(input()))[::-1]
if(s<t):
print('Yes')
else:
print('No')
if __name__ == '__main__':
solv() |
s410288237 | p03485 | u273396603 | 1513483383 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 132 | a = int(input())
b = int(input())
x = (a + b) // 2
y = (a + b) % 2
if y != 0 :
print(str(x + 1))
else :
print(str(x))
|
s636839034 | p03485 | u537905693 | 1513482379 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3192 | 2241 | #!/usr/bin/env python
# coding: utf-8
def no():
print("No")
return
def shift(i):
return i+8001
def main():
s = input()
x, y = list(map(int, input().split()))
x_start = 0
x_count = 0
y_count = 0
t_count = 0
f_count = 0
x_dirs = []
y_dirs = []
is_x = True # xを向いてるか
... |
s860067190 | p03485 | u508296246 | 1513481626 | Python | Python (3.4.3) | py | Runtime Error | 114 | 3444 | 1211 | import collections
import itertools
s = list(map(str, input()))
g = list(map(lambda x: int(x),input().split()))
seq = ('R', 'L')
ans = False
count_dict = collections.Counter(s)
g_sum = abs(g[0])+abs(g[1])
if g_sum > count_dict['F']:
print('No')
else:
patterns = list(itertools.product(seq, repeat=count_dict... |
s954447447 | p03485 | u808537778 | 1513480965 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 139 | a, b = map(int,input().split( ))
x = (a + b)/2
if x%2 == 0:
return x
else:
x = int(x) +1
return x |
s136870379 | p03485 | u787679173 | 1513480691 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 1463 | import sys
sys.setrecursionlimit(10000)
s = input()
x, y = [int(x) for x in input().split()]
d = (
(1, 0),
(0, 1),
(-1, 0),
(0, -1),
)
def next_dr(dr):
def fix(dr):
if dr == -1:
return 3
if dr == 4:
return 0
return dr
return fix(dr - 1), fix(dr... |
s523234581 | p03485 | u808537778 | 1513480464 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 110 | a, b = map(int, input().split( ))
x = (a + b)/2
if x%2 == 0:
return x
else:
x = int(x) +1
return x |
s610452300 | p03485 | u808537778 | 1513480319 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | a, b = map(int, input().split( ))
x = (a + b)/2
if x%2 == 0:
return x
else:
x = int(x) +1
return x
|
s626655665 | p03485 | u808537778 | 1513480083 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 67 | a, b = map(int, input().split( ))
x = (a + b)/2
c = int(x)
return c |
s940567629 | p03485 | u808537778 | 1513479963 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 67 | a, b = map(int, input(),split( ))
x = (a + b)/2
c = int(x)
return c |
s216677802 | p03485 | u537905693 | 1513479932 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 900 | #!/usr/bin/env python
# coding: utf-8
def no():
print("No")
return
def main():
s = input()
x, y = list(map(int, input().split()))
x_count = 0
y_count = 0
t_count = 0
is_x = True # xを向いてるか
for c in s:
if c == "T":
t_count += 1
continue
if t_co... |
s785365920 | p03485 | u125676322 | 1513479809 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 176 | import math
input_data = input()
for line in input_data:
datas = line.split(" ")
datas = [int(x) for x in datas]
print(int(math.floor((datas[0] + datas[1]) / 2))) |
s007586771 | p03485 | u695429668 | 1513479705 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 388 | # coding:utf-8
N = int(input())
a = input().split()
a_ = list(map(int, a))
#back_a = list(map(lambda x:x*0, list(range(N))))
back_i = 0
back_i2 = 0
for i in range(N):
a_count = a[i-back_i]
if a_count > int(a[i-back_i]):
del a[i-back_i]
back_i += 1
back_i2 +=
if a_count < int(a[i-b... |
s878846272 | p03485 | u225528554 | 1513479161 | Python | Python (3.4.3) | py | Runtime Error | 32 | 3956 | 679 | import string
if __name__=="__main__":
s = list(input())
t = list(input())
flag = False
if s is t:
print("No")
exit()
dic = string.ascii_lowercase
c = 0
for j in range(len(s)):
if s[j] in t:
c+=1
if c==len(s) and c<len(t):
print("Yes")
... |
s335170723 | p03485 | u787679173 | 1513478915 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 786 | import sys
sys.setrecursionlimit(10000)
s = input()
x, y = [int(x) for x in input().split()]
d = (
(1, 0),
(0, 1),
(-1, 0),
(0, -1),
)
def next_dr(dr):
def fix(dr):
if dr == -1:
return 3
if dr == 4:
return 0
return dr
return fix(dr - 1), fix(dr... |
s856707058 | p03485 | u158225062 | 1513478762 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 192 | #coding: utf-8
N = input().split()
A=N[0]
B=N[1]
C=(A+B)/2
intC =int(C)
C_list = list(C)
C_cou = C_list.count(.)
if A==B:
print(A)
elif intC < C:
print(intC+1)
elif intC == C:
print(intC) |
s277926838 | p03485 | u161703388 | 1513478304 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 134 | a, b = map(int, input().split())
ave = (a + b) / 2
if ave - int(ave) > 0:
ave = int(ave) + 1
else
ave = int(ave)
print(ave)
|
s320356876 | p03485 | u774411119 | 1513478225 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 260 | A=list(input())
B=list(input())
minm=min(A)
maxi=max(B)
while min(len(A),len(B))!=0:
if minm<maxi:
print("Yes")
break
if minm==maxi:
A.remove(minm)
B.remove(maxi)
if minm>maxi:
print("No")
break
if min(len(A),len(B))==0:
print("No")
break |
s119025911 | p03485 | u813450984 | 1513478224 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 287 | s = list(input())
t = list(input())
def f(s, t):
s.sort()
t.sort(reverse=True)
for i in range(len(s)):
if s[i] < t[i]:
return 'Yes'
elif s[i] > t[i]:
return 'No'
elif i + 1 >= len(s) and not i + 1 >= len(t):
return 'No'
return 'No'
print(f(s, t)) |
s080230133 | p03485 | u813450984 | 1513478212 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 287 | s = list(input())
t = list(input())
def f(s, t):
s.sort()
t.sort(reverse=True)
for i in range(len(s)):
if s[i] < t[i]:
return 'Yes'
elif s[i] > t[i]:
return 'No'
elif i + 1 >= len(s) and not i + 1 >= len(t):
return 'No'
return 'No'
print(f(s, t)) |
s952837504 | p03485 | u158225062 | 1513477547 | Python | Python (3.4.3) | py | Runtime Error | 16 | 2940 | 148 | #coding: utf-8
N = input().rstrip()
A=N[0]
B=N[1]
C=int((A+B)/2)
if A==B:
print(A)
else:
print(int(C)+1) |
s337084214 | p03485 | u158225062 | 1513477509 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 156 | #coding: utf-8
N = input().split()
A=int(N[0])
B=int(N[1])
C=int((A+B)/2)
if A=B:
print(A)
else:
print(int(C)+1) |
s155663801 | p03485 | u209951743 | 1513477181 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 155 | a, b = map(int, input().split())
V = (a+b)/2
if (a+b)%2==0:
print(int(V)
else:
v =int((a + b)/2 + (1 - ((a + b)/2 - int((a + b)/2))))
print(v)
|
s196375713 | p03485 | u274907892 | 1513477009 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 140 | s = input()
t = input()
listS = list(s)
listT = list(t)
sorted(listS)
sorted(listT)
if listS > listT:
print("Yes")
else:
print("No") |
s116683276 | p03485 | u158225062 | 1513476902 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | #coding: utf-8
N = input().rstrip()
A=int(N[0])
B=int(N[1])
C=int((A+B)/2)
if A=B:
print(A)
else:
print(int(C)+1) |
s109436714 | p03485 | u158225062 | 1513476862 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | #coding: utf-8
N = input().rstrip()
A=int(N[0])
B=int(N[1])
C=int((A+B)/2)
if A=B:
print(A)
else:
print(int(C)+1) |
s114216938 | p03485 | u276192130 | 1513476834 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 188 | n = int(input())
a = list(map(int, input().split()))
ans = []
for i in set(a):
temp = a.count(i)
if temp > i:
ans += temp - i
elif temp < i:
ans += i
print(ans) |
s953728486 | p03485 | u439009525 | 1513476799 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 62 | A, B=list(map(int, input().split()))
print(math.ceil((A+B)/2)) |
s703917131 | p03485 | u158225062 | 1513476779 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 120 | #coding: utf-8
N = input().rstrip()
A=int(N[0])
B=int(N[1])
C=int((A+B)/2)
if A==B:
print(A)
else:
print(int(C)+1)
|
s105173248 | p03485 | u158225062 | 1513476713 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 114 | #coding: utf-8
N = map(int,input().rstrip())
A=N[0]
B=N[1]
C=(A+B)/2
if A==B:
print(A)
else:
print(int(C)+1)
|
s606406781 | p03485 | u158225062 | 1513476628 | Python | Python (3.4.3) | py | Runtime Error | 20 | 2940 | 121 | #coding: utf-8
N = map(int,input().rstrip())
A=N[0]
B=N[1]
C=round((A+B)/2,0)
if A==B:
print(A)
else:
print(int(C))
|
s231789541 | p03485 | u319612498 | 1513476361 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 92 | import math
a,b = list(map(int, input().split()))
c = a + b
d = c/2
x = ceil(d)
print(x) |
s025166685 | p03485 | u225528554 | 1513476178 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 181 | import math
if __name__=="__main__":
a = list(map(int,input()))
b = (a[0]+a[1])/2
if b-a[0]>a[1]-b:
print(math.floor(b))
else:
print(math.floor(b)+1) |
s653109226 | p03485 | u341855122 | 1513476119 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 48 | a=map(int,input().split())
print(int(a[0]+a[1])) |
s619265931 | p03485 | u352499693 | 1513476062 | Python | Python (2.7.6) | py | Runtime Error | 10 | 2568 | 52 | x, y = map(int, raw_input().split())
print (a+b+1)/2 |
s601800060 | p03486 | u559367141 | 1600464852 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9032 | 126 | a = input()
b = input()
a = list(a)
b = list(b)
if (a.sort(reverse=True) < b.sort()):
print("Yes")
else:
print("No")
|
s786525450 | p03486 | u405328424 | 1599850334 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8916 | 103 | s = input().sorted()
t = input().sorted(reverse=True)
if(new_s < new_t): print("Yes")
else: print("No") |
s074554493 | p03486 | u666550725 | 1599775975 | Python | PyPy3 (7.3.0) | py | Runtime Error | 98 | 74684 | 100 | s = input()
t = input()
s.sort()
t.sort(reverse = True)
if s < t:
print("Yes")
else:
print("No") |
s139192889 | p03486 | u999503965 | 1599716359 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9032 | 267 | s=str(input())
t=str(input())
l="abcdefghijklmnopqrstuvwxyz"
ss=''.join(sorted(s))
st=''.join(sorted(t))
str=''.join(sorted(t,reverse=True))
if l.index(str[1])>l.index(ss[1]):
ans="Yes"
elif len(t)>len(s) and ss in st:
ans="Yes"
else:
ans="No"
print(ans)
|
s724947723 | p03486 | u244836567 | 1599702272 | Python | Python (3.8.2) | py | Runtime Error | 21 | 8856 | 255 | a=input()
b=input()
c=[]
d=[]
e=""
f=""
for i in range(len(a)):
c.append(a[i])
for i in range(len(b)):
d.append(b[i])
c.sort()
d.reverse()
for i in range(len(a)):
c=c+c[i]
for i in range(len(b)):
d=d+d[i]
if c<d:
print("Yes")
else:
print("No") |
s423802967 | p03486 | u054514819 | 1599700677 | Python | PyPy3 (7.3.0) | py | Runtime Error | 92 | 74616 | 428 | import sys
def input(): return sys.stdin.readline().strip()
def mapint(): return map(int, input().split())
sys.setrecursionlimit(10**9)
s = list(input())
t = list(input())
s.sort()
t.sort(reverse=True)
lens = len(s)
for i in range(lens):
if s[i]<t[i]:
print('Yes')
exit()
elif s[i]>t[i]:
... |
s025579048 | p03486 | u655048024 | 1598840579 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9116 | 298 | s,t = map(str, input().split())
k = 28
l = -1
alp = "abcdefghjklmnopqrstuvwxyz"
for i in range(len(s)):
for j in range(26):
if(s[i]==alp[j]):
k = min(k,j)
for i in range(len(t)):
for j in range(26):
if(t[i]==alp[j]):
l = max(l,j)
if(k>l):
print("Yes")
else:
print("No")
|
s887487022 | p03486 | u655048024 | 1598840394 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9072 | 298 | s,t = map(str,input().split())
k = 28
l = -1
alp = "abcdefghijklmnopqrstuvwxyz"
for i in range(len(s)):
for j in range(26):
if(s[i]==alp[j]):
k = min(k,j)
for i in range(len(t)):
for j in range(26):
if(t[i]==alp[j]):
l = max(l,j)
if(k>l):
print("Yes")
else:
print("No")
|
s881715072 | p03486 | u655048024 | 1598840279 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8996 | 297 | s,t = map(str,input().split())
k = 28
l = -1
alp = "abcdefghjklmnopqrstuvwxyz"
for i in range(len(s)):
for j in range(26):
if(s[i]==alp[j]):
k = min(k,j)
for i in range(len(t)):
for j in range(26):
if(t[i]==alp[j]):
l = max(l,j)
if(k>l):
print("Yes")
else:
print("No")
|
s952881136 | p03486 | u655048024 | 1598840245 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9112 | 297 | s,t = map(str,input().split())
k = 28
l = -1
alp = "abcdefghjklmnopqrstuvwxyz"
for i in range(len(s)):
for j in range(26):
if(s[i]==apl[j]):
k = min(k,j)
for i in range(len(t)):
for j in range(26):
if(t[i]==alp[j]):
l = max(l,j)
if(k>l):
print("Yes")
else:
print("No")
|
s159165623 | p03486 | u655048024 | 1598840141 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9060 | 296 | s,t = map(str,input().split())
k = 28
l = -1
alp = "abcdefghjklmnopqrstuvwxyz"
for i in range(len(s)):
for j in range(27):
if(s[i]==apl[j]):
k = min(k,j)
for i in range(len(t)):
for j in range(27):
if(t[i]==alp[j]):
l = max(l,j)
if(k>l):
print("Yes")
else:
print("No") |
s493056735 | p03486 | u074220993 | 1598727973 | Python | Python (3.8.2) | py | Runtime Error | 27 | 8980 | 190 | S = sorted(x for x in input())
T = sorted([x for x in input()], reverse=True)
for s,t in zip(S,T):
if s < t:
ans = 'Yes'
break
if s > t:
ans = 'No'
print(ans) |
s729187625 | p03486 | u620846115 | 1598626510 | Python | Python (3.8.2) | py | Runtime Error | 22 | 9040 | 572 | s = list(input())
t = list(input())
for i in s:
for j in t:
if ord(i)<ord(j):
print("Yes")
exit()
count = 0
if len(s)<len(t):
for i in range(len(s)):
if s[i]=t[i]:
count+=1
if count = len(s):
print("Yes")
exit()
print("No")
s = list(input())
t = list(input())
for i in s:... |
s407763678 | p03486 | u620846115 | 1598626346 | Python | Python (3.8.2) | py | Runtime Error | 20 | 8972 | 270 | s = list(input())
t = list(input())
for i in s:
for j in t:
if ord(i)<ord(j):
print("Yes")
exit()
count = 0
if len(s)<len(t):
for i in range(len(s)):
if s[i]=t[i]:
count+=1
if count = len(s):
print("Yes")
exit()
print("No")
|
s274933926 | p03486 | u038107109 | 1598485367 | Python | Python (3.8.2) | py | Runtime Error | 28 | 9048 | 261 | s = input()
t = input()
s = sorted(s)
t = sorted(t)[::-1]
answer = "Yes"
for i in range(len(s)):
s_c = s[i]
t_c = t[i]
if s_c < t_c:
break
elif s_c == t_c:
continue
else:
answer = "No"
break
if s == t:
answer = "No"
print(answer) |
s011338396 | p03486 | u038107109 | 1598485322 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9124 | 261 | s = input()
t = input()
s = sorted(s)
t = sorted(t)[::-1]
answer = "Yes"
for i in range(len(s)):
s_c = s[i]
t_c = t[i]
if s_c < t_c:
break
elif s_c == t_c:
continue
else:
answer = "No"
break
if s == t:
answer = "No"
print(answer) |
s202433910 | p03486 | u855057563 | 1598458346 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9028 | 103 | s=list(input())
t=list(input())
s1=s.sort()
t1=t.sort()
if s1<t1:
print("Yes")
else:
print("No")
|
s802393536 | p03486 | u161693347 | 1597933668 | Python | Python (3.8.2) | py | Runtime Error | 40 | 9976 | 1206 | import sys, re, os
from collections import deque, defaultdict, Counter
from math import ceil, sqrt, hypot, factorial, pi, sin, cos, radians, gcd
from itertools import permutations, combinations, product, accumulate
from operator import itemgetter, mul
from copy import deepcopy
from string import ascii_lowercase, ascii_... |
s228924780 | p03486 | u612975321 | 1597610288 | Python | Python (3.8.2) | py | Runtime Error | 31 | 9120 | 265 | s = list(input())
t = list(input())
s.sort()
t.sort(reverse=True)
flg = True
for i in range(len(s)):
if ord(s[i]) > ord(t[i]):
flg = False
break
if ord(s[i]) < ord(t[i]):
break
print('Yes') if flg else print('No')
|
s019823491 | p03486 | u519339498 | 1597384030 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8984 | 224 | s=input()
t=input()
s.sort()
t.sort(reverse=True)
for i in range(min(len(s),len(t))):
if ord(s[i])==ord(t[i]):
continue
elif ord(s[i])<ord(t[i]):
print("Yes")
break
else:
print("No")
else:
print("No") |
s710228921 | p03486 | u519339498 | 1597383978 | Python | Python (3.8.2) | py | Runtime Error | 19 | 9000 | 219 | s=input()
t=input()
s.sort()
t.sort(reverse=True)
for i in range(min(len(s,t))):
if ord(s[i])==ord(t[i]):
continue
elif ord(s[i])<ord(s[i]):
print("Yes")
break
else:
print("No")
else:
print("No") |
s816348238 | p03486 | u519339498 | 1597383742 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9024 | 344 | import sys
s=input()
t=input()
if s==t:
print("No")
sys.exit()
S=list(s)
T=list(t)
for i in s:
if i in t:
S.remove(i)
T.remove(i)
S.sort()
T.sort()
a="".join(S)
b="".join(T)
if b=="":
print("No")
sys.exit()
if a=="":
print("Yes")
sys.exit()
for j in b:
if ord(a[0])<ord(j):
print("Yes")
b... |
s643743857 | p03486 | u519339498 | 1597383634 | Python | Python (3.8.2) | py | Runtime Error | 29 | 9052 | 307 | import sys
s=input()
t=input()
if s==t:
print("No")
sys.exit()
S=list(s)
T=list(t)
for i in s:
if i in t:
S.remove(i)
T.remove(i)
S.sort()
T.sort()
a="".join(S)
b="".join(T)
if a=="":
print("Yes")
sys.exit()
for j in b:
if ord(a[0])<ord(j):
print("Yes")
break
else:
print("No") |
s960328718 | p03486 | u548514780 | 1597029037 | Python | Python (3.8.2) | py | Runtime Error | 25 | 8984 | 382 | s,t=map(str,input().split())
s_array=[]
t_array=[]
for i in range(len(s)):
s_array.append(s[i])
for i in range(len(t)):
t_array.append(t[i])
s_array=sorted(s_array)
t_array=sorted(t_array,reverse=True)
for i in range(min([len(s_array),len(t_array)])):
if s_array[i]<t_array[i]:
print('Yes')
exit()
elif... |
s158637308 | p03486 | u477320129 | 1596937075 | Python | PyPy3 (7.3.0) | py | Runtime Error | 89 | 74728 | 1210 | #!/usr/bin/env python3
import sys
def solve(H: int, W: int, A: "List[List[int]]", B: "List[List[int]]"):
from itertools import chain
dp = [[set() for _ in range(W+1)] for _ in range(H+1)]
dp[0][0].add(0)
for h in range(H):
for w in range(W):
d = A[h][w] - B[h][w]
for v ... |
s488226688 | p03486 | u786020649 | 1596671922 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8924 | 399 | import sys
from string import ascii_lowercase as alph
from itertools import zip_longest
s,t=[list(l) for l in sys.stdin.read().split()]
d=dict((w,x) for w,x in zip(alph,range(26)))
d['?']=-1
s.sort(key=d.get)
t.sort(key=d.get, reverse=True)
for x,y in zip_longest(s,t,fillvalue='?'):
if d[x]<d[y]:
print('Yes')
... |
s689195643 | p03486 | u750389519 | 1596669338 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9104 | 93 | s=input()
t=input()
u=sorted([s])
v=sorted([t],reversed=True)
print("Yes" if u<v else "No") |
s437100237 | p03486 | u113255362 | 1595623267 | Python | Python (3.8.2) | py | Runtime Error | 27 | 9052 | 339 | s = input()
t = input()
ListS= list(s)
ListT = list(t)
ListS.sort()
ListT.sort(reverse= True)
S = ""
T = ""
for i in range(len(ListS)):
S += ListS[i]
for i in range(len(ListT)):
T += ListT[i]
if S == T:
print("No")
else:
List.append(S)
List.append(T)
List.sort()
if List[0]==S:
print("Yes")
else:
... |
s357790381 | p03486 | u745214511 | 1595208957 | Python | Python (3.8.2) | py | Runtime Error | 30 | 9016 | 170 | a = [input() for i in range(2)]
sp = "".join(sorted(list(a[0])))
tmp = list(a[1])
tmp.sort().reverse()
tp = "".join(tmp)
if sp < tp:
print("Yes")
else:
print("No")
|
s945514851 | p03486 | u627691992 | 1594867907 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9020 | 76 | S = sorted(input())
T = sorted(input())
print("Yes" if (S < t) else "No")
|
s827782025 | p03486 | u168416324 | 1594757302 | Python | Python (3.8.2) | py | Runtime Error | 24 | 8800 | 153 | x=sorted(list(input()))
y=sorted(list(input()),reverse=true)
a=""
b=""
for (p,q) in zip x,y:
a+=p
b+=q
if a<b:
print("Yes")
else:
print("No")
|
s618663393 | p03486 | u545644875 | 1594420073 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9068 | 483 | S = list(input())
T = list(input())
s = []
t = []
for i in S:
s.append(int(ord(i)))
for i in T:
t.append(int(ord(i)))
s.sort(reverse = True)
t.sort(reverse = True)
for i in range(max(len(s),len(t))):
if t[i] > s[i]:
print("Yes")
exit(0)
elif s[i] != t[i]:
break
if len(t) > len(s):
for i in s:
... |
s210495242 | p03486 | u654470292 | 1593719371 | Python | PyPy3 (7.3.0) | py | Runtime Error | 84 | 68696 | 1128 | import bisect
import copy
import heapq
import math
import sys
from collections import *
from functools import lru_cache
from itertools import accumulate, combinations, permutations, product
def input():
return sys.stdin.readline()[:-1]
def ruiseki(lst):
return [0]+list(accumulate(lst))
sys.setrecursionlimit(500... |
s069238837 | p03486 | u750651325 | 1593519793 | Python | Python (3.8.2) | py | Runtime Error | 30 | 10024 | 666 | import sys
import math
import itertools
import bisect
from copy import copy
from collections import deque,Counter
from decimal import Decimal
def s(): return input()
def i(): return int(input())
def S(): return input().split()
def I(): return map(int,input().split())
def X(): return list(input())
def L(): return list(i... |
s253964183 | p03486 | u088488125 | 1593478737 | Python | Python (3.8.2) | py | Runtime Error | 21 | 9008 | 96 | s=input()
t=input()
s=s.sort()
t=t.sort(reverse=True)
if s<t:
print("Yes")
else:
print("No") |
s966752556 | p03486 | u729119068 | 1593137063 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9096 | 317 | s=list(list(i for i in input()).sort())
t=list(list(i for i in input()).sort()(reverse=True))
A=True
for i in range(min(len(s),len(t))):
if s[i]<t[i]:
A = True
elif s[i]>t[i]:
A = False
break
else:
if len(s)<len(t): A=True
else:A= False
print('Yes' if A else 'No')
|
s483085118 | p03486 | u729119068 | 1593136981 | Python | Python (3.8.2) | py | Runtime Error | 24 | 9060 | 296 | s=[i for i in input()].sort()
t=[i for i in input()].sort()(reverse=True)
A=True
for i in range(min(len(s),len(t))):
if s[i]<t[i]:
A = True
elif s[i]>t[i]:
A = False
break
else:
if len(s)<len(t): A=True
else:A= False
print('Yes' if A else 'No') |
s956350209 | p03486 | u729119068 | 1593136788 | Python | Python (3.8.2) | py | Runtime Error | 25 | 9072 | 298 | s=list(input().split()).sort()
t=list(input().split()).sort()(reverse=True)
A=True
for i in range(min(len(s),len(t))):
if s[i]<t[i]:
A = True
elif s[i]>t[i]:
A = False
break
else:
if len(s)<len(t): A=True
else:A= False
print('Yes' if A else 'No') |
s880291989 | p03486 | u503111914 | 1592698765 | Python | Python (3.8.2) | py | Runtime Error | 28 | 8796 | 318 | import sys
S = [ord(i) for i in input()]
T = [ord(j) for j in input()]
S.sort()
T = sorted(T, reverse=True)
#print(S,T)
for k in range(len(S)):
if S[k] > T[k]:
print("No")
sys.exit()
elif S[k] < T[k]:
print("Yes")
sys.exit()
else:
None
if len(S) <= len(T):
print("Yes")
else:
print("No")
|
s339194283 | p03486 | u503111914 | 1592698468 | Python | Python (3.8.2) | py | Runtime Error | 26 | 9020 | 287 | import sys
S = [ord(i) for i in input()]
T = [ord(j) for j in input()]
S.sort()
T.sort()
for k in range(len(S)):
if S[k] > T[k]:
print("No")
sys.exit()
elif S[k] < T[k]:
print("Yes")
sys.exit()
else:
None
if len(S) <= len(T):
print("Yes")
else:
print("No")
|
s025496178 | p03486 | u503111914 | 1592698438 | Python | Python (3.8.2) | py | Runtime Error | 23 | 8860 | 287 | impport sys
S = [ord(i) for i in input()]
T = [ord(j) for j in input()]
S.sort()
T.sort()
for k in range(len(S)):
if S[k] > T[k]:
print("No")
sys.exit()
elif S[k] < T[k]:
print("Yes")
sys.exit()
else:
None
if len(S) <= len(T):
print("Yes")
else:
print("No") |
s032192798 | p03486 | u026155812 | 1592178692 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 278 | import sys
s = input()
t = input()
s.sort()
t.sort()
for x, y in zip(s, t[::-1]):
if x > y:
print('No')
sys.exit()
elif x == y:
continue
else:
print('Yes')
sys.exit()
if len(s) <= len(t):
print('Yes')
else:
print('No') |
s575148571 | p03486 | u350093546 | 1591489052 | Python | PyPy3 (2.4.0) | py | Runtime Error | 173 | 38384 | 383 | s=list(input())
t=list(input())
s.sort()
t.sort()
if s==t and s.count(s[0])==len(s) and t.count(s[0])==len(t):
print('No')
elif s.count(s[0])==len(s) and t.count(s[0])==len(t):
if len(s)<len(t):
print('Yes')
else:
print('No')
else:
if ord(s[0])==ord(t[-1]):
print('No')
elif ord(s... |
s909335131 | p03486 | u350093546 | 1591488315 | Python | PyPy3 (2.4.0) | py | Runtime Error | 179 | 38256 | 325 | s=list(input())
t=list(input())
s.sort()
t.sort()
for i in range(min(len(s),len(t))):
if s[-1*(i+1)]==t[-1*(i+1)]:
x=1
continue
elif ord(s[-1*(i+1)])>ord(t[-1*(i+1)]):
print('No')
x=0
break
else:
x=0
print('Yes')
break
if x=1:
if len(s)<len(t):
print('Yes')
else:
print(... |
s235446080 | p03486 | u912650255 | 1591407369 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 240 | N = int(input())
city = []
member = []
for i in range(N):
S,P = input().split()
city.append(S)
member.append(int(P))
if max(member) > sum(member)//2 :
print(city[member.index(max(P))])
else:
print('atcorder')
|
s396975860 | p03486 | u584153341 | 1591154394 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | S = sorted(list(str(input())))
T = sorted(list(str(input())),reverse=True)
print('YNeos'[S>=::2]) |
s093837257 | p03486 | u941644149 | 1591037403 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 240 | s = sorted(input())
t = sorted(input(),reverse=True)
flag = -1
i = 0
while(i < len(s)):
if s[i] > t[i]:
flag = -1
break
elif s[i] < t[i]:
flag = 1
break
else:
i += 1
if flag == 1: print("Yes")
else: print("No")
|
s331202644 | p03486 | u294385082 | 1590985281 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 357 | s = list(input())
t = list(input())
for i in range(101):
if min(s) > max(t):
print('No')
exit()
elif min(s) == max(t):
s.remove(min(s))
t.remove(max(t))
if s == [] and t != []:
print('Yes')
exit()
elif s == [] and t == []:
print('No')
exit()
if min(s) < ... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.