# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
645306 | Hacv16 | 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;
typedef long long ll;
typedef pair<int, int> pii;
const int MAX = 2e6 + 15;
const int INF = 0x3f3f3f3f;
const int MOD = 1e9 + 7;
#define pb push_back
#define sz(x) (int) x.size()
#define fr first
#define sc second
#define mp make_pair
#define all(x) x.begin(), x.end()
#define dbg(x) cerr << #x << ": " << "[ " << x << " ]\n"
int main(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
ll q; cin >> q;
while(q--){
ll l, r; cin >> l >> r;
ll ans = ((r - l + 1) / 9) * 45;
ll m1 = (l % 9 == 0 ? 9 : l % 9), m2 = (r % 9 == 0 ? 9 : r % 9);
for(ll i = m1; i != m2; i = (i == 9 ? 1 : i + 1))
ans += i;
cout << ans + m2 << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |