#include<bits/stdc++.h>
#define ll long long
using namespace std;
const ll MOD = 1e9+7;
const ll INF = 1e18;
ll mod_9(ll n) {
return n % 9;
}
void solve(){
ll q; cin >> q;
while(q--){
ll l, r; cin >> l >> r;
ll ans = 0;
for(ll i=1; i<=8; i++) {
ans += mod_9(i);
}
ll comp = (r - l + 1) / 9;
ans *= comp;
for(ll i=l+comp*9; i<=r; i++) {
ans += mod_9(i);
}
cout << ans << '\n';
}
}
int main(){
ll t=1;// cin >> t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
4 |
Incorrect |
1 ms |
344 KB |
Output isn't correct |
5 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |