jhg97654 - 経済統計練習帳

var point_a;
var point_b;
var a = new Array();
var b = new Array();
var power = new Array();
var number_a, number_b;
var mon_a = new Array();
var mon_b = new Array();
var life_a = new Array();
var life_b = new Array();
var n_a, n_b;
 
 
function sample() {
 
    point_a = 8000;
    point_b = 8000;
 
for(s=1;s<31;s++){
a[s] = 1;
}
 
 
    for (s = 1; s < 31; s++) {
    b[s] = 2;
    }
 
 
    power[1] = 500;
    power[2] = 800;
 
 
 
    n_b=0;
    n_a = 0;
 
    mode = 1;
 
    number_a = 0;
    number_b = 0;
 
 
    var timer;
    var delay = 1000;
 
 
    var loop = function () {
 
        if (mode == 1) n_a = n_a + 1;
        if (mode == 1) number_a = number_a + 1;
 
        if (mode == 1) mon_a[n_a] = a[number_a];
        if (mode == 1) life_a[n_a] = 100;
        if (mode == 1) select_a();
        if (mode == 1) fight_a(fight, def);
 
        if (mode == 2) n_b = n_b + 1;
        if (mode == 2) number_b = number_b + 1;
 
        if (mode == 2) mon_b[n_b] = a[number_b];
        if (mode == 2) life_b[n_a] = 100;
        if (mode == 2) select_b();
        if (mode == 2) fight_b(fight, def);
 
 
        mode = mode + 1;
        if (mode == 3) mode = 1;
 
        $("#memo").html(point_a+","+point_b);
 
        clearTimeout(timer);
        timer = setTimeout(loop, delay);
    }
 
    loop();
 
 
 
 
}
 
function select_a() {
 
    maxpoint = 0;
    for (s = 1; s < n_a + 1; s++) {
        h = 0;
        if (life_a[s] > 50) h = h + 1;
        sx = mon_a[s];
        sx = a[sx];
        if (power[sx] > maxpoint) h = h + 1;
        if (h == 2) sxs = s;
        if (h == 2) maxpoint = power[sx];
    }
 
    fight = sxs;
 
    sxs = 0;
    minpoint = 1000;
    for (s = 1; s < n_b + 1; s++) {
        h = 0;
        if (life_b[s] > 50) h = h + 1;
        sx = mon_b[s];
        sx = b[sx];
        if (power[sx] < minpoint) h = h + 1;
        if (h == 2) sxs = s;
        if (h == 2) minpoint = power[sx];
    }
    def = sxs;
 
 
}
 
function select_b() {
 
    maxpoint = 0;
    for (s = 1; s < n_a + 1; s++) {
        h = 0;
        if (life_b[s] > 50) h = h + 1;
        sx = mon_b[s];
        sx = b[sx];
        if (power[sx] > maxpoint) h = h + 1;
        if (h == 2) sxs = s;
        if (h == 2) maxpoint = power[sx];
    }
 
    fight = sxs;
 
    sxs = 0;
    minpoint = 1000;
    for (s = 1; s < n_b + 1; s++) {
        h = 0;
        if (life_a[s] > 50) h = h + 1;
        sx = mon_a[s];
        sx = a[sx];
        if (power[sx] < minpoint) h = h + 1;
        if (h == 2) sxs = s;
        if (h == 2) minpoint = power[sx];
    }
    def = sxs;
 
 
}
 
 
function fight_a(fight,def) {
 
 
    h = 0;
    if (maxpoint > minpoint) h = h + 1;
    if (def > 0) h = h + 1;
    if (h == 2) point_b = point_b - (maxpoint - minpoint);
    if (h == 2) life_b[def] = 0;
 
 
    h = 0;
    if (minpoint > maxpoint) h = h + 1;
    if (def > 0) h = h + 1;
    if (h == 2) point_a = point_a + (maxpoint - minpoint);
    if (h == 2) life_a[fight] = 0;
 
    if (def == 0) point_b = point_b - maxpoint;
 
}
 
function fight_b(fight, def) {
 
 
    h = 0;
    if (maxpoint > minpoint) h = h + 1;
    if (def > 0) h = h + 1;
    if (h == 2) point_a = point_a - (maxpoint - minpoint);
    if (h == 2) life_a[def] = 0;
 
 
    h = 0;
    if (minpoint > maxpoint) h = h + 1;
    if (def > 0) h = h + 1;
    if (h == 2) point_b = point_b + (maxpoint - minpoint);
    if (h == 2) life_b[fight] = 0;
 
    if (def == 0) point_a = point_a - maxpoint;
 
}