# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
838198 | LinkedArray | Trol (COCI19_trol) | C++17 | 1 ms | 212 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() {
long long q, l, r, d, repeating, cif, sum;
cin >> q;
while(q--){
cin >> l >> r;
sum = 0;
while(l % 9 != 1) sum += (l++ - 1 + 9) % 9 + 1;
while(r % 9 != 0) sum += (r-- - 1 + 9) % 9 + 1;
cout << sum + 5 * (r - l + 1) << '\n';
/* sum = 0;
repeating = (r - l + 1) / 9;
cif = (l - 1 + 9) % 9 + 1; // Cifra de control al numarului L
if(cif != 1){ // Cat timp nu este egala cu 1
sum += 45 - ((cif - 1) * cif / 2); // Adun la suma pana la 1
}
sum += 5 * repeating; // Cifrele de control se repeta: 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 1 2 3 4 5 6 7 8 9 .....
cif = (r - 1 + 9) % 9 + 1; // Cifra de control al numarului R
if(cif != 9){ // Cat timp nu este egala cu 9
sum += cif * (cif + 1) / 2; // Adunam la suma
} */
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |