import{E as f,aj as C,r as m,ax as b,a as l,aq as h,f as s,c as M,s as c,l as x,aJ as p}from"./index-ajJ0B2-K.js";const v="Convert min to h and min or s to min and s",g=!0,A="mathLive",E=!0,Q="AMCHybride",D="14/05/2022",H="4f8f4",N="6D13";function R(d=!1){f.call(this),this.nbQuestions=5,this.correctionDetailleeDisponible=!0,this.correctionDetaillee=!1,this.sup=1,this.nouvelleVersion=function(){this.listeQuestions=[],this.listeCorrections=[],this.autoCorrection=[];let $=["min to h and min","s to min and s"];this.sup===1?$=["min to h and min"]:this.sup===2&&($=["s to min and s"]);const a=C($,this.nbQuestions);for(let t=0,u=0,i,n,e,r,o;t<this.nbQuestions&&u<50;)i=m(2,4),n=m(10,59),e=b(i*60+n),a[t]==="min to h and min"?(r=`Convert $${e}$ minutes to hours (h) and minutes (min).`+l(this,t,"inline keyboardHms"),this.canEnonce=`Convert $${e}$ minutes to hours and minutes.`,this.canReponseACompleter="$\\ldots$ h $\\ldots$ min"):r=`Convert $${e}$ seconds to minutes (min) and seconds (s).`+l(this,t,"inline keyboardHms"),d?(a[t]==="min to h and min"?o=h(`
    Mentalement : <br>
On cherche le multiple de $60$ inférieur à $${e}$ le plus grand possible. C'est $${Math.floor(e/60)}\\times 60 = ${Math.floor(e/60)*60}$.<br>
Ainsi $${e} = ${Math.floor(e/60)*60} + ${e%60}$ donc $${e}$min $= ${Math.floor(e/60)}$${s(1)}h${s(1)}$${e%60}$${s(1)}min.`)+"<br>":o=h(`
           Mentalement : <br>
      On cherche le multiple de $60$ inférieur à $${e}$ le plus grand possible. C'est $${Math.floor(e/60)}\\times 60 = ${Math.floor(e/60)*60}$.<br>
      Ainsi $${e} = ${Math.floor(e/60)*60} + ${e%60}$ donc $${e}$s $= ${Math.floor(e/60)}$${s(1)}min${s(1)}$${e%60}$${s(1)}s.`)+"<br>",this.listeCanEnonces.push(this.canEnonce),this.listeCanReponsesACompleter.push(this.canReponseACompleter)):this.correctionDetaillee?o=`We must carry out the Euclidean division of ${e} by 60 because there are 60 minutes in an hour.<br>The integer quotient gives the number of hours and the remainder enter gives the number of minutes.<br>`:o="",a[t]==="min to h and min"?o+=`$${e} = ${i} \\times 60 + ${n}$ so $${e}$ minutes = $${i}$${s(1)}h${s(1)}$${n}$${s(1)}min.`:o+=`$${e} = ${i} \\times 60 + ${n}$ so $${e}$ s = $${i}$${s(1)}min${s(1)}$${n}$${s(1)}s.`,this.questionJamaisPosee(t,i,n,e)&&(this.listeQuestions.push(r),this.listeCorrections.push(o),M.isAmc?a[t]==="min to h and min"?this.autoCorrection[t]={enonce:r,options:{multicols:!0},propositions:[{type:"AMCNum",propositions:[{texte:o,statut:"",reponse:{texte:"Hours)",valeur:i,param:{digits:1,decimals:0,signe:!1,approx:0}}}]},{type:"AMCNum",propositions:[{texte:"",statut:"",reponse:{texte:"Minute(min)",valeur:n,param:{digits:2,decimals:0,signe:!1,approx:0}}}]}]}:this.autoCorrection[t]={enonce:r,options:{multicols:!0},propositions:[{type:"AMCNum",propositions:[{texte:o,statut:"",reponse:{texte:"Minutes(min)",valeur:i,param:{digits:1,decimals:0,signe:!1,approx:0}}}]},{type:"AMCNum",propositions:[{texte:"",statut:"",reponse:{texte:"Seconds",valeur:n,param:{digits:2,decimals:0,signe:!1,approx:0}}}]}]}:a[t]==="min to h and min"?c(this,t,new p({hour:i,minute:n}),{formatInteractif:"hms"}):c(this,t,new p({minute:i,second:n}),{formatInteractif:"hms"}),t++),u++;x(this)},this.besoinFormulaireNumerique=["Starting unit type",3,`1: Minutes
2: Seconds
3: Mix`]}export{E as amcReady,Q as amcType,D as dateDeModifImportante,R as default,g as interactifReady,A as interactifType,N as ref,v as titre,H as uuid};
//# sourceMappingURL=6D13-RPN5hXzx.js.map