제출 #206338

#제출 시각아이디문제언어결과실행 시간메모리
206338wiwihoTrol (COCI19_trol)C++14
50 / 50
5 ms376 KiB
//#define NDEBUG #include <bits/stdc++.h> #include <bits/extc++.h> #define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); #define iter(a) a.begin(), a.end() #define riter(a) a.rbegin(), a.rend() #define lsort(a) sort(iter(a)) #define gsort(a) sort(riter(a)) #define mp(a, b) make_pair(a, b) #define pb(a) push_back(a) #define eb(a) emplace_back(a) #define pf(a) push_front(a) #define pob pop_back() #define pof pop_front() #define F first #define S second #define printv(a, b) {bool pvaspace=false; \ for(auto pva : a){ \ if(pvaspace) b << " "; pvaspace=true;\ b << pva;\ }\ b << "\n";} #define pii pair<int, int> #define pll pair<ll, ll> #define tiii tuple<int, int, int> #define mt make_tuple #define gt(t, i) get<i>(t) #define iceil(a, b) ((a) / (b) + !!((a) % (b))) //#define TEST typedef long long ll; typedef unsigned long long ull; using namespace std; using namespace __gnu_pbds; const ll MOD = 1000000007; const ll MAX = 2147483647; template<typename A, typename B> ostream &operator<<(ostream &o, pair<A, B> p){ return o << '(' << p.F << ',' << p.S << ')'; } int main(){ StarBurstStream int q; cin >> q; while(q--){ ll l, r; cin >> l >> r; if(r - l + 1 <= 18){ ll ans = 0; for(ll i = l; i <= r; i++) ans += i % 9 == 0 ? 9 : i % 9; cout << ans << "\n"; continue; } ll ans = 0; while(l % 9 != 1){ ans += l % 9 == 0 ? 9 : l % 9; l++; } while(r % 9 != 0){ ans += r % 9 == 0 ? 9 : r % 9; r--; } ans += (r - l + 1) / 9 * 45; cout << ans << "\n"; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...