Problems Description
<p class="p0" style="text-align:left;text-indent:21pt;"> <span style="font-size:10.5pt;font-family:'宋体';">小<span>D</span><span>是items有强迫症的同学,当他看到一串串数字的时候,就要算出这些数字每一位的和,如果和不能被</span><span>10</span><span>整除的话,他就会十points不舒服,所以他把这些和成为</span><span>Lucky Number</span><span>。例如他看到了 </span><span>987654321 </span><span>,这items数每一位的和是</span><span>45</span><span>,不能被</span><span>10</span><span>整除,所以他看到这items数字就很不舒服。现在给出你两items数</span><span>A</span><span>,</span><span>B</span><span>。你要在</span><span>A</span><span>到</span><span>B</span><span>的范围内找出</span><span>Lucky Number</span><span>的items数。</span></span><span style="font-size:10.5pt;font-family:'Calibri';"></span> </p>
Input格式
<p class="p0" style="text-align:left;"> <span style="font-size:10.5pt;font-family:'宋体';">Page 一行有<span>T</span><span>items数(</span><span>T<=1000</span><span>)</span><span>,</span><span>表示有</span><span>T</span><span>组数据</span></span><span style="font-size:10.5pt;font-family:'Calibri';"></span> </p> <p class="p0" style="text-align:left;"> <span style="font-size:10.5pt;font-family:'宋体';"></span><span style="font-size:10.5pt;font-family:'宋体';">每一行有两items整数,<span>A </span><span>和</span><span>B </span><span>(</span><span>0 <= A <= B <= 10^18</span><span>)</span></span><span style="font-size:10.5pt;font-family:'Calibri';"></span> </p>
Output格式
<p class="p0"> <span style="font-size:10.5pt;font-family:'宋体';">输出<span>Lucky Number</span><span>的items数。</span></span> </p>
Sample
Sample Input 1
2
1 10
1 20
Sample Output 1
0
1
Submit Code
请先Login后Submit
🤖 AI 解题助手
OpenRouter
就绪