Submission #1253441

#TimeUsernameProblemLanguageResultExecution timeMemory
1253441XXBabaProBerkayTrol (COCI19_trol)C++20
50 / 50
0 ms328 KiB
#include <bits/stdc++.h> using namespace std; #define F first #define S second #define MP make_pair #define PB push_back using ll = long long; using ld = long double; using pi = pair<int, int>; using pll = pair<ll, ll>; template<typename T> using vec = vector<T>; template<typename T, int N> using arr = array<T, N>; ll gcd(ll a, ll b) { return b == 0 ? a : gcd(b, a % b); } ll lcm(ll a, ll b) { return a * b / gcd(a, b); } const int MOD = 998244353; void solve() { ll l, r; cin >> l >> r; ll x = r - l + 1; ll ans = x / 9ll * 45ll; for (int i = 0; i < x % 9; i++) ans += ((l + i) % 9 == 0 ? 9 : (l + i) % 9); cout << ans << '\n'; } int main() { ios_base::sync_with_stdio(false); cin.tie(nullptr); int t = 1; cin >> t; while (t--) solve(); }
#Verdict Execution timeMemoryGrader output
Fetching results...