- 153 名前：デフォルトの名無しさん mailto:sage [2007/01/06(土) 05:53:37 ]
- >>152
Fortranで挑戦、途中で挫折・・・
その後、rubyで作成しました。
あいうえおかきく→abcdefghと置き換えて
tree[]にabc...fghの値を入れると答えを見つけてくれます
#------------------------------
a=0; b=1; c=2; d=3; e=4; f=5; g=6; h=7;
null = nil
$ans = []
# a,b,c,d,e,f,g,h
tree=[1,2,3,4,5,6,7,8]
aa = [b,c]; bb = [e,d]
cc = [d,h]; dd = [g,null]
ee = [f,null]; ff = [f,null]
gg = [g,null]; hh = [h,null]
node = [aa,bb,cc,dd,ee,ff,gg,hh]
def len(tree,node,i,n)
tree[i]*tree[node[i][n]]
end
def path(x)
pair = ["a","b","c","d","e","f","g","h"]
pair[x]
end
|
 |
