제출 #1248628

#제출 시각아이디문제언어결과실행 시간메모리
1248628hayyyTrol (COCI19_trol)C++20
20 / 50
1093 ms412 KiB
#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

ll 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;
    int maxim = max(A, B);
    int minim = min(A, B);
    for (ll i = minim; i <= maxim; i++) {
      ans += balik(i);
    }
    cout << ans << endl;
  }
}
#Verdict Execution timeMemoryGrader output
Fetching results...