Problems Description
<div style="vertical-align:baseline;text-align:left;margin-left:0.38in;"> <span style="font-size:18px;font-family:宋体;color:black;">求</span><span style="font-size:18px;font-family:Arial;color:black;">100000000</span><span style="font-size:18px;font-family:宋体;color:black;">以内</span><span style="font-size:18px;font-family:宋体;color:black;">的整数中，</span><span style="font-size:18px;font-family:宋体;color:black;">能同时被</span><span style="font-size:18px;font-family:Arial;color:black;">3</span><span style="font-size:18px;font-family:宋体;color:black;">、</span><span style="font-size:18px;font-family:Arial;color:black;">5</span><span style="font-size:18px;font-family:宋体;color:black;">、</span><span style="font-size:18px;font-family:Arial;color:black;">7</span><span style="font-size:18px;font-family:宋体;color:black;">整除的数中最大的那一items。</span> </div>
Input格式
Output格式
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪