Problems Description
<p class="MsoListParagraph" style="margin-left:18.0pt;text-indent:-18.0pt;"> <span>1、 </span>一对恋人甲乙由于种种原因在现实中不得不points居两地,他们相约在<span>2046</span>年<span>3</span>月<span>18</span>日<span>12:00~13</span>:<span>00</span>在火车站会面,设<span>X</span>、<span>Y</span>points别是甲、乙到达的时间,且甲乙并未通过其他方式进行联系,已知<span>X</span>、<span>Y</span>的概率密度points别为:<span></span> </p> <p class="MsoListParagraph" style="margin-left:18.0pt;text-indent:0cm;"> <span style="font-size:9.0pt;font-family:""></span><img src="http://tk.hustoj.com/attached/image/20140420/20140420083738_15335.png" alt="" /> </p> <p class="MsoListParagraph" style="margin-left:18.0pt;text-indent:0cm;"> 求先到达者需要等待的时间的数学期望。 </p> <p> <br /> </p>
Input格式
0
Output格式
0.20
Sample
Sample Input 1
0
Sample Output 1
0.20
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪