这是一个专为《爆炒江湖》厨神试菜设计的辅助计算器，帮助玩家快速确定菜谱倍数。计算器支持自定义最小倍数、最大倍数、步长，并能根据试菜奖励分进行计算。同时，它提供了容差值设置，以应对游戏中可能出现的误差。用户可以选择菜谱和份数，输入奖励分后，计算器将在右侧表格中列出所有可能的倍数组合。此外，还支持菜谱筛选和关键词搜索功能。该计算器旨在简化试菜过程，让玩家不必每道菜都一一尝试。
/*默认滚动条样式*/
::-webkit-scrollbar {
width: 12px;
height: 12px;
background-color: #F5F5F5;
}
::-webkit-scrollbar-track {
background-color: #fff;
}
::-webkit-scrollbar-thumb {
-webkit-border-radius: 6px;
border-radius: 6px;
min-height: 30px;
border-radius: 6px;
border: 2px solid #fff;
margin: 5px;
background-color: #e0e0e0;
}
::-webkit-scrollbar-thumb:hover {
background: #cfcfcf;
}
#main {
display: flex;
}
.left {
padding: 10px;
box-sizing: padding-box;
border-right: 1px #F2F6FC solid;
}
.right {
padding: 10px;
width: 100%;
}
@media screen and (max-width: 600px) {
#main {
flex-wrap: wrap;
}
.left {
border: none;
}
}
.input-text .el-input__inner {
width: 210px;
}
.short-select .el-input__inner {
width: 150px;
}
.el-input-number--small {
width: 40px;
}
.el-tabs__item {
padding: 0 15px;
}
.el-form-item__content {
display: flex;
}
.swith .el-form-item__content {
display: block;
}
div.text {
padding: 0 6px;
}
.el-input-number.is-without-controls .el-input__inner {
padding-left: 7px;
padding-right: 7px;
}
#main.hidden {
display: none;
}
.el-dialog__body {
padding: 10px 20px 20px 20px;
font-size: 14px;
line-height: 1.6;
}
.el-dialog__body p, .el-dialog__body h3 {
margin: 10px 0;
}
.bold {
font-weight: 600;
}
.el-notification.right {
right: 16px;
width: 91%;
}
.el-checkbox__label {
padding-left: 5px;
}
说明
v-for="(r, i) in data"
:key="i"
:label="r.name + '(' + (repices_x[index] ? Math.ceil(r.value * 105 / 100) : r.value) + ')'"
:value="r.name + ',' + r.value">
已修
计算
重置
国内镜像：https://yuwenxifan.gitee.io/foodgod
国外镜像：https://yuwenxifan.github.io/foodgod
本网页为爆炒江湖厨神试菜组试菜所设计，用于辅助快速确定菜谱倍数。
我们的目标是：有朝一日能够有钱到一道一道试菜，去tm的计算器！
基本用法
选定最小倍数和最大倍数和步长(填1是整数倍，填0.5就支持x.5倍)，选择菜谱，份数，填入试菜所得奖励分点击计算，会在右侧表格中展示出所有可能的菜谱倍数，计算倍数支持筛选(应垃圾鱼摆摆要求改为按具体倍数筛选)，菜谱选择框可以输入关键字搜索(这个在手机上好像不大好用，真是令人头秃)
关于容差
本网站的奖励分计算方法是：
奖励分 = 向上取整(单价*倍数)*份数，
而游戏里的奖励分计算方式是：
实际得分 = 向上取整(单价*(1+其余加成+倍数))*份数
原始得分 = 向上取整(单价*(1+其余加成))*份数
奖励分 = 实际得分 - 原始得分
显然，当奖励倍数为整数倍时，两种算法得出的结果是一样的；而当 奖励倍数*单价 存在小数点时，品级/技能/厨具/修炼的影响可能会导致两种算法的结果存在一份菜谱一分的误差(游戏里显示的会比算出来的少一分)。所以设置了一个容差值，打开容差开关后，可以根据 菜谱份数 和 单价*倍数 智能筛选出所有符合条件的带误差的结果。
数据来源：爆炒江湖图鉴网
数据源文件：https://foodgame.github.io/data/data.min.json
以后本站更新就靠L大佬啦~~~
确 定
$(function() {
var app = new Vue({
el: '#main',
data: {
dialogWidth: '90%',
dialogVisible: false,
min: '-5',
height: window.innerHeight - 60,
max: '5',
step: '1',
num: 3,
tolerance: true,
repices: [],
repices_c: [1, 1, 1, 1, 1, 1],
repices_x: [false, false, false, false, false, false],
result: '0',
tableData: [],
r1: '菜谱1',
r2: '菜谱2',
r3: '菜谱3',
r4: '菜谱4',
r5: '菜谱5',
r6: '菜谱6',
r1_f: [],
r2_f: [],
r3_f: [],
r4_f: [],
r5_f: [],
r6_f: [],
data: []
},
mounted() {
this.initData();
if (window.location.origin === 'https://yuwenxifan.github.io') {
this.$message({
showClose: true,
message: '新增国内镜像，地址https://yuwenxifan.gitee.io/foodgod/'
});
}
$(document).ready(() => {
$(main).removeClass('hidden');
});
if (window.innerWidth > 1000) {
this.dialogWidth = '950px';
}
const h = this.$createElement;
if (window.innerWidth < 600) {
console.log('lalala');
this.$notify({
title: '提示',
type: 'warning',
dangerouslyUseHTMLString: true,
message: '_(:з」∠)_手机浏览器好像不太兼容，不建议手机使用
---by菜鸡小鱼',
duration: 0
});
}
},
methods: {
initData() {
const that = this;
$.ajax({
url: 'https://bcjh.xyz/api/get_recipe',
}).success(rst => {
const data = rst;
that.data = data.map(item => {
return {
id: item.id,
name: item.name,
value: item.price
};
});
}).fail(err => {
console.log(err);
that.$message.error('调用数据出错，使用备用本地数据，可能不全');
that.standbyInitData();
});
},
standbyInitData() {
const that = this;
$.ajax({
url: 'data/data.min.json?v=1',
}).success(rst => {
const data = rst.recipes;
that.data = data.map(item => {
return {
id: item.recipeId,
name: item.name,
value: item.price
};
});
}).fail(err => {
that.$message.error('调用本地数据也出错了是什么鬼');
});
},
filterHandler(value, row, column) {
const property = column['property'];
return row[property] == value;
},
/**
* @param {array} multiples 倍数
* @param {array} cnts 份数
* @param {array} values 单价
* @param {int} tolerance 容差
**/
check(multiples, cnts, values, tolerance) {
if (Math.ceil(this.step) == this.step || tolerance == 0) {
return true;
} else {
let count = multiples.map((multiple, index) => {
let result = multiple * values[index];
if (Math.ceil(result) != result) {
return cnts[index];
} else {
return -1;
}
});
count = count.filter(cnt => {
return cnt != -1;
});
let possible = count.length == 1 ? count : this.listAll(count);
possible.unshift(0);
return possible.indexOf(tolerance) > -1;
}
},
listAll(arr, num) {
for (var a2 = []; a2.push([]) < arr.length;) {
var l = Math.pow(2, arr.length) - 1;
}
for (let i = 1; i <= l; i++) {
let s2 = i.toString(2).split("").reverse();
let t = [];
let m = -1;
for (var k = 0; k < s2.length; k++) {
if (s2[k] == "1") {
t.push(arr[k]);
m++;
}
}
a2[m].push(t);
}
let a3 = [];
for (let item of a2) {
a3 = a3.concat(item);
}
a3 = a3.map(i => {
if (typeof i == 'object') {
let r = 0;
for (let j of i) {
r = r + j;
}
return r;
} else {
return i;
}
});
a3 = Array.from(new Set(a3));
return a3;
},
toTry () {
let count = 0;
this.tableData = [];
for (let i of this.repices) {
if (i != '') {
count++;
}
}
if (count < this.num || this.min == '' || this.max == '' || this.step == '' || this.result == '') {
this.$message.warning('请填写配置！');
} else if (isNaN(parseInt(this.min)) || isNaN(parseInt(this.max)) || isNaN(parseFloat(this.step)) || isNaN(parseInt(this.result))) {
this.$message.warning('最大值/最小值/步长/奖励分请填写数字');
} else if (parseFloat(this.step) <= 0) {
this.$message.warning('步长必须大于0');
} else {
let repices = this.repices.map((item, index) => {
const ratio = this.repices_x[index] ? 105 : 100;
return {
name: item.split(',')[0],
value: Math.ceil(parseInt(item.split(',')[1]) * ratio / 100)
}
});
if (this.num == 3) {
this.three(
repices[0].value,
repices[0].name,
repices[1].value,
repices[1].name,
repices[2].value,
repices[2].name,
this.result
);
} else if (this.num == 4) {
this.four(
repices[0].value,
repices[0].name,
repices[1].value,
repices[1].name,
repices[2].value,
repices[2].name,
repices[3].value,
repices[3].name,
this.result
);
} else if (this.num == 5) {
this.five(
repices[0].value,
repices[0].name,
repices[1].value,
repices[1].name,
repices[2].value,
repices[2].name,
repices[3].value,
repices[3].name,
repices[4].value,
repices[4].name,
this.result
);
} else if (this.num == 6) {
this.six(
repices[0].value,
repices[0].name,
repices[1].value,
repices[1].name,
repices[2].value,
repices[2].name,
repices[3].value,
repices[3].name,
repices[4].value,
repices[4].name,
repices[5].value,
repices[5].name,
this.result
);
}
}
this.r1_f = this.setFilter(this.tableData, 'v1');
this.r2_f = this.setFilter(this.tableData, 'v2');
this.r3_f = this.setFilter(this.tableData, 'v3');
this.r4_f = this.setFilter(this.tableData, 'v4');
this.r5_f = this.setFilter(this.tableData, 'v5');
this.r6_f = this.setFilter(this.tableData, 'v6');
},
reset() {
this.repices = [];
this.repices_x = [false, false, false, false, false, false];
this.repices_c = [1, 1, 1, 1, 1, 1];
this.result = '0';
},
setFilter(data, key) {
if (data.length > 0 && (data[0][key] || data[0][key] == 0)) {
let arr = data.map(item => {
return item[key]
});
arr = arr.filter((item, index) => {
return index == arr.indexOf(item);
});
arr.sort();
arr = arr.map(item => {
return { text: item, value: item };
});
return arr;
} else {
return [];
}
},
three(a, a_n, b, b_n, c, c_n, result) {
let count = 0;
let tolerance = 0;
let min = parseFloat(this.min);
let max = parseFloat(this.max);
let step = parseFloat(this.step);
let c_1 = this.repices_c[0] || 1;
let c_2 = this.repices_c[1] || 1;
let c_3 = this.repices_c[2] || 1;
for (let i = 0; i < 3; i++) {
tolerance += (this.repices_c[i] || 1);
}
tolerance = this.tolerance && step != Math.ceil(step) ? tolerance : 0;
for (let i = min; i <= max; i += step) {
for (let j = min; j <= max; j += step) {
for (let k = min; k <= max; k += step) {
let x = Math.ceil(i * a) * c_1 + Math.ceil(j * b) * c_2 + Math.ceil(k * c) * c_3;
if (x >= result && (x - result) <= tolerance) {
let check = this.check(
[i, j, k],
[c_1, c_2, c_3],
[a, b, c],
x - result
);
if (check) {
count ++;
this.r1 = a_n;
this.r2 = b_n;
this.r3 = c_n;
this.tableData.push({ v1: i, v2: j, v3: k, score: x, error: x - result});
}
}
}
}
}
this.$message.success({
showClose: true,
message: `尝试完毕，共有${count}种结果`
});
},
four(a, a_n, b, b_n, c, c_n, d, d_n, result) {
let count = 0;
let tolerance = 0;
let min = parseFloat(this.min);
let max = parseFloat(this.max);
let step = parseFloat(this.step);
let c_1 = this.repices_c[0] ? this.repices_c[0] : 1;
let c_2 = this.repices_c[1] ? this.repices_c[1] : 1;
let c_3 = this.repices_c[2] ? this.repices_c[2] : 1;
let c_4 = this.repices_c[3] ? this.repices_c[3] : 1;
for (let i = 0; i < 4; i++) {
tolerance += (this.repices_c[i] || 1);
}
tolerance = this.tolerance && step != Math.ceil(step) ? tolerance : 0;
for (let i = min; i <= max; i += step) {
for (let j = min; j <= max; j += step) {
for (let k = min; k <= max; k += step) {
for (let o = min; o <= max; o += step) {
let x = Math.ceil(i * a) * c_1 + Math.ceil(j * b) * c_2 + Math.ceil(k * c) * c_3 + Math.ceil(o * d) * c_4;
if (x >= result && (x - result) <= tolerance) {
let check = this.check(
[i, j, k, o],
[c_1, c_2, c_3, c_4],
[a, b, c, d],
x - result
);
if (check) {
count ++;
this.r1 = a_n;
this.r2 = b_n;
this.r3 = c_n;
this.r4 = d_n;
this.tableData.push({ v1: i, v2: j, v3: k , v4: o, score: x, error: x - result});
}
}
}
}
}
}
this.$message.success({
showClose: true,
message: `尝试完毕，共有${count}种结果`
})
},
five(a, a_n, b, b_n, c, c_n, d, d_n, e, e_n, result) {
let count = 0;
let tolerance = 0;
let min = parseFloat(this.min);
let max = parseFloat(this.max);
let step = parseFloat(this.step);
let c_1 = this.repices_c[0] ? this.repices_c[0] : 1;
let c_2 = this.repices_c[1] ? this.repices_c[1] : 1;
let c_3 = this.repices_c[2] ? this.repices_c[2] : 1;
let c_4 = this.repices_c[3] ? this.repices_c[3] : 1;
let c_5 = this.repices_c[4] ? this.repices_c[4] : 1;
for (let i = 0; i < 5; i++) {
tolerance += (this.repices_c[0] || 1);
}
tolerance = this.tolerance && step != Math.ceil(step) ? tolerance : 0;
for (let i = min; i <= max; i += step) {
for (let j = min; j <= max; j += step) {
for (let k = min; k <= max; k += step) {
for (let o = min; o <= max; o += step) {
for (let p = min; p <= max; p += step) {
let x = Math.ceil(i * a) * c_1 + Math.ceil(j * b) * c_2 + Math.ceil(k * c) * c_3 + Math.ceil(o * d) * c_4 + Math.ceil(p * e) * c_5;
if (x >= result && (x - result) <= tolerance) {
let check = this.check(
[i, j, k, o, p],
[c_1, c_2, c_3, c_4, c_5],
[a, b, c, d, e],
x - result
);
if (check) {
count ++;
this.r1 = a_n;
this.r2 = b_n;
this.r3 = c_n;
this.r4 = d_n;
this.r5 = e_n;
this.tableData.push({ v1: i, v2: j, v3: k , v4: o, v5: p, score: x, error: x - result});
}
}
}
}
}
}
}
this.$message.success({
showClose: true,
message: `尝试完毕，共有${count}种结果`
})
},
six(a, a_n, b, b_n, c, c_n, d, d_n, e, e_n, f, f_n, result) {
let count = 0;
let tolerance = 0;
let min = parseFloat(this.min);
let max = parseFloat(this.max);
let step = parseFloat(this.step);
let c_1 = this.repices_c[0] ? this.repices_c[0] : 1;
let c_2 = this.repices_c[1] ? this.repices_c[1] : 1;
let c_3 = this.repices_c[2] ? this.repices_c[2] : 1;
let c_4 = this.repices_c[3] ? this.repices_c[3] : 1;
let c_5 = this.repices_c[4] ? this.repices_c[4] : 1;
let c_6 = this.repices_c[5] ? this.repices_c[5] : 1;
for (let i = 0; i < 6; i++) {
tolerance += (this.repices_c[0] || 1);
}
tolerance = this.tolerance && step != Math.ceil(step) ? tolerance : 0;
for (let i = min; i <= max; i += step) {
for (let j = min; j <= max; j += step) {
for (let k = min; k <= max; k += step) {
for (let o = min; o <= max; o += step) {
for (let p = min; p <= max; p += step) {
for (let q = min; q <= max; q += step) {
let x = Math.ceil(i * a) * c_1 + Math.ceil(j * b) * c_2 + Math.ceil(k * c) * c_3 + Math.ceil(o * d) * c_4 + Math.ceil(p * e) * c_5 + Math.ceil(q * f) * c_6;
if (x >= result && (x - result) <= tolerance) {
let check = this.check(
[i, j, k, o, p, q],
[c_1, c_2, c_3, c_4, c_5, c_6],
[a, b, c, d, e, f],
x - result
);
if (check) {
count ++;
this.r1 = a_n;
this.r2 = b_n;
this.r3 = c_n;
this.r4 = d_n;
this.r5 = e_n;
this.r6 = f_n;
this.tableData.push({ v1: i, v2: j, v3: k , v4: o, v5: p, v6: q, score: x, error: x - result});
}
}
}
}
}
}
}
}
this.$message.success({
showClose: true,
message: `尝试完毕，共有${count}种结果`
})
}
},
watch: {
num() {
this.tableData = [];
this.r1 = '菜谱1';
this.r2 = '菜谱2';
this.r3 = '菜谱3';
this.r4 = '菜谱4';
this.r5 = '菜谱5';
this.r6 = '菜谱6';
this.r1_f = [];
this.r2_f = [];
this.r3_f = [];
this.r4_f = [];
this.r5_f = [];
this.r6_f = [];
}
}
});
});
一键复制
编辑
Web IDE
原始数据
按行查看
历史
1234
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
