# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1248618 | hayyy | Trol (COCI19_trol) | C++20 | 1 ms | 328 KiB |
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;
int balik(ll K, ll F = 0) {
while (K > 0) {
F += K % 10;
K /= 10;
}
if (F > 9) return balik(F);
else return F;
}
int main() {
ll N;
cin >> N;
ll A;
ll B;
for (ll i = 1; i <= N; i++) {
ll ans = 0;
cin >> A >> B;
ll H = max(balik(A), balik(B));
ll D = min(balik(A), balik(B));
for (ll i = D; i <= H; i++) {
ans += i;
}
cout << ans << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |