| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 977378 | vjudge1 | Trol (COCI19_trol) | C++11 | 1 ms | 348 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 sum_of_digits(int n) {
    int sum = 0;
    while (n > 0) {
        sum += n % 10;
        n /= 10;
    }
    return sum;
}
int main() {
    vector<int> baskom(61);
    
    for (int i = 1; i <= 60; ++i) {
        baskom[i] = i;
    }
    int Q;
    cin >> Q;
    for (int i = 0; i < Q; ++i) {
        int L, R;
        cin >> L >> R;
        
        int total_sum = 0;
        for (int j = L; j <= R; ++j) {
            int current_num = baskom[j];
            while (current_num > 9) {
                current_num = sum_of_digits(current_num);
            }
            total_sum += current_num;
        }
        cout << total_sum << endl;
    }
    return 0;
}
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
