oj.uz

Submission #251316

# Submission time Handle Problem Language Result Execution time Memory
251316 2020-07-20T18:22:48 Z Bruteforceman Trol (COCI19_trol) C++11
50 / 50
 1 ms 256 KB 
#include <bits/stdc++.h>
using namespace std;
int main() {
  int q;
  cin >> q;
  auto count = [] (long long x, int p, int mod) {
    if(x < p) return 0LL;
    return 1 + ((x - p) / mod);
  };
  for(int i = 1; i <= q; i++) {
    long long l, r;
    cin >> l >> r;
    long long ans = 0;
    for(int j = 0; j < 9; j++) {
      ans += (count(r, j, 9) - count(l - 1, j, 9)) * (j ? j : 9);
    }
    cout << ans << endl;
  }
  return 0;
}

Subtask #1
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 1 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct