#include <bits/stdc++.h>
using namespace std;
#define ll long long
ll q, l, r, qs[10];
ll solve(ll x)
{
return (x/9)*45+qs[x%9];
}
int main()
{
cin.tie(NULL)->sync_with_stdio(false);
cin>>q;
for (int i=1; i<=9; i++) qs[i]=qs[i-1]+i;
while (q--) cin>>l>>r, cout<<solve(r)-solve(l-1)<<'\n';
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Correct |
0 ms |
348 KB |
Output is correct |
5 |
Correct |
0 ms |
348 KB |
Output is correct |