# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
976021 | 2024-05-06T05:21:32 Z | vjudge1 | Trol (COCI19_trol) | C++17 | 1 ms | 348 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 348 KB | Output is correct |
2 | Correct | 1 ms | 344 KB | Output is correct |
3 | Correct | 1 ms | 348 KB | Output is correct |
4 | Correct | 1 ms | 348 KB | Output is correct |
5 | Correct | 0 ms | 348 KB | Output is correct |