제출 #1246939

#제출 시각아이디문제언어결과실행 시간메모리
1246939amawTrol (COCI19_trol)C++20
20 / 50
1096 ms412 KiB
#include <bits/stdc++.h> using namespace std; long long modulo(long long n) { if (n < 10) return n; return modulo(modulo(n / 10) + (n % 10)); } long long sum(long long l, long long r) { int sum = 0; for (int i = l; i <= r; i++) { sum += modulo(i); } return sum; } int main() { long long q; cin >> q; vector<pair<long long, long long>> query(q); for (int i = 0; i < q; i++) { long long x, y; cin >> x >> y; query[i].first = x; query[i].second = y; cout << sum(query[i].first, query[i].second) << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...