# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976271 | vjudge1 | Trol (COCI19_trol) | C++17 | 1077 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>
#define bismillah ios_base::sync_with_stdio(0); cin.tie(0);
#define int long long
#define v vector
#define pb push_back
#define ppb pop_back
#define all(x) x.begin(), x.end()
#define rall(x) x.begin(), x.end()
#define pii pair<int, int>
#define pll pair<long long, long long>
#define fi first
#define se second
#define mp make_pair
#define lb lower_bound
#define ub upper_bound
#define endl '\n'
#define tc int t = 1; while (t--)
// #define tc int t; cin >> t; while (t--)
const int MOD = 1e9 + 7;
const int INF = 1e17;
using namespace std;
int compress(int x) {
if (x < 10)
return x;
int sum_digs = 0;
while (x) {
sum_digs += x % 10;
x /= 10;
}
return compress(sum_digs);
}
signed main(){
bismillah;
tc {
//input
int q; cin >> q;
//solve
//output
while (q--) {
int l, r;
cin >> l >> r;
int ans = 0;
for (int i = l; i <= r; i++) {
ans += compress(i);
}
cout << ans << endl;
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |