script2.js

function optimize() {
    var errorMessage = ""
    var students = parseInt(document.getElementById("students").value)
    var t = parseFloat(document.getElementById("t").value)
    var ft = parseFloat(document.getElementById("ft").value)
    if (ft <= 0)
        errorMessage += "f(t) 的值必须大于 0, 否则无法计算。"

    var stars = parseFloat(document.getElementById("stars").value)

    var adBonus = document.getElementById("adbonus").checked
	var ignoreTheories = document.getElementById("ignoretheories").checked
	var TheoryBoost = document.getElementById("theoryBoost").checked
    var acceleration = document.getElementById("acceleration").checked
    var accelerationBonus = parseFloat(document.getElementById("accelmult").value)
	
	if(ignoreTheories && TheoryBoost){
		errorMessage += "未解锁理论，无法启用理论加成（研究 9）。请先解锁混沌理论。"
	}
	else if(students <= 55 && TheoryBoost){
		errorMessage += "无法在" + students + " 个学生时解锁理论加成（研究 9）。请先解锁混沌理论。"
	}
    
    if(isNaN(accelerationBonus))
        accelerationBonus = 2.8538;

    var log10dmu = ft
    if (ft < 100) {
        //More accurate calculations
        var db = Math.pow(Math.pow(10,ft),0.8) / 4000000
        var log10db = Math.log10(db+10)
        var dpsi = Math.pow(2,(ft/25)-1) - 0.5
        var log10dpsi = Math.log10(dpsi+10)
    } else{
        //Less accurate but works for higher ft
        var log10db = (ft * 0.8) - Math.log10(4e6)
        var log10dpsi = (ft / 25.0 - 1) * Math.log10(2)
    }  

    var dtSpeedUpgrades = ft / (15.0 * Math.log10(2))
    var dtSpeed = (dtSpeedUpgrades + 0.1) / 10
    var dtLevels = ft / Math.log10(4)
    var dt = dtSpeed * dtLevels

    if (adBonus) { dt *= 1.5 }
    if (acceleration) { dt *= accelerationBonus }

    function getCost(num) {
        if (num % 2 === 1) {
            return (Math.pow(num, 2) - 1) / 4 + (num + 1) / 2
        } else {
            return (Math.pow(num, 2) + 2 * num) / 4
        }
    }

    function getNextCost(num) {
        return getCost(num+1) - getCost(num);
    }

    function getCostOrder(order) {
        cost = 0;
        for (var i = 0; i < order.length-1; i++) {
            cost += getCost(order[i]);
        }
        cost += 2*order[6]
        return cost
    }

    if (errorMessage === "") {
        var boosts = [
            Math.log10(dt),
            0.7 * Math.log10(1 + t),
            Math.log10(1 + stars),
            log10db / Math.sqrt(100 * log10db),
            log10dmu / 1300.0,
            log10dpsi / 225 * Math.sqrt(log10dpsi),
            0.1
        ]
    }
    

    function getTotalBoost(order) {
        res = 0
        for (var i = 0; i < order.length-1; i++) {
            res += order[i]*boosts[i]
        }
        return (1+order[6]*0.1)*res
    }

    var order = [0, 0, 0, 0, 0, 0, 0]
	
	if (!ignoreTheories) {
    if (students >= 55) {
        students -= 55
    }
    else if (students >= 20) {
        students -= 20
        while (students >= 5) {
              students -= 5
        }
    }
}
	
	if (TheoryBoost) {
	if (students >= 30) {
        students -= 30
    }
    else if (students >= 10) {
        while (students >= 10) {
              students -= 10
        }
    }
}

    function getBestTotal(order, totalStudents, highest = [0,0,0,0,0,0,0]) {
        var remainingStudents = totalStudents - getCostOrder(order)
        var bestBoostPerCost = 0
        var bestI = -1
        for (var i = 0; i < order.length; i++) {
            if ((i >= 3 && i < 6 && order[i] === 8) || (i === 6 && order[i] === 6)) {
                continue
            }
            var boostPerCost = 0;
            var cost = 0;
            if (i === 6) {
                bestPerCost = 0.05 * (
                    order[0] * boosts[0] + order[1] * boosts[1] + order[2] * boosts[2] +
                    order[3] * boosts[3] + order[4] * boosts[4] + order[5] * boosts[5]
                )
                cost = 2
            }
            else {
                cost = getNextCost(order[i])
                extraBoost = (1 + order[6] * boosts[6]) * boosts[i]
                bestPerCost = extraBoost / cost
            }
            if (bestPerCost > bestBoostPerCost) {
                if (cost > remainingStudents) {
                    continue
                }
                bestBoostPerCost = bestPerCost
                bestI = i
                bestCost = cost
            }
        }
        if (bestI !== -1) {
            order[bestI] += 1
            if (getTotalBoost(order) > getTotalBoost(highest)) {
                highest = order.slice()
            }
            return [order, totalStudents, highest]
        }
        else {
            return [order, 0, highest]
        }
    }

    if (errorMessage === "") {
        var tempStudents = students
        var highest = order.slice()
        while (tempStudents > 0) {
            var res = getBestTotal(order, tempStudents, highest)
            order = res[0]
            tempStudents = res[1]
            highest = res[2]
        }
    }

    function contains(arrayOfArrays, searchArray) {
        var res = false
        for (var i = 0; i < arrayOfArrays.length; i++) {
            var array1 = arrayOfArrays[i]
            res = array1.length === searchArray.length && array1.every(function(value, index) { return value === searchArray[index]})
            if (res) {
                return true
            }
        }
        return false

    }

    function getAllForks(order, students, highest, required = [0,0,0,0,0,0,0]){
        var maxBuy = [-1, -1, -1, 8, 8, 8, 6]
        var tmp = []
        for (var i = 0; i < order.length; i++) {
            tmp1 = order.slice()
            tmp1[i] = order[i] +1
            if (maxBuy[i] > 0) {
                tmp1[i] = Math.min(maxBuy[i], tmp1[i])
            }
            if (getTotalBoost(tmp1) < getTotalBoost(highest)) {
                continue
            }
            tmp2 = required.slice()
            tmp2[i] = order[i]+1
            if (maxBuy[i] > 0) {
                tmp2[i] = Math.min(maxBuy[i], tmp2[i] )
            }
            if (getCostOrder(tmp2) > students) {
                continue
            }
            if (!contains(tmp,tmp2)) {
                tmp.push(tmp2)
            }
        }
        return tmp
    }

    if (errorMessage === "") {
        var possibles = getAllForks(highest, students, highest)
        var done_possibles = []

        while (possibles.length > 0) {
            var possible = possibles.shift()
            done_possibles.push(possible.slice())
            order = possible.slice()
            total_students = students
            while (total_students > 0) {
                var res = getBestTotal(order, total_students, highest)
                order = res[0]
                total_students = res[1]
                highest = res[2]
            }
            tmp_possibles = getAllForks(order, students, highest, possible)
            for (var tmp_possible_i = 0; tmp_possible_i < tmp_possibles.length; tmp_possible_i++) {
                var tmp_possible = tmp_possibles[tmp_possible_i]
                if (contains(possibles, tmp_possible) || contains(done_possibles,tmp_possible)) {
                    continue
                }
                else {
                    possibles.push(tmp_possible)
                }
            }
        }
        order = highest

        var phi = (
            (1 + order[6] * boosts[6]) *
            (
                order[0] * boosts[0] + order[1] * boosts[1] + order[2] * boosts[2] +
                order[3] * boosts[3] + order[4] * boosts[4] + order[5] * boosts[5]
            )
        )
        var phiDigits = Math.pow(10, phi - Math.floor(phi))
    }

    var bonusText = ""

    document.getElementById("output").innerHTML = (
        /*
        "Students: " + students + "<br>t: " + t + "<br>f(t): ee" + ft +
        "<br>Stars: " + stars + "<br>Ad-bonus: " + adBonus +
        "<br>Acceleration: " + acceleration + " and " + accelerationBonus + "x" +
        "<br>" +
        */
        errorMessage !== "" ? errorMessage : "dt 的计算值： " + dt.toPrecision(3) + "<br>φ=" + phiDigits.toPrecision(3) + "e" + Math.floor(phi) +
        "<br>学生分配：" + order.join(", ") + "<br>研究 1 至 7 使用的学生数量：" + getCostOrder(order) + bonusText
    )
}