Clean, (削除) 420 (削除ここまで) ... 358368 bytes
import StdEnv,StdLib
l=length
%q=any((==)q)
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:map snd b]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l>=l b&&l b>1)($s)
|r>[]#h=hd r
#t=#t=take(l h)(?h i)
=f[if(%n t)(h!!hd(elemIndices n t))c\\(n,c)<-i|not(%n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) ... 358 bytes
import StdEnv,StdLib
l=length
%q=any((==)q)
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:map snd b]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?h i
=f[if(%n t)(h!!hd(elemIndices n t))c\\(n,c)<-i|not(%n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) ... 368 bytes
import StdEnv,StdLib
l=length
%q=any((==)q)
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:map snd b]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)>=l b&&l b>1)($s)
|r>[]#h=hd r
#t=take(l h)(?h i)
=f[if(%n t)(h!!hd(elemIndices n t))c\\(n,c)<-i|not(%n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) (削除) 385 (削除ここまで) 369... 358 bytes
Still much golfing to be done.
import StdEnv,StdLib
l=length
q=isMember%q=any((==)q)
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:map snd(unzip b)]=[yb]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a-> \b=lb=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?(hdh r)i
=f[if(q n%n t)(h!!(hd(elemIndices n t)))c\\(n,c)<-i|not(q n[u+v\\u<%n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) (削除) 385 (削除ここまで) 369 bytes
Still much golfing to be done.
import StdEnv,StdLib
l=length
q=isMember
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:snd(unzip b)]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a-> \b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?(hd r)i
=f[if(q n t)(h!!(hd(elemIndices n t)))c\\(n,c)<-i|not(q n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) ... 358 bytes
import StdEnv,StdLib
l=length
%q=any((==)q)
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:map snd b]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?h i
=f[if(%n t)(h!!hd(elemIndices n t))c\\(n,c)<-i|not(%n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) 385(削除) 385 (削除ここまで) 369 bytes
Still much golfing to be done.
import StdEnv,StdLib
l=length
q=isMember
?_[]=[]
?a[(x,y,x):b]|isPrefixOf a[x:fstsnd(unzip b)]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a-> \b=l a>l b)(removeDup(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]]))
@s#i=zip(s,[0f s#i=zip2[0..])]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?(hd r)i
= @[if=f[if(isMemberq n t)(h!!(hd(elemIndices n t)))c\\(c,n,c)<-i|not(isMemberq n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) 385 bytes
Still much golfing to be done.
import StdEnv,StdLib
l=length
?_[]=[]
?a[(x,y):b]|isPrefixOf a[x:fst(unzip b)]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a-> \b=l a>l b)(removeDup(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]]))
@s#i=zip(s,[0..])
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?(hd r)i
= @[if(isMember n t)(h!!(hd(elemIndices n t)))c\\(c,n)<-i|not(isMember n[u+v\\u<-t,v<-[1..l h-1]])]=s
Clean, (削除) 420 (削除ここまで) (削除) 385 (削除ここまで) 369 bytes
Still much golfing to be done.
import StdEnv,StdLib
l=length
q=isMember
?_[]=[]
?a[(y,x):b]|isPrefixOf a[x:snd(unzip b)]=[y: ?a(drop(l a-1)b)]= ?a b
$s=sortBy(\a-> \b=l a>l b)(flatten[[b: $a]\\(a,b)<-map((flip splitAt)s)[0..l s-1]])
f s#i=zip2[0..]s
#r=filter(\b=l(?b i)==l b&&l b>1)($s)
|r>[]#h=hd r
#t= ?(hd r)i
=f[if(q n t)(h!!(hd(elemIndices n t)))c\\(n,c)<-i|not(q n[u+v\\u<-t,v<-[1..l h-1]])]=s