# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
976021 | vjudge1 | Trol (COCI19_trol) | C++17 | 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>
#define nah_id_win ios_base::sync_with_stdio(0); cin.tie(0)
#define ull unsigned long long
#define int long long
#define pb push_back
#define pob pop_back
#define pf push_front
#define pof pop_front
#define fi first
#define se second
#define pii pair<int,int>
#define all(x) (x).begin(), (x).end()
using namespace std;
const int MOD = 1e9 + 7;
int dirx[4] = {0, -1, 0, 1};
int diry[4] = {-1, 0, 1, 0};
int dir[4] = {'L', 'U', 'R', 'D'};
void with_this_treasure_i_summon(string name){
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
signed main(){
nah_id_win;
int q; cin >> q;
while (q--){
//cout << "query----\n";
int l, r; cin >> l >> r;
int a = l;
while (a > 9){
int temp = 0;
string s = to_string(a);
for (auto &c : s) temp += (c - '0');
a = temp;
}
int range = r-l+1;
int ans = (range/9) * 45;
range %= 9;
for (int i = 1; i <= range; i++){
a = (a-1)%9 + 1;
ans += a;
a++;
}
cout << ans << "\n";
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |