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 |
|---|---|---|---|---|---|---|---|---|---|---|---|
s045604527 | p03486 | u100800700 | 1567869799 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 86 | s = input().sorted
t = input().sorted
if s < t:
print('Yes')
else:
print('No') |
s414880747 | p03486 | u611562941 | 1567656542 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 489 | s = list(input())
t = list(input())
s.sort()
t.sort()
sf1 = s[0]
sf2 = s[1]
tf1 = t[-1]
tf2 = t[-2]
sres1 = 0
sres2 = 0
tres1 = 0
tres2 = 0
A = "abcdefghijklmnopqrstuvwxyz"
for i,x in enumerate(A):
if sf1 == x:
sres1 = i
if sf2 == x:
sres2 = i
if tf1 == x:
tres1 = i
if tf2 == x:... |
s832113718 | p03486 | u636822224 | 1567619421 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 184 | s=list(input())
s.sort()
t=list(input())
t.sort()
for i in range(len(s)):
if s[i]<t[i]:
print('Yes')
break
elif s[i]==t[i]:
continue
else:
print('No')
break |
s823136800 | p03486 | u636822224 | 1567619119 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 179 | s=list(input())
s.sort()
t=list(input())
t.sort()
for i in range(len(s)):
if s[i]<t[i]:
print('Yes')
break
elif s[i]==t[i]:
pass
else:
print('No')
break |
s418453929 | p03486 | u636822224 | 1567619001 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 160 | s=list(input())
t=list(input())
for i in range(len(s)):
if s[i]<t[i]:
print('Yes')
break
elif s[i]==t[i]:
pass
else:
print('No')
break |
s682813670 | p03486 | u164261323 | 1567456346 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 75 | print("Yes" if sorted(int(input())) < sorted(int(input()))[::-1] else "No") |
s253564270 | p03486 | u799479335 | 1567355540 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 384 | s = input()
t = input()
length = min(len(s),len(t))
sorted_s = sorted(s)
soreted_t = sorted(t)[::-1]
flag = True
for i in range(length):
if sorted_s[i] == sorted_t[i]:
pass
elif sorted_s[i] < sorted_t[i]:
print('Yes')
flag = False
break
else:
print('No')
flag = False
break
if flag:... |
s508820367 | p03486 | u799479335 | 1567355379 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 320 | s = input()
t = input()
length = min(len(s),len(t))
sorted_s = sorted(s)
soreted_t = sorted(t)[::-1]
for i in range(length):
if sorted_s[i] == sorted_t[i]:
pass
elif sorted_s[i] < sorted_t[i]:
print('Yes')
break
else:
print('No')
break
if len(s) < len(t):
print('Yse')
else:
print('No') |
s667524313 | p03486 | u455533363 | 1566850569 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 157 |
s = input()
s_asc = ''.join(sorted(s))
t = input()
t_dsc = ''.join(sorted(t, reverse = True))
if s_asc < t_dsc:
print('Yes')
else:
print('No')
|
s806599271 | p03486 | u640603056 | 1566755584 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 224 | s = sorted(list(input()))
t = sorted(list(input()), reverse = 1)
for i in range(len(s)):
if s[i] < t[i]:
print("Yes")
break
else:
if len(s) < len(t):
print("Yes")
else:
print("No") |
s014772336 | p03486 | u243572357 | 1566308865 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 97 | s, t = [input() for _ in range(2)]
jprint('Yes' if sorted(s) < sorted(t, reverse=True) else 'No') |
s435394594 | p03486 | u493491792 | 1566191274 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 230 | s=sorted(input())
t=sorted(input(),reverse=True)
lista=list()
for i in s:
c=c+i
for x in t:
d=d+x
lista.append(c)
lista.append(d)
if s==t:
print("No")
elif lista==sorted(lista):
print("Yes")
else:
print("No") |
s910305967 | p03486 | u989345508 | 1566136374 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 358 | s="".join(sorted(list(input())))
t="".join(sorted(list(input()),reverse=True))
if len(s)<len(t) and s==t[:len(s)]:
print("Yes")
else:
for i in range(len(s)):
if s[i]!=t[i]:
if s[i]<t[i]:
print("Yes")
else:
print("No")
break
if... |
s564847461 | p03486 | u578146839 | 1566133858 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 180 | s=input()
t=input()
s.sort()
s=''.join(s)#辞書順最小=辞書で一番最初
t.sort()
t.reverse()
t=''.join(t)#辞書順最大
if s<t:
print('Yes')
else:
print('No')
|
s301503421 | p03486 | u131634965 | 1566063059 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 117 | ss = ''.join(sorted(input()))
tt = ''.join(sorted(t, reverse=True))
if ss<tt:
print("Yes")
else:
print("No") |
s136284771 | p03486 | u105124953 | 1566007602 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 377 | s = input()
t = input()
alp = 'abcdefghijklmnopqrstuvwxyz'
s_li = []
for si in s:
s_li.append(alp.find(si))
t_li = []
for ti in t:
t_li.append(alp.find(ti))
if max(s_li) < max(t_li):
print('Yes')
elif max(set(s_li)-set(t_li)) < max(set(t_li)-set(s_li)):
print('Yes')
elif set(s_li) == set(t_li) and len(s... |
s505936577 | p03486 | u260036763 | 1565908672 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | s = input()
t = input()
s.sort()
t.sort()
t.reverse()
if s < t:
print('Yes')
else:
print('No') |
s184504016 | p03486 | u598229387 | 1565886783 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 103 | s = input()
t = input()
print('Yes' if ''.join(sorted(s)) < ''.join(sorted(t,reverse=True) else 'No')
|
s998266942 | p03486 | u791527495 | 1565817515 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 158 | s = input()
t = input()
new_s = s.sort()
new_t = t.sort(reverse = True)
js = ''.join(new_s)
jt = ''.join(new_t)
if js > jt:
print('Yes')
else:
print('No') |
s367184870 | p03486 | u791527495 | 1565817117 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 170 | s = list(input())
t = list(input())
new_s = s.sort()
new_t = t.sort(reverse = True)
js = ''.join(new_s)
jt = ''.join(new_t)
if js > jt:
print('Yes')
else:
print('No') |
s873641127 | p03486 | u842388336 | 1565759002 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 214 | a=list(input())
b=lsit(input())
if a==b:
print("No")
else:
a.sort()
a="".join(a)
b.sort()
b=b[::-1]
b="".join(b)
list_ = [a,b]
list_.sort()
if list_[0]==a:
print("Yes")
else:
print("No") |
s967747282 | p03486 | u842388336 | 1565758820 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 166 | a=input()
b=input()
if a==b:
print("No")
else:
a.sort()
b.sort()[::-1]
list_ = [a,b]
list_.sort()
if list_[0]==a:
print("Yes")
else:
print("No") |
s622596319 | p03486 | u651879504 | 1565729681 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 408 | s = input()
t = input()
t1 = sorted(t,reverse=True)
s1 = sorted(s)
print(s1,t1)
hantei = 0
count = 0
for i in range(len(s1)):
count += 1
if t1[i] > s1[i]:
hantei = 1
break
elif t1[i] < s1[i]:
break
elif count == len(s1):
hantei = 1
break
if hantei == 1:
pr... |
s386886742 | p03486 | u651879504 | 1565729422 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3064 | 254 | s = input()
t = input()
t1 = sorted(t,reverse=True)
s1 = sorted(s)
hantei = 0
for i in range(len(s1)):
if t1[i] > s1[i]:
hantei = 1
break
elif t1[i] < s1[i]:
break
if hantei == 1:
print("Yes")
else:
print("No") |
s519793203 | p03486 | u823044869 | 1565623748 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 147 | s = input()
t = input()
s_sort = sorted(s,reverse=True)
t_sort = sorted(t,reverse= True)
if s_sort < t_sort:
print('Yes')
else:
print('No |
s048670419 | p03486 | u901687869 | 1565449414 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 96 | a = input()
b = input()
c = a.sort()
d = b.sort()
if c < d:
print("Yes")
else:
print("No") |
s323580513 | p03486 | u736729525 | 1564709142 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 87 | A = sorted(input())
B = sorted(input(), revese=True)
print("Yes" if A < B else "No")
|
s515008681 | p03486 | u736729525 | 1564709096 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | A = sorted(input())
B = sorted(input(), reversed=True)
if A < B:
print("Yes")
else:
print("No") |
s209413517 | p03486 | u908763441 | 1564708003 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 129 | s = input()
t = input()
S = ''.join(list(sorted(s)))
T = ''.join(list(sorted(t,reverse = true)))
print("Yes" if S < T else "No")
|
s191308052 | p03486 | u908763441 | 1564706953 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 113 | s = input()
t = input()
S = ''.join(sort(list(s)))
T = ''.join(reverse(list(t)))
print("Yes" if S < T else "No")
|
s477262917 | p03486 | u908763441 | 1564706813 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 116 | s = input()
t = input()
S = ''.join(reverse(list(s)))
T = ''.join(reverse(list(t)))
print("Yes" if S < T else "No")
|
s877094208 | p03486 | u908763441 | 1564706652 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 111 | s = input()
t = input()
S = ''.join(list(s).sort)
T = ''.join(list(t).reverse)
print("Yes" if S < T else "No")
|
s097768424 | p03486 | u506910932 | 1564597613 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3188 | 209 | s = [i for i in input().strip()]
t = [i for i in input().strip()]
s.sort()
t.sort(reverse=True)
#print(s)
#print(t)
for i in range(len(s)):
if s[i] < t[i]:
print("Yes")
exit()
print("No") |
s905763885 | p03486 | u333190709 | 1564401912 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38256 | 108 | s = input()
t = input()
s = sorted(s)
t = reversed(sorted(t))
if s < t:
print('Yes')
else:
print('No') |
s930694202 | p03486 | u626337957 | 1564351286 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 306 | s = input()
t = input()
s.sort()
t.sort(key=lambda x:-x)
for i in range(len(t)):
if i > len(s)-1:
print('Yes')
exit()
elif s[i] == t[i]:
continue
elif s[i] > t[i]:
print('No')
exit()
else:
print('Yes')
exit()
if len(t) > len(s):
print('Yes')
else:
print('No')
|
s395059398 | p03486 | u580327099 | 1563406577 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 488 | #!/usr/bin/env python3
# -*- coding: utf-8 -*-
import sys
input = sys.stdin.readline
def main():
s = list(input().strip())
t = list(input().strip())
s.sort()
t.sort(reverse=True)
min_len = min(len(s), len(s))
same = True
for i in range(min_len):
if s[i] < t[i]:
print(... |
s457895179 | p03486 | u281216592 | 1563271515 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3188 | 489 | s = sorted(list(input()))
t = sorted(list(input()))
ns = len(s)
nt = len(t)
can = True
if(ns<nt):
for i in range(ns):
if(s[i] > t[i]):
can = False
break
if(s[i] < t[i]):
can = True
break
else:
can = False
for i in range(nt):
if(s[i] > t... |
s946087140 | p03486 | u281216592 | 1563271292 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 481 | s = list(input()).sort()
t = list(input()).sort()
ns = len(s)
nt = len(t)
can = True
if(ns<nt):
for i in range(ns):
if(s[i] > t[i]):
can = False
break
if(s[i] < t[i]):
can = True
break
else:
can = False
for i in range(nt):
if(s[i] > t[i... |
s985604716 | p03486 | u281216592 | 1563269969 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 231 | s = input().split().sort()
t = input().split().sort()
ns= len(s)
nt= len(t)
can = True
for i in range(min(ns,nt)):
if(s[i] > t[i]):
can = False
break
if(can and ns < nt):
print('Yes')
else:
print('No')
|
s770210149 | p03486 | u502028059 | 1563057064 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 127 | s = list(input())
t = list(input())
s = "".join(s.sort())
t = "".join(t.sort())
ans = 'No'
if s < t:
ans = 'Yes'
print(ans) |
s720464842 | p03486 | u292735000 | 1562260932 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 419 | s = input()
t = input()
s_list = list(s)
t_list = list(t)
s_list.sort()
t_list.sort()
for i in range(min(len(s_list), len(t_list))):
if s_list[i] < t_list[i]:
print('Yes')
break
elif s_list[i] > t_list[i]
print('No')
break
else:
if i == min(len(s_list), len(t_list)):
if len(s_list... |
s281991929 | p03486 | u026155812 | 1561478125 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 102 | s, t = input(), input()
s.sort()
t.sort(reverse=True)
if s < t:
print('Yes')
else:
print('No') |
s607693504 | p03486 | u260036763 | 1561229772 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 152 | s = list(input())
t = list(input())
s = s.sort()
t = t.sort()
t = t.reverse()
s = ''.join(s)
t = ''.join(t)
if s < t:
print('Yes')
else:
print('No') |
s660032948 | p03486 | u260036763 | 1561229644 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 154 | s = list(input())
t = list(input())
s = s.sort()
t = t.sort()
t = t.reverse()
s = ''.join(s)
t = ''.join(t)
if s < t :
print('Yes')
else :
print('No') |
s036111083 | p03486 | u260036763 | 1561229565 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 155 | s = list(input())
t = list(input())
s = s.sort()
t = t.sort()
t = t.reverse()
s = ''.join(s)
t = ''.join(t)
if s < t :
print('Yes')
else :
print('No') |
s729947510 | p03486 | u167931717 | 1561000672 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3572 | 3703 | ###############################################################################
from sys import stdout
from bisect import bisect_left as binl
from copy import copy, deepcopy
from collections import defaultdict
import math
mod = 1
def intin():
input_tuple = input().split()
if len(input_tuple) <= 1:
... |
s581743421 | p03486 | u813569174 | 1560888311 | Python | Python (3.4.3) | py | Runtime Error | 22 | 3444 | 492 | s = input()
t = input()
s1 = [str(a) for a in s]
t1 = [str(a) for a in t]
s1.sort()
t1.sort()
import copy
t2 = copy.copy(t1)
for i in range(len(t1)):
t1[i] = t2[len(t1)-i-1]
n = 0
l = 0
i = 0
while n==0 and i <= min(len(t),len(s)):
if s1[i] == t1[i]:
l = l + 1
i = i + 1
elif s1[i] < t1[i]:
n = n + 1
... |
s727083151 | p03486 | u813569174 | 1560887522 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 590 | s = input()
t = input()
s1 = [str(a) for a in s]
t1 = [str(a) for a in t]
s1.sort()
t1.sort()
import copy
t2 = copy.copy(t1)
for i in range(len(t1)):
t1[i] = t2[len(t1)-i-1]
if len(s) < len(t):
k = 0
for i in range(len(s)):
if s1[i] == t1[i]:
k = k + 1
if k = len(s):
print('Yes')
else:
print... |
s709621054 | p03486 | u813569174 | 1560887298 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 590 | s = input()
t = input()
s1 = [str(a) for a in s]
t1 = [str(a) for a in t]
s1.sort()
t1.sort()
import copy
t2 = copy.copy(t1)
for i in range(len(t1)):
t1[i] = t2[len(t1)-i-1]
if len(s) < len(t):
k = 0
for i in range(len(s)):
if s1[i] == t1[i]:
k = k + 1
if k = len(s):
print('Yes')
else:
print... |
s815395052 | p03486 | u083668616 | 1559747963 | Python | PyPy3 (2.4.0) | py | Runtime Error | 162 | 38256 | 336 | s = input()
t = input()
slist = []
for i in range(0, len(s)):
slist.append(s[i])
tlist = []
for i in range(0, len(t)):
slist.sort()
tlist.sort(reverse = True)
news = ''
for i in range(0, len(slist)):
news = news + slist[i]
newt = ''
for i in range(0, len(tlist)):
newt = newt + tlist[i]
if news < newt: print('Yes')
e... |
s836916513 | p03486 | u591779169 | 1559661210 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 369 | s = list(input())
t = list(input())
s.sort()
t.sort()
t.reverse()
for i in range(len(s)):
if s[len(s)-1] == t[len(s)-1]:
if len(s) < len(t):
print("Yes")
else:
print("No")
break
if s[i] < t[i]:
print("Yes")
break
elif s[i] == t[i]:
cont... |
s458672649 | p03486 | u405256066 | 1559013846 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 187 | from sys import stdin
s = "".join(sorted(list(stdin.readline().rstrip())))
t = "".join(reversed((sorted(list(stdin.readline().rstrip()))))
if s < t:
print("Yes")
else:
print("No") |
s273963343 | p03486 | u266874640 | 1558806752 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 618 | s = list(input())
t = list(input())
a = 0
s.sort()
t.sort()
t = t[::-1]
if len(s) < len(t):
for i in range(len(s)):
if s[i] < t[i]:
print("Yes")
break
elif s[i] == t[i]:
a += 1
continue
else:
print("No")
break
if a... |
s951494579 | p03486 | u977193988 | 1557793167 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 376 | s=list(input())
t=list(input())
s.sort()
t.sort(reverse=True)
count=0
for i in range(len(s)):
if s[i]==t[i]:
count=1
continue
elif s[i]<t[i]:
count=2
break
else:
count=0
break
if count==1:
if len(s)<len(t):
print('Yes')
else:
print('No'... |
s377158720 | p03486 | u977193988 | 1557792753 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 376 | s=list(input())
t=list(input())
s.sort()
t.sort(reverse=True)
count=0
for i in range(len(s)):
if s[i]==t[i]:
count+=1
continue
elif s[i]<t[i]:
print('Yes')
count=0
break
else:
print('No')
count=0
break
if count!=0 and len(s)<len(t):
print('... |
s550653627 | p03486 | u382431597 | 1557677588 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 281 | import sys
s = input().sort()
t = input().sort(reverse = True)
for i in range(min(len(s),len(t))):
if ord(s[i]) < ord(t[i]):
print("Yes")
sys.exit()
elif ord(s[i]) > ord(t[i]):
print("No")
sys.exit()
print("Yes" if len(s) < len(t) else "No") |
s196227597 | p03486 | u516272298 | 1556938133 | Python | Python (3.4.3) | py | Runtime Error | 24 | 3064 | 374 | s = sorted(str(input()))
t = sorted(str(input()))[::-1]
a = ["a","b","c","d","e","f","g","h","i","j","k","l","m","n","o","p","q","r","s","t","u","v","w","x","y","z"]
for i in range(len(s)):
if t[i] > s[i]:
print("Yes")
break
elif len(set(s)) == len(set(t)):
if len(s) < len(t):
... |
s510221588 | p03486 | u166621202 | 1556804652 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 137 | S=input()
T=input()
s = ''.join(sorted(list(S))
t = ''.join(sorted(list(T), reverse=True))
if s < t:
print('Yes')
else:
print('No') |
s951396280 | p03486 | u657611449 | 1556593934 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 349 | S = input()
T = input()
s1 = [ord(s) - ord('a') for s in S]
t1 = [ord(t) - ord('a') for t in T]
s1.sort()
t1.sort(reverse=True)
print(s1, t1)
for i, j in zip(s1, t1):
if i < j:
print('Yes')
return
if (len(s1) < len(t1)) & (i > j):
print('No')
return
elif (len(s1) < len(t1)):
print('... |
s491382761 | p03486 | u431475157 | 1556580281 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 99 | s=list(input())
t=list(input())
s.sort()
t.sort(reverse)
if s<t:
print("Yes")
else:
print("No") |
s917955962 | p03486 | u902151549 | 1555794129 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3060 | 117 | import math
s=input()
t=input()
s=sorted(s)
t=sorted(s,reverse=True)
if s<n:
print("Yes")
else :
print("No") |
s199332628 | p03486 | u902151549 | 1555793621 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 100 | import math
s=input()
t=input()
s.sort()
t.sort()
t.reverse()
s<t if print("Yes") else print("No") |
s407049606 | p03486 | u722189950 | 1555640886 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 508 | #ABC082C
N = int(input())
remove_count = 0
number_count = 1
a = list(map(int, input().split()))
a.sort()
for i in range(N-1):
if a[i] == a[i+1] and i > N-2:
number_count += 1
elif number_count < a[i]:
remove_count += number_count
number_count = 1
elif number_count > a[i]:
... |
s656746060 | p03486 | u145889196 | 1554754604 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 181 | A=sorted(list(input()))
B=sorted(list(input()))
if len(A)<=len(B):
for i in range len(A)-1:
if A(i)<=B(i):
print("Yes")
else:
print("No") |
s000484490 | p03486 | u844005364 | 1554649718 | Python | PyPy3 (2.4.0) | py | Runtime Error | 168 | 38640 | 87 | a = input()
b = input()
a.sort()
b.sort(reverse=True)
print("Yes" if a < b else "No") |
s024096881 | p03486 | u844005364 | 1554649660 | Python | PyPy3 (2.4.0) | py | Runtime Error | 171 | 38996 | 95 | a = input()
b = input()
x = a.sort()
y = b.sort(reverse=True)
print("Yes" if x < y else "No") |
s746248962 | p03486 | u778814286 | 1554598772 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 604 | s = input()
t = input()
S = []
T = []
for i in range(len(s)):
S.append(ord(s[i:i+1]))
for i in range(len(t)):
T.append(ord(t[i:i+1]))
S = sorted(S)
T = sorted(T, reverse=True)
for i in range(100-len(S)):
S.append(0)
for i in range(100-len(T)):
T.append(0)
for i in range(max(len(s),len(t))+1):
if ... |
s205552602 | p03486 | u859897687 | 1554436830 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 230 | a=input()
m=[a[i] for i in range(len(a))]
b=input()
n=[b[i] for i in range(len(b))]
m.sort()
n.sort(reverse=1)
i=0
while 1>0:
if i==len(b):
print("No")
break
if m[i]<n[i] or i==len(a):
print("Yes")
break
i+=1 |
s448076517 | p03486 | u859897687 | 1554436409 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 223 | a=input()
m=[a[i] for i in range(len(a))]
b=input()
n=[b[i] for i in range(len(b))]
m.sort()
n.sort()
i=0
while 1>0:
if m[i]<n[i]:
print("Yes")
break
if i==len(a) or i==len(b):
print("No")
break
i+=1
|
s089547183 | p03486 | u381602071 | 1554082406 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 211 | s = list(input())
t = list(input())
s.sort()
t.sort()
t.reverse()
result = ""
for i in range(len(s)):
if s[i] < t[i]:
result = "Yes"
break
if result == "":
result = "No"
print(result) |
s106783717 | p03486 | u514299323 | 1553900861 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3060 | 249 | s = str(input())
t = str(input())
s_ = list(s)
t_ = list(t)
s_.sort()
t_.sort(reverce = True)
s_sorted = ""
for S in s_:
s_sorted += S
t_sorted =""
for T in t_:
t_stored += T
if s_sorted < t_sorted:
print('Yes')
else:
print('No')
|
s576025957 | p03486 | u366959492 | 1553739838 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 104 | s=input()
t=input()
ss=sorted(s)
tt=sorted(t,reversed)
if ss<tt:
print("Yes")
else:
print("No")
|
s079550860 | p03486 | u549497563 | 1553719698 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 311 | s = list(input())
t = list(input())
s = sorted(s)
t = sorted(t,reverse=True)
for i in range(len(s)):
if ord(s[i])<ord(t[i]):
print("Yes")
exit()
elif ord(s[i])>ord(t[i]):
print("No")
exit()
else:
if len(t)-len(s)>0:
print("Yes")
else:
print("No") |
s671143823 | p03486 | u549497563 | 1553719334 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 311 | s = list(input())
t = list(input())
s = sorted(s)
t = sorted(t,reverse=True)
for i in range(len(s)):
if ord(s[i])<ord(t[i]):
print("Yes")
exit()
elif ord(s[i])>ord(t[i]):
print("No")
exit()
else:
if len(t)-len(s)>0:
print("Yes")
else:
print("No") |
s282305814 | p03486 | u013408661 | 1553568157 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3060 | 117 | s=input()
s_=sorted(s)
s=''.join(s_)
t=input()
t_=sorted(t)
t=''.joint(t_)
if s<t:
print('Yes')
else:
print('No') |
s837242161 | p03486 | u319818856 | 1552939643 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 955 | def two_anagrams(s: str, t: str) -> bool:
'''s を並び替えた実現可能な最小の文字列 s' と t を並び替えて
実現可能な最小の文字列 t' に関して、s' < t' が成り立てば良い。
'''
sn, tn = len(s), len(t)
sd, td = sorted(s), sorted(t, reverse=True)
idx = 0
while idx < sn and idx < tn:
# idx-1 番目の文字までは同じと仮定する。
if sn[idx] < tn[idx]:
... |
s799286342 | p03486 | u652057333 | 1552615751 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 290 | %%test_input https://atcoder.jp/contests/abc082/tasks/abc082_b
#B
import collections
s = str(input())
t = str(input())
sd = list(s)
td = list(t)
sd.sort()
td.sort(reverse=True)
a = ''
b = ''
for c in sd:
a += c
for c in td:
b += c
if sd < td:
print('Yes')
else:
print('No') |
s094240982 | p03486 | u187205913 | 1550931604 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 168 | s = input()
t = input()
exit()
s = list(s)
t = list(t)
s_ = sorted(s)
t_ = sorted(t)
t_.reverse()
if ''.join(s_)<''.join(t_):
print('Yes')
else:
print('No') |
s500412553 | p03486 | u187205913 | 1550931506 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 293 | s = input()
t = input()
if s==t:
print('No')
exit()
s = list(s)
t = list(t)
s_ = sorted(s)
t_ = sorted(t)
t_.reverse()
print(s_)
print(t_)
for i in range(len(s_)):
if s[i]<t[i]:
print('Yes')
exit()
elif s[i]>t[i]:
print('No')
exit()
print('Yes') |
s747445349 | p03486 | u976256337 | 1550632845 | Python | Python (3.4.3) | py | Runtime Error | 19 | 3188 | 348 | import sys
def main(lines):
s, t = lines.split('\n')
s_ = ''
for i in sorted(s):
s_ += i
t_ = ''
for i in sorted(t, reverse=True):
t_ += i
if s_ < t_:
return 'Yes'
else:
return 'No'
if __name__ == '__main__':
lines_ = sys.stdin.readlines()
ret =... |
s783554277 | p03486 | u886112691 | 1550598105 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 378 | s=input();t=input()
s=sorted(s)
t=sorted(t)
tnew=[]
for i in range(len(t)-1,-1,-1):
#print(i)
tnew.append(t[i])
cnt=0
for i in range(len(s)):
if s[i]<tnew[i]:
print('Yes')
cnt=1
break
if s[i]>tnew[i]:
print('No')
cnt=1
break
if cnt==0:
if len(tnew)>... |
s931479906 | p03486 | u740284863 | 1550196456 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 456 | s = str(input())
s = sorted([s[i] for i in range(len(s))])
t = str(input())
t = sorted([t[i] for i in range(len(t))],reverse=True)
if len(t) < len(s):
for i in range(len(t)):
if s[i] == t[i]:
i += 1
if s[i] < t[i]:
print("Yes")
exit()
print("No")
else:
s ... |
s027678495 | p03486 | u740284863 | 1550196355 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 458 | s = str(input())
s = sorted([s[i] for i in range(len(s))])
t = str(input())
t = sorted([t[i] for i in range(len(t))],reverse=True)
if len(t) < len(s):
for i in range(len(t)):
if s[i] == t[i]:
i += 1
if s[i] < t[i]:
print("Yes")
exit()
print("No")
else:
s ... |
s409915997 | p03486 | u951601135 | 1549738608 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 406 | s=sorted(list(input()))
t=sorted(list(input()))[::-1]
#print(s,t)
for i in range(len(s)):
if(s[i]<t[i]):
print('Yes')
break
elif(s[i]>t[i]):
print('No')
break
else:
if(i<len(s)-1):pass
else:#sの長さまでは同じ。sの方が短ければYes、そうでなければNo
if(len(s)<len(t)):
print('Yes')
break
e... |
s962762606 | p03486 | u951601135 | 1549738573 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 427 | s=sorted(list(input()))
t=sorted(list(input()))[::-1]
#print(s,t)
for i in range(len(s)):
if(s[i]<t[i]):
print(s[i],t[i])
print('Yes')
break
elif(s[i]>t[i]):
print('No')
break
else:
if(i<len(s)-1):pass
else:#sの長さまでは同じ。sの方が短ければYes、そうでなければNo
if(len(s)<len(t)):
print('Yes')
... |
s038919386 | p03486 | u551351897 | 1549568796 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 482 | s=input()
t=input()
sl = [s[i] for i in range(len(s))]
tl = [t[i] for i in range(len(t))]
n = len(sl)
m = len(tl)
sl.sort()
tl.sort(reverse=True)
flg1 = False
flg2 = False
if n < m:
for i in range(n):
if sl[i] != tl[i]:
flg1 = False
break
flg1 = True
for i in range(n):
if... |
s784224135 | p03486 | u551351897 | 1549568540 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 400 | s=input()
t=input()
sl = [s[i] for i in range(len(s))]
tl = [t[i] for i in range(len(t))]
n = len(sl)
m = len(tl)
sl.sort()
tl.sort(reverse=True)
flg = False
if n < m:
for i in range(n):
if sl[i] != tl[i]:
flg = False
break
flg = True
for i in range(n):
if sl[i] < tl[i]:... |
s974425112 | p03486 | u875028418 | 1549326734 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 111 | in1.sort() = [c for c in input()]
in2.sort(reversed=1) = [c for c in input()]
print("Yes" if in1<in2 else "No") |
s476221635 | p03486 | u875028418 | 1549325942 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 91 | print("Yes" if [c for c in input()].sort()<[c for c in input()].sort(reversed=1) else "No") |
s703136345 | p03486 | u875028418 | 1549325911 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 91 | print("Yes" if [c for c in input()].sort()<[c for c in input()].sort(reversed=1) else "No"
|
s039592907 | p03486 | u801512570 | 1549075103 | Python | Python (3.4.3) | py | Runtime Error | 18 | 2940 | 83 | s = input()
t = input()
s.sort()
t.sort(reverse=True)
print('Yes' if s<t else 'No') |
s892933217 | p03486 | u950708010 | 1546980413 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 361 | from sys import stdin
s = stdin.readline().rstrip()
t = stdin.readline().rstrip()
sa = ''.join(sorted(s))
ts = ''.join(sorted(t,reverse=True))
ans = 'No'
for i in range(len(s)):
if ord(sa[i]) < ord(ts[i]):
ans = 'Yes'
break
elif sa[i] == ts[i]:
if len(s) == i+1:
if len(t) > len(s):
ans = 'Ye... |
s239239239 | p03486 | u127856129 | 1546741630 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 255 | #include<iostream>
#include<string>
using namespace std;
int main(){
string a,b;
cin>>a>>b;
sort(a.begin(),a.end());
sort(b.begin(),b.end());
reverse(b.begin(),b.end());
if(a<b)
cout << "Yes" << endl;
else
cout << "No" << endl;
} |
s105997305 | p03486 | u826263061 | 1542506928 | Python | Python (3.4.3) | py | Runtime Error | 17 | 2940 | 98 | s = input()
t = input()
s.sort()
t.sort(reverse=True)
if s < t:
print('Yes')
else:
print('No') |
s910099522 | p03486 | u423624748 | 1541822251 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 227 | s=input()
t=input()
S=list(s)
T=list(t)
S.sort()
T.sort()
T.reverse()
s=str(S)
t=str(T)
i=0
a=False
for wer in range( len(S) ):
if S[i]<T[i]:
a=True
break
i+=1
if a:print("Yes")
else :print("No") |
s249806058 | p03486 | u423624748 | 1541800037 | Python | Python (3.4.3) | py | Runtime Error | 20 | 3060 | 173 | s=input()
t=input()
S=list(s)
T=list(t)
S.sort()
T.sort()
T.reverse()
s=str(S)
t=str(T)
a=True
for i in range(10):
if s[i]>t[i]:
a=False
if a: print("Yes")
|
s144858083 | p03486 | u423624748 | 1541799989 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 264 | s=input()
t=input()
S=list(s)
T=list(t)
S.sort()
T.sort()
T.reverse()
s=str(S)
t=str(T)
for char in S:
print(char,end="")
print()
for char in T:
print(char,end="")
print()
a=True
for i in range(10):
if s[i]>t[i]:
a=False
if a: print("Yes")
|
s756829141 | p03486 | u273201018 | 1541630621 | Python | Python (3.4.3) | py | Runtime Error | 25 | 3892 | 499 | import string
S = list(input())
T = list(input())
L = list(string.ascii_lowercase)
S = [L.index(s) for s in S]
T = [L.index(t) for t in T]
S.sort()
T.sort()
T.reverse()
while True:
if len(S) == 0:
if len(T) > 0:
print('Yes')
break
else:
print('No')
... |
s908106722 | p03486 | u879870653 | 1539772269 | Python | Python (3.4.3) | py | Runtime Error | 18 | 3064 | 430 | S = list(input())
T = list(input())
S = sorted(S)
T = sorted(T,reverse = True)
counter = 0
for i in range(len(S)) :
if S[i] > T[i] :
print("No")
break
elif S[i] < T[i] :
print("Yes")
break
else :
counter += 1
if counter == len(S) :
if len(S) >= len(T) :
... |
s333828457 | p03486 | u513081876 | 1539271141 | Python | Python (3.4.3) | py | Runtime Error | 17 | 3064 | 432 | s = sorted(input())
t = sorted(input(), reverse = True)
jud = False
if len(s) < len(t):
for i in range(len(s)):
if ord(s[i]) > ord(t[i]):
break
jud = True
else:
for i in range(len(s)):
count = 0
if ord(s[i]) < ord(t[i]):
count += 1
elif ord(s[i]) > or... |
Subsets and Splits
No community queries yet
The top public SQL queries from the community will appear here once available.