#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
ll _i=0;
#define ffn(x) _i=x
#define llll pair<ll , ll>
#define stitr set<llll>::iterator
#define fora(y,x) for(ll y=_i;x>y;y++)
#define pb push_back
#define pf push_front
#define debu cout << "hello\n"
#define fi first
#define sec second
const ll limit = 1e9+7;
const ll ous=1e5 + 5;
const ll dx[4] = {1 , -1 , 0 , 0} , dy[4] = {0,0,-1,1};
ll don(ll x){
ll g = 0;
while(x){
g+=x%10;
x/=10;
}
if(g >= 10){
return don(g);
}
return g;
}
void solve(){
ll q;cin >> q;
while(q--){
ll l ,r;cin >> l >> r;
ll o = r - l + 1;
ll sp = don(l);
ll topl = 0;
while(o > 0 && sp < 10){
topl+=sp;
o--;
sp++;
}
ll u = o % 9;
ll kk = o/9;
ll od = 9 * 5;
topl+=(u*(u+1) / 2) + (od * kk);
cout << topl << "\n";
}
return;
}
int main(){
ios_base::sync_with_stdio(false);cin.tie(NULL);
ll t=1;
//cin >> t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
204 KB |
Output is correct |
2 |
Correct |
0 ms |
204 KB |
Output is correct |
3 |
Correct |
0 ms |
204 KB |
Output is correct |
4 |
Correct |
0 ms |
204 KB |
Output is correct |
5 |
Correct |
0 ms |
204 KB |
Output is correct |