#include <bits/stdc++.h>
using namespace std;
unsigned long long modulo(unsigned long long n) {
if (n < 10) return n;
unsigned long long sum = 0;
while(n > 0) {
sum += n % 10;
n /= 10;
}
return modulo(sum);
}
unsigned long long sum(unsigned long long l, unsigned long long r) {
unsigned sum = 0;
for (unsigned long long i = l; i <= r; i++) {
sum += modulo(i);
}
return sum;
}
int main() {
unsigned long long q;
cin >> q;
vector<pair<unsigned long long, unsigned long long>> query(q);
for (unsigned long long i = 0; i < q; i++) {
unsigned long long x, y;
cin >> x >> y;
query[i].first = x;
query[i].second = y;
cout << sum(query[i].first, query[i].second) << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |