#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"
ll f(ll x){
return (x % 9 == 0 ? 9 : x % 9);
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll q; cin >> q;
while(q--){
ll l, r; cin >> l >> r;
ll ans = ((r - l + 1) / 9) * 45;
for(ll i = 0; i < (r - l + 1) % 9; i++) {
ll tmp = (l + i) % 9;
if (tmp == 0) tmp = 9;
ans += tmp;
}
cout << ans << '\n';
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
0 ms |
212 KB |
Output is correct |
5 |
Correct |
0 ms |
212 KB |
Output is correct |