Submission #1248614

#TimeUsernameProblemLanguageResultExecution timeMemory
1248614hayyyTrol (COCI19_trol)C++20
10 / 50
0 ms328 KiB
#include <bits/stdc++.h> typedef long long ll; using namespace std; int balik(int K, int F = 0) { while (K > 0) { F += K % 10; K /= 10; } if (F > 9) return balik(F); else return F; } int main() { int N; cin >> N; vector<int> A(N); vector<int> B(N); for (int i = 1; i <= N; i++) { int ans = 0; cin >> A[i] >> B[i]; int H = max(balik(A[i]), balik(B[i])); int D = min(balik(A[i]), balik(B[i])); for (int i = D; i <= H; i++) { ans += i; } cout << ans << endl; } }
#Verdict Execution timeMemoryGrader output
Fetching results...