1import{_ as N}from"./GAzHSGBn.js";import{g as m}from"./dQh_cajN.js";import{r as c,B as g,o as B,E as M,H as l}from"./C--HIF4D.js";import"./B9BvQYN_.js";import"./DlAUqK2U.js";import"./CrfJppij.js";import"./COzyvX5r.js";import"./6nf4KObW.js";import"./CsRamd8W.js";import"./_20J3hB3.js";import"./DtRmMPol.js";import"./CEAP_zQ3.js";import"./D0AgcfOT.js";import"./B1ANI7s_.js";const U={__name:"BaiBaisuu",props:{params:Object},setup(d,{expose:h}){const u=d,a=c([]),t=c([]),e=c(""),p=g(()=>`次ã®ãã¡${e.value}ã®åæ°ã¯ã©ãï¼`),v=()=>{a.value=[],t.value=[]},b=()=>{v(),e.value="",x()},x=()=>{v(),e.value=m.randomNum(u.params.base_min,u.params.base_max,0);const s=[],o=[0,0];o.push(m.randomNum(1,e.value-1,0)),o.push(m.randomNum(1,e.value-1,0));const i=Math.ceil(u.params.choice_min/e.value),n=Math.ceil(u.params.choice_max/e.value),_=r=>{const f=m.randomNum(i,n,0)*e.value+o[Math.floor(Math.random()*o.length)];r.includes(f)?_(r):r.push(f)};for(let r=0;r<4;r++)_(s);a.value=s};return h({start:b,checkAnswer:()=>{t.value==null&&(t.value=[]);const s=a.value.filter(n=>n%e.value==0),o=JSON.stringify(t.value.sort())==JSON.stringify(s.sort());return{question:p.value+`<br/>ï¼åçåè£ï¼${a.value.join(",")}ï¼<br/>`,true_answer:`${s.join(",")}`,your_answer:t.value.join(","),is_correct:o,options:a.value,base:e.value}}}),(s,o)=>{const i=N;return B(),M(i,{onUpdateSelected:o[0]||(o[0]=n=>t.value=n),formula:l(p),options:l(a),selected:l(t)},null,8,["formula","options","selected"])}}};export{U as default};
Line numbers count LF bytes from the start of the resource, as the search results do. Vendor segments are library code the classifier recognised; they are stored but not indexed. Bytes are shown as Latin1 characters, one per byte.