約 4,099,588 件
https://w.atwiki.jp/ce00582/pages/46.html
Private Sub Command1_Click() Dim ks As Single Dim a As Single Dim beta As Single Dim r1 As Single Dim n As Single Dim cx(1 To 10, 1 To 100) As Single Dim cp(1 To 10, 1 To 100) As Single Dim k(1 To 100) As Single Dim h As Single Dim k1 As Single Dim n1 As Single Dim n2 As Single Dim n3 As Single Dim c1 As Single Dim e As Single Dim m As Single Dim de As Single Dim th(1 To 10) As Single de = 0.05 For m = 1 To 10 th(m) = 0.95 + 0.01 * m Next de = 0.05 beta = 0.95 a = 0.33 ks = ((1 / beta + de - 1) / a) ^ (1 / (a - 1)) Debug.Print ks h = 2 * ks / 100 For n = 1 To 100 k(n) = n * h For m = 1 To 10 cx(m, n) = th(m) * k(n) ^ a - de * k(n) Next Next t1 = 0 Do Until t1 100 For m = 1 To 10 For n = 10 To 90 k1 = k(n) + th(m) * k(n) ^ a - cx(m, n) - de * k(n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 uc = 0 For m1 = 1 To 10 c1 = cx(m1, n2) + (n1 - n2) * (cx(m1, n3) - cx(m1, n2)) r1 = a * k1 ^ (a - 1) - de uc = uc + (beta * (1 + r1)) / c1 Next uc = 0.1 * uc cp(m, n) = 1 / uc Next Next e = 0 For m = 1 To 10 For n = 10 To 90 e = e + (cx(m, n) - cp(m, n)) ^ 2 Next Next For m = 1 To 10 For n = 10 To 90 cx(m, n) = cp(m, n) Next Next If e 10 ^ (-5) Then t1 = 1000 t1 = t1 + 1 Debug.Print t1, e Loop End Sub
https://w.atwiki.jp/ff13-2monsters/pages/50.html
赤チョコボ ロール：アタッカー【ATK】 おもな生息地：アルカキルティ大平原-年代不明- モンスタータイプ：野生モンスター チョコボ 成長タイプ 大器晩成 限界Lv 99 特性 火事場力 ジューシー 必殺技 クェッ！ 初期ステータス ATB Lv 3 グレード ★☆☆☆☆ HP 602~646 物攻 53~55 魔攻 68~69 習得アビリティ（★=赤鍵アビリティ=継承不可） 修得Lv アビリティ 修得Lv 特性アビリティ 初期 たたかう 初期 ★ブレイク持続UP 初期 ルイン 7 火属性+10％ 4 インパクトブレイク 16 火属性+33％ 11 エリアルブラスト 18 ピンチにブレイブ 21 ウィークアスピル 29 火属性+45％ 26 ゾーンクラッシュ 99 ★ブレイク持続UP改 33 エンドアスピル - - 50 非常の牙 - - 57 ヘイスト対抗 - - 64 ブレイクブラッド - - 77 ブレイブ対抗 - - 94 ブレイクバースト - - レシピ（個体値によって多少前後します。） 使用アイテム HP 物攻 魔攻 アビリティ 備考 フル力 5973 1632 495 特性アビリティ(赤)ブレイク持続UP改(黄)HP+30%(黄)物理攻撃+35%(白)オートヘイスト(白)物理耐性+36%(白)オートブレイブ(白)魔法耐性+36%(白)ロール同調(白)攻撃してATB回復(白)アスピル系回復UP改 【作り方】1.各モンスターのレベルを上げる。例：赤チョコボ(99)→赤チョコボをLv.99にする。2.A/Bそれぞれ数字の若い順に継承して、最後にAをBに継承。※鍵無しでの継承なのでmobを置き換える時は注意 A マッドフロッグ?(19)1.トンベリ?(24) 物理攻撃+35%/魔法攻撃+35%2.ニャオマオ?(23) 魔法耐性+36%3.サボテンダー?(45) オートブレイブ4.緑チョコボ(48) 物理耐性+36%5.ネコマタ?(54) HP+30%B 赤チョコボ(99)1.ブッカブーエース?(39) ロール同調2.チュネルペトン?(45) アスピル系回復UP改3.チョコボ?(90) 攻撃してATB回復4.サハギンプリンス?(45) オートヘイスト 育成データ 力特化育成時に万能の○○○を使用できるレベル Lv.21-54,56-59 ※Lv.21なら、餌を上げるとLv.21になる時（Lv.20→21）に使用すること ※同等に物攻UPしつつHP、魔攻も上げられるのでお得 魔法特化育成時に万能の○○○を使用できるレベル Lv.11,14,17,21-60 ※Lv.11なら、餌を上げるとLv.11になる時（Lv.10→11）に使用すること ※同等に魔攻UPしつつHP、物攻も上げられるのでお得 コメント 赤チョコボの初期ステ魔攻の最小67とHPの最大663確認しました - 名無しさん 2012-02-12 15 36 32 名前
https://w.atwiki.jp/ce00582/pages/4640.html
import java.io.*; import java.net.*; class game0322{ String urlx; String bun; int year1,month1,day1; int year2,month2,day2; String ycode; String[] xml=new String[10000]; String[] xmlxml=new String[10000]; int[] xmllong=new int[10000]; int[] x=new int[10000]; int[] y=new int[10000]; int xmlnumber; int s,sx,ex; int h; public static void main(String [] args) { game0322 f=new game0322(); } game0322(){ year1=2005; month1=10; day1=1; year2=2005; month2=11; day2=1; ycode="4755.q"; urlx=getyahoo(ycode,year1,month1,day1,year2,month2,day2); getdata(urlx); xmlmaker(bun); for(s=1;s xmlnumber;s++){ xmlxml[s]=xmlxmlmaker(s); } for(s=1;s xmlnumber;s++){ xmlxml[s]=xmlxmlmaker(s); xmllong[s]=xmlxml[s].length(); } System.out.println(doragon(year1,month1)); } int doragon(int year1,int month1){ int s,z1; z1=0; for(s=1;s xmlnumber;s++){ if(check(s,year1,month1) 50)z1=z1+1; } return z1; } int check(int s,int year1,int month1){ String syear,smonth; int z; z=0; syear=String.valueOf(year1); smonth=String.valueOf(month1); h=0; if(xmllong[s] 2)h=h+1; if(xmllong[s] 20)h=h+1; if(xmlxml[s].indexOf(syear) -1)h=h+1; if(xmlxml[s].indexOf(smonth) -1)h=h+1; if(h==4)z=100; return z; } String getyahoo(String ycode,int year1,int month1,int day1,int year2,int month2,int day2){ String url; String syear,smonth,sday; String eyear,emonth,eday; syear=String.valueOf(year1); smonth=String.valueOf(month1); sday=String.valueOf(day1); eyear=String.valueOf(year2); emonth=String.valueOf(month2); eday=String.valueOf(day2); url="http //table.yahoo.co.jp/t?c="; url=url+syear; url=url+" a="; url=url+smonth; url=url+" b="; url=url+sday; url=url+" f="; url=url+eyear; url=url+" d="; url=url+emonth; url=url+" e="; url=url+eday; url=url+" g=d s="; url=url+ycode; url=url+" y=0 z="; url=url+ycode; url=url+" x=sb"; return url; } String xmlxmlmaker(int s){ int p1,p2; String str; p1=y[s]; p2=x[s+1]; str=bun.substring(p1+1,p2); return str; } void xmlmaker(String bun){ int p1; int s; s=1; p1=bun.indexOf(" "); x[1]=p1; while(p1 -1){ p1=bun.indexOf(" ",p1+1); if(p1 -1)s=s+1; if(p1 -1)x[s]=p1; } xmlnumber=s; for(s=1;s xmlnumber+1;s++){ y[s]=bun.indexOf(" ",x[s]); } for(s=1;s xmlnumber+1;s++){ xml[s]=bun.substring(x[s]+1,y[s]); } } void getdata(String name){ int num; int n; String data[]=new String[1000]; num=0; try{ URL url = new URL(name); HttpURLConnection con = (HttpURLConnection)url.openConnection(); con.setRequestMethod("GET"); con.connect(); BufferedReader reader = new BufferedReader(new InputStreamReader(con.getInputStream(),"UTF-8")); n=0; while (true){ String line = reader.readLine(); if ( line == null ){ break; } data[n]=line; n=n+1; num=n; } reader.close(); con.disconnect(); } catch(Exception e) { System.err.println(e); } bun=""; for (n=0;n num;n++){ bun=bun+data[n]; } } }
https://w.atwiki.jp/ce00582/pages/48.html
Private Sub Command1_Click() Dim a As Single Dim beta As Single Dim phi As Single Dim sig As Single Dim barm(1 To 10) As Single Dim t2 As Single Dim t1 As Single Dim t3 As Single Dim t4 As Single Dim t5 As Single Dim k(1 To 100) As Single Dim cx(-5 To 5, 1 To 10, 1 To 100) As Single Dim cp(-5 To 5, 1 To 10, 1 To 100) As Single Dim lx(-5 To 5, 1 To 10, 1 To 100) As Single Dim lp(-5 To 5, 1 To 10, 1 To 100) As Single Dim px(-5 To 5, 1 To 10, 1 To 100) As Single Dim ps(-5 To 5, 1 To 10, 1 To 100) As Single Dim checkc(-5 To 5, 1 To 10, 1 To 100) As Single Dim checkl(-5 To 5, 1 To 10, 1 To 100) As Single Dim checkp(-5 To 5, 1 To 10, 1 To 100) As Single Dim gotos(-5 To 5, 1 To 10, 1 To 100, 1 To 10) As Single Dim maki(-5 To 5, 1 To 10, 1 To 100, 1 To 10) As Single Dim v(0 To 2, -5 To 5, 1 To 10, 1 To 100) As Single Dim vs(0 To 2, -5 To 5, 1 To 10, 1 To 100) As Single Dim wedge(-5 To 5) As Single Dim ls As Single Dim ks As Single Dim s As Single Dim m As Single Dim n As Single Dim q As Single Dim m1 As Single Dim h As Single Dim n1 As Single Dim n2 As Single Dim n3 As Single Dim s1 As Single Dim s2 As Single Dim s3 As Single Dim q1 As Single Dim q2 As Single Dim q3 As Single Dim r1 As Single Dim c1 As Single Dim l1 As Single Dim y1 As Single Dim i1 As Single Dim ds As Single Dim dn As Single Dim dq As Single Dim e As Single Dim uc As Single Dim um As Single Dim mc As Single Dim p1 As Single Dim p2 As Single Dim p3 As Single Dim z1 As Single Dim z2 As Single Dim pxs As Single Dim pp As Single Dim ys As Single Dim vv1 As Single Dim vv2 As Single Dim vv0 As Single Dim price(-5 To 5, 1 To 10, 1 To 100) As Single Dim maxp(-5 To 5, 1 To 10, 1 To 100) As Single Dim pi As Single Dim pipi As Single Dim pipipi As Single Dim r(0 To 2, -5 To 5, 1 To 10, 1 To 100) As Single Dim dv(0 To 2) As Single Dim dr(0 To 2) As Single Dim rank As Single Dim prob(1 To 10, 1 To 10) As Single Open "c /pro146.txt" For Input As #81 Do Until EOF(81) Input #81, a1, a2, a3 m = a1 m1 = a2 prob(m, m1) = a3 Loop Close #81 phi = 0.9 Open "c /pro1551.txt" For Input As #2 Do Until EOF(2) Input #2, a1, a2, a3, a4, a5, a6 s = a1 m = a2 n = a3 lx(s, m, n) = a4 cx(s, m, n) = a5 px(s, m, n) = a6 Loop Close #2 Open "c /pro1552.txt" For Input As #72 Do Until EOF(72) Input #72, a1, a2, a3, a4, a5 s = a1 m = a2 n = a3 m1 = a4 gotos(s, m, n, m1) = a5 Loop Close #72 phi = 0.9 For s = -5 To 5 sig = 1 / (1 - phi) px1 = 1 + 0.01 * s px2 = ((1 - 0.1 * px1 ^ (1 - sig)) / 0.9) ^ (1 / (1 - sig)) wedge(s) = phi * px2 Next beta = 0.95 a = 0.33 ls = ((1 - a) * phi) / ((1 - a) * phi + 1) ks = ls * ((1 / beta - 1) / (a * phi)) ^ (1 / (a - 1)) h = 2 * ks / 100 For n = 1 To 100 k(n) = n * h Next t5 = 0 Do Until t5 1 t1 = 0 Do Until t1 100 For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 uc = 0 k1 = k(n) + k(n) ^ a * lx(s, m, n) ^ (1 - a) - cx(s, m, n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 For m1 = 1 To 10 s1 = gotos(s, m, n, m1) s2 = Int(s1) If s2 4 Then s2 = 4 s3 = s2 + 1 ds = (s1 - s2) * (cx(s3, m1, n2) - cx(s2, m1, n2)) dn = (n1 - n2) * (cx(s2, m1, n3) - cx(s2, m1, n2)) c1 = cx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (lx(s3, m1, n2) - lx(s2, m1, n2)) dn = (n1 - n2) * (lx(s2, m1, n3) - lx(s2, m1, n2)) l1 = lx(s2, m1, n2) + ds + dn mc = wedge(s2) + (s1 - s2) * (wedge(s3) - wedge(s2)) r1 = mc * a * k1 ^ (a - 1) * l1 ^ (1 - a) uc = uc + prob(m, m1) * (beta * (1 + r1)) / c1 Next uc = uc cp(s, m, n) = 1 / uc w1 = wedge(s) * (1 - a) * k(n) ^ a * lx(s, m, n) ^ (-a) lp(s, m, n) = 1 - cx(s, m, n) / w1 Next Next Next e = 0 For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 e = e + (cx(s, m, n) - cp(s, m, n)) ^ 2 + (lx(s, m, n) - lp(s, m, n)) ^ 2 Next Next Next For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 cx(s, m, n) = cp(s, m, n) lx(s, m, n) = lp(s, m, n) Next Next Next If e 10 ^ (-5) Then t1 = 1000 Debug.Print 81, t1, e t1 = t1 + 1 Loop For m = 1 To 10 barm(m) = 20 * (0.95 + 0.01 * m) Next t2 = 0 Do Until t2 100 For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 p1 = 0.9 * px(s, m, n) p2 = 1.1 * px(s, m, n) k1 = k(n) + k(n) ^ a * lx(s, m, n) ^ (1 - a) - cx(s, m, n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 um = 0 For m1 = 1 To 10 s1 = gotos(s, m, n, m1) s2 = Int(s1) s3 = s2 + 1 If s3 5 Then s3 = 5 ds = (s1 - s2) * (cx(s3, m1, n2) - cx(s2, m1, n2)) dn = (n1 - n2) * (cx(s2, m1, n3) - cx(s2, m1, n2)) c1 = cx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (lx(s3, m1, n2) - lx(s2, m1, n2)) dn = (n1 - n2) * (lx(s2, m1, n3) - lx(s2, m1, n2)) l1 = lx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (px(s3, m1, n2) - px(s2, m1, n2)) dn = (n1 - n2) * (px(s2, m1, n3) - px(s2, m1, n2)) pxs = px(s2, m1, n2) + ds + dn mc = wedge(s2) + (s1 - s2) * (wedge(s3) - wedge(s2)) r1 = mc * a * k1 ^ (a - 1) * l1 ^ (1 - a) pp = pxs / p1 i1 = (1 + r1) * pp - 1 um = um + prob(m, m1) * (beta * i1) / (c1 * pp) Next z1 = um * barm(m) - p1 t3 = 0 Do Until t3 100 k1 = k(n) + k(n) ^ a * lx(s, m, n) ^ (1 - a) - cx(s, m, n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 um = 0 For m1 = 1 To 10 s1 = gotos(s, m, n, m1) s2 = Int(s1) s3 = s2 + 1 If s3 5 Then s3 = 5 ds = (s1 - s2) * (cx(s3, m1, n2) - cx(s2, m1, n2)) dn = (n1 - n2) * (cx(s2, m1, n3) - cx(s2, m1, n2)) c1 = cx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (lx(s3, m1, n2) - lx(s2, m1, n2)) dn = (n1 - n2) * (lx(s2, m1, n3) - lx(s2, m1, n2)) l1 = lx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (px(s3, m1, n2) - px(s2, m1, n2)) dn = (n1 - n2) * (px(s2, m1, n3) - px(s2, m1, n2)) pxs = px(s2, m1, n2) + ds + dn mc = wedge(s2) + (s1 - s2) * (wedge(s3) - wedge(s2)) r1 = mc * a * k1 ^ (a - 1) * l1 ^ (1 - a) pp = pxs / p2 i1 = (1 + r1) * pp - 1 um = um + prob(m, m1) * (beta * i1) / (c1 * pp) Next z2 = um * barm(m) - p2 p3 = p2 - z2 * (p2 - p1) / (z2 - z1) p1 = p2 p2 = p3 z1 = z2 If (z2) ^ 2 10 ^ (-5) Then t3 = 10000 t3 = t3 + 1 Loop ps(s, m, n) = p2 Next Next Next e = 0 For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 e = e + (px(s, m, n) - ps(s, m, n)) ^ 2 Next Next Next If e 10 ^ (-5) Then t2 = 1000 For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 px(s, m, n) = ps(s, m, n) Next Next Next Debug.Print 82, t2, e t2 = t2 + 1 Loop For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 ys = k(n) ^ a * lx(s, m, n) ^ (1 - a) pi = px(s, m, n) * ys - wedge(s) * px(s, m, n) * ys pipi = (phi - wedge(s)) * (ys / (phi - 1)) pipipi = (mr + wedge(s) * ys) / (px(s, m, n) * (phi - 1)) r(2, s, m, n) = pipipi / 2 r(1, s, m, n) = pipi - 2 * px(s, m, n) * r(2, s, m, n) r(0, s, m, n) = pi - r(1, s, m, n) * px(s, m, n) - r(2, s, m, n) * px(s, m, n) ^ 2 Next Next Next t4 = 0 Do Until t4 100 For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 k1 = k(n) + k(n) ^ a * lx(s, m, n) ^ (1 - a) - cx(s, m, n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 vv0 = 0 vv1 = 0 vv2 = 0 For m1 = 1 To 10 s1 = gotos(s, m, n, m1) s2 = Int(s1) s3 = s2 + 1 If s3 5 Then s3 = 5 ds = (s1 - s2) * (lx(s3, m1, n2) - lx(s2, m1, n2)) dn = (n1 - n2) * (lx(s2, m1, n3) - lx(s2, m1, n2)) l1 = lx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (px(s3, m1, n2) - px(s2, m1, n2)) dn = (n1 - n2) * (px(s2, m1, n3) - px(s2, m1, n2)) pxs = px(s2, m1, n2) + ds + dn mc = wedge(s2) + (s1 - s2) * (wedge(s3) - wedge(s2)) r1 = mc * a * k1 ^ (a - 1) * l1 ^ (1 - a) pp = pxs / px(s, m, n) i1 = (1 + r1) * pp - 1 For rank = 0 To 2 ds = (s1 - s2) * (v(rank, s3, m1, n2) - v(rank, s2, m1, n2)) dn = (n1 - n2) * (v(rank, s2, m1, n3) - v(rank, s2, m1, n2)) dv(rank) = v(rank, s2, m1, n2) + ds + dn Next For rank = 0 To 2 ds = (s1 - s2) * (r(rank, s3, m1, n2) - r(rank, s2, m1, n2)) dn = (n1 - n2) * (r(rank, s2, m1, n3) - r(rank, s2, m1, n2)) dr(rank) = r(rank, s2, m1, n2) + ds + dn Next vv0 = vv0 + prob(m, m1) * (dr(0) + 0.8 * dv(0)) / (1 + i1) vv1 = vv1 + prob(m, m1) * (dr(1) + 0.8 * dv(1)) / (1 + i1) vv2 = vv2 + prob(m, m1) * (dr(2) + 0.8 * dv(2)) / (1 + i1) Next vs(0, s, m, n) = vv0 vs(1, s, m, n) = vv1 vs(2, s, m, n) = vv2 Next Next Next e = 0 For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 For q = 0 To 2 e = e + (v(q, s, m, n) - vs(q, s, m, n)) ^ 2 Next Next Next Next For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 For q = 0 To 2 v(q, s, m, n) = vs(q, s, m, n) Next Next Next Next If e 10 ^ (-5) Then t4 = 1000 Debug.Print 83, t4, e t4 = t4 + 1 Loop For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 price(s, m, n) = -v(1, s, m, n) / (2 * v(2, s, m, n)) If price(s, m, n) 1.05 * px(s, m, n) Then price(s, m, n) = 1.05 * px(s, m, n) If price(s, m, n) 0.95 * px(s, m, n) Then price(s, m, n) = 0.95 * px(s, m, n) Next Next Next For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 p2 = price(s, m, n) p1 = (1 + 0.01 * s) * px(s, m, n) p3 = (0.8 * p1 ^ (1 - sig) + 0.2 * p2 ^ (1 - sig)) ^ (1 / (1 - sig)) k1 = k(n) + k(n) ^ a * lx(s, m, n) ^ (1 - a) - cx(s, m, n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 For m1 = 1 To 10 s1 = gotos(s, m, n, m1) s1 = gotos(s, m, n, m1) s2 = Int(s1) s3 = s2 + 1 If s3 5 Then s3 = 5 ds = (s1 - s2) * (px(s3, m1, n2) - px(s2, m1, n2)) dn = (n1 - n2) * (px(s2, m1, n3) - px(s2, m1, n2)) pxs = px(s2, m1, n2) + ds + dn gt = 100 * (p3 / pxs - 1) If gt 5 Then gt = 5 If gt -5 Then gt = -5 maki(s, m, n, m1) = gt Next Next Next Next For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 For m1 = 1 To 10 gotos(s, m, n, m1) = maki(s, m, n, m1) Next Next Next Next e = 0 For s = -5 To 5 For m = 1 To 10 For n = 10 To 90 e = e + (checkc(s, m, n) - cx(s, m, n)) ^ 2 + (checkl(s, m, n) - lx(s, m, n)) ^ 2 + (checkp(s, m, n) - px(s, m, n)) ^ 2 e = e + (price(s, m, n) - maxp(s, m, n)) ^ 2 Next Next Next For s = -5 To 5 For n = 10 To 90 For m = 1 To 10 checkc(s, m, n) = cx(s, m, n) checkl(s, m, n) = lx(s, m, n) checkp(s, m, n) = px(s, m, n) maxp(s, m, n) = price(s, m, n) Next Next Next If e 10 ^ (-5) Then t5 = 1000 Debug.Print 84, t5, e t5 = t5 + 1 Loop Open "c /pro1551.txt" For Output As #1 For s = -5 To 5 For m = 1 To 10 For n = 1 To 100 Write #1, s, m, n, lx(s, m, n), cx(s, m, n), px(s, m, n) Next Next Next Close #1 Open "c /pro1552.txt" For Output As #12 For s = -5 To 5 For m = 1 To 10 For n = 1 To 100 For m1 = 1 To 10 Write #12, s, m, n, m1, gotos(s, m, n, m1) Next Next Next Next Close #12 Dim mm(1 To 100) As Single For t = 1 To 100 mm(t) = 5 Next mm(1) = 8 sx = 0 mx = 5 nx = 50 k1 = k(50) For t = 1 To 100 s1 = sx s2 = Int(s1) s3 = s2 + 1 n1 = nx n2 = Int(n1) n3 = n2 + 1 m1 = mm(t) ds = (s1 - s2) * (gotos(s3, mx, n2, m1) - gotos(s2, mx, n2, m1)) dn = (n1 - n2) * (gotos(s2, mx, n3, m1) - gotos(s2, mx, n2, m1)) s1 = gotos(s2, mx, n2, m1) + ds + dn s2 = Int(s1) If s2 4 Then s2 = 4 s3 = s2 + 1 ds = (s1 - s2) * (cx(s3, m1, n2) - cx(s2, m1, n2)) dn = (n1 - n2) * (cx(s2, m1, n3) - cx(s2, m1, n2)) c1 = cx(s2, m1, n2) + ds + dn ds = (s1 - s2) * (lx(s3, m1, n2) - lx(s2, m1, n2)) dn = (n1 - n2) * (lx(s2, m1, n3) - lx(s2, m1, n2)) l1 = lx(s2, m1, n2) + ds + dn y1 = k1 ^ a * l1 ^ (1 - a) k1 = k1 + k1 ^ a * l1 ^ (1 - a) - c1 sx = s1 mx = m1 nx = k1 / h Debug.Print y1 Next End Sub
https://w.atwiki.jp/ce00582/pages/5314.html
class game{ int[] year=new int[1000]; int[] month=new int[1000]; int[] week=new int[1000]; String[][] music=new String[1000][100]; String[][] artist=new String[1000][100]; String[][] point=new String[1000][100]; int[][] p=new int[1000][100]; String[][] date=new String[1000][100]; int datanumber,s,sx; int p1,p2; String[] adic=new String[50000]; String[] mdic=new String[50000]; int articlenumber; int musicnumber,artistnumber; public static void main(String [] args) { game test=new game(); } game(){ getdata(); System.out.println(music[s][1]); } void getdata(){ catchdata sub=new catchdata(); sub.makedata(); year=sub.year; month=sub.month; week=sub.week; artist=sub.artist; date=sub.date; music=sub.music; point=sub.point; artistnumber=sub.artistnumber; adic=sub.adic; mdic=sub.mdic; musicnumber=sub.musicnumber; articlenumber=sub.articlenumber; for(s=1;s articlenumber+1;s++){ for(sx=1;sx 31;sx++){ p[s][sx]=Integer.parseInt(point[s][sx]); } } } }
https://w.atwiki.jp/ce00582/pages/47.html
Private Sub Command1_Click() Dim ks As Single Dim a As Single Dim beta As Single Dim r1 As Single Dim n As Single Dim cx(1 To 10, 1 To 100) As Single Dim cp(1 To 10, 1 To 100) As Single Dim lx(1 To 10, 1 To 100) As Single Dim lp(1 To 10, 1 To 100) As Single Dim k(1 To 100) As Single Dim h As Single Dim k1 As Single Dim n1 As Single Dim n2 As Single Dim n3 As Single Dim c1 As Single Dim e As Single Dim m As Single Dim de As Single Dim th(1 To 10) As Single de = 0.05 For m = 1 To 10 th(m) = 0.95 + 0.01 * m Next beta = 0.95 a = 0.33 ls = 0.5 ks = ls * ((1 / beta + de - 1) / a) ^ (1 / (a - 1)) h = 2 * ks / 100 For n = 1 To 100 k(n) = n * h For m = 1 To 10 lx(m, n) = ls cx(m, n) = th(m) * k(n) ^ a * lx(m, n) ^ (1 - a) - de * k(n) Next Next t1 = 0 Do Until t1 100 For m = 1 To 10 For n = 10 To 90 k1 = k(n) + th(m) * k(n) ^ a * lx(m, n) ^ (1 - a) - cx(m, n) - de * k(n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 uc = 0 For m1 = 1 To 10 c1 = cx(m1, n2) + (n1 - n2) * (cx(m1, n3) - cx(m1, n2)) l1 = lx(m1, n2) + (n1 - n2) * (lx(m1, n3) - lx(m1, n2)) r1 = th(m1) * a * k1 ^ (a - 1) * l1 ^ (1 - a) - de uc = uc + (beta * (1 + r1)) / c1 Next uc = 0.1 * uc cp(m, n) = 1 / uc w1 = (1 - a) * th(m) + k(n) ^ a * lx(m, n) ^ (-a) lp(m, n) = 1 - cx(m, n) / w1 Next Next e = 0 For m = 1 To 10 For n = 10 To 90 e = e + (cx(m, n) - cp(m, n)) ^ 2 + (lx(m, n) - lp(m, n)) ^ 2 Next Next For m = 1 To 10 For n = 10 To 90 lx(m, n) = lp(m, n) cx(m, n) = cp(m, n) Next Next If e 10 ^ (-5) Then t1 = 1000 t1 = t1 + 1 Debug.Print t1, e Loop End Sub
https://w.atwiki.jp/ce00582/pages/45.html
Private Sub Command1_Click() Dim ks As Single Dim a As Single Dim beta As Single Dim r1 As Single Dim n As Single Dim cx(1 To 100) As Single Dim cp(1 To 100) As Single Dim lx(1 To 100) As Single Dim lp(1 To 100) As Single Dim k(1 To 100) As Single Dim h As Single Dim k1 As Single Dim n1 As Single Dim n2 As Single Dim n3 As Single Dim c1 As Single Dim e As Single Dim ls As Single Dim ds As Single de = 0.05 ls = 0.5 beta = 0.95 a = 0.33 ks = ls * ((1 / beta + de - 1) / a) ^ (1 / (a - 1)) h = 2 * ks / 100 For n = 1 To 100 k(n) = n * h lx(n) = ls cx(n) = k(n) ^ a * lx(n) ^ (1 - a) - de * k(n) Next t1 = 0 Do Until t1 100 For n = 10 To 90 k1 = k(n) + k(n) ^ a * lx(n) ^ (1 - a) - cx(n) - de * k(n) n1 = k1 / h n2 = Int(n1) n3 = n2 + 1 c1 = cx(n2) + (n1 - n2) * (cx(n3) - cx(n2)) l1 = lx(n2) + (n1 - n2) * (lx(n3) - lx(n2)) r1 = a * k1 ^ (a - 1) * l1 ^ (1 - a) - de cp(n) = c1 / (beta * (1 + r1)) w1 = (1 - a) * k(n) ^ a * lx(n) ^ (-a) lp(n) = 1 - cx(n) / w1 Next e = 0 For n = 10 To 90 e = e + (cx(n) - cp(n)) ^ 2 + (lx(n) - lp(n)) ^ 2 Next For n = 10 To 90 cx(n) = cp(n) lx(n) = lp(n) Next If e 10 ^ (-5) Then t1 = 1000 t1 = t1 + 1 Debug.Print t1, e Loop End Sub
https://w.atwiki.jp/nikuq-niuniu/pages/1516.html
「チョコボレース」の手引き 依頼主 ：ケイトリング（黒衣森：中央森林 X20-Y22） 受注条件：レベル１５～ 概要 ：ベントブランチ牧場のケイトリングは、冒険者に提案があるようだ。 ケイトリング 「さて、「新羽チョコボ登録証」も手に入ったことだし、 ゴールドソーサーに戻って、 さっそく、「チョコボレース」に出走してみたらどうかしら！ ゴールドソーサーの「チョコボレースカウンター」で、 「出走受付」さんに話しかければ、 「チョコボレース」に関する説明が聞けるはずよ！」 ケイトリング 「新羽チョコボも手に入ったことだし、 ゴールドソーサーの「チョコボレースカウンター」で、 「出走受付」さんから、レースの説明を受けてみて！」 チョコボレースカウンターの出走受付と話す チョコボ調教師 「･･････おや、「チョコボレース」に興味があるのかい？ なら、まずは「出走受付」さんに話しかけてごらん。」 出走受付 「おかえりなさい、君の帰りを待っていたよ。 「新羽チョコボ登録証」を手に入れたんだね！ それじゃあ、レースに出走する準備をしようか！ 「新羽チョコボ」は、「競走羽登録」をすることで、 レースに出走できるようになるんだ。 私の隣にいる「チョコボ調教師」さんに話しかけて、 「新羽チョコボ登録証」を渡せば、競走羽の登録ができるよ。 競走羽は一羽しか登録できないから、注意してね！ 無事に競走羽の登録ができたら、いよいよ出走だ。 レースに出走したいときは、私に話しかけてね！」
https://w.atwiki.jp/ykffawiki/pages/20.html
チョコボに関するページ GⅠレースを3種類制覇すると殿堂入り登録が可能となる ただし何回も押してしまうと同じプーギーが重複して登録されてしまうので注意 後は任せた！
https://w.atwiki.jp/sqex/pages/16.html
スクウェアが販売または開発したプレイステーション用ソフトの一覧 アクエスブランド作品についてはプレイステーション用ソフト（アクエス）を参照 スクウェアエニックス合併以後についてはプレイステーション用ソフト（スクウェアエニックス）を参照 トバルNo.1 ファイナルファンタジーVII ブシドーブレード ファイナルファンタジーIV トバル2 ファイナルファンタジータクティクス サガ フロンティア フロントミッションセカンド ファイナルファンタジーVII インターナショナル ザウバー（開発中止） アインハンダー フロントミッションオルタナティヴ チョコボの不思議なダンジョン ゼノギアス ブシドーブレード弐 パラサイト・イヴ ファイナルファンタジーV 双界儀 ブレイヴフェンサー 武蔵伝 アナザー・マインド エアガイツ チョコボの不思議なダンジョン2 IS internal section ファイナルファンタジーVIII ファイナルファンタジーVI ファイナルファンタジーコレクション チョコボレーシング 〜幻界へのロード〜 サガ フロンティア2 サイバーオーグ レーシングラグーン 聖剣伝説 レジェンド オブ マナ フロントミッションサード デュープリズム クロノ・トリガー クロノ・クロス パラサイト・イヴ2 チョコボスタリオン ダイス DE チョコボ チョコボコレクション ベイグラントストーリー ファイナルファンタジーIX ファイナルファンタジー ファイナルファンタジーII ファイナルファンタジーI・II プレミアムパッケージ