# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
251316 | Bruteforceman | Trol (COCI19_trol) | C++11 | 1 ms | 256 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
int main() {
int q;
cin >> q;
auto count = [] (long long x, int p, int mod) {
if(x < p) return 0LL;
return 1 + ((x - p) / mod);
};
for(int i = 1; i <= q; i++) {
long long l, r;
cin >> l >> r;
long long ans = 0;
for(int j = 0; j < 9; j++) {
ans += (count(r, j, 9) - count(l - 1, j, 9)) * (j ? j : 9);
}
cout << ans << endl;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |