#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pi pair<int, int>
#define fi first
#define se second
const int mxN = 1e6+5;
const int mod = 1e9+7;
const ll inf = 1e18;
int q;
ll l, r;
int dig(int n) {
while(1) {
int s = n, sum = 0;
while(s > 0) {
sum += s%10;
s /= 10;
}
if(sum <= 9) return sum;
else s = sum;
}
return 0;
}
int main() {
ios::sync_with_stdio(0); cin.tie(0);
cin >> q;
while(q--) {
cin >> l >> r;
int ans = 0;
for(int i = l; i <= r; i++) ans += dig(i);
cout << ans << "\n";
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
364 KB |
Output is correct |
2 |
Execution timed out |
1097 ms |
364 KB |
Time limit exceeded |
3 |
Execution timed out |
1096 ms |
364 KB |
Time limit exceeded |
4 |
Execution timed out |
1075 ms |
364 KB |
Time limit exceeded |
5 |
Execution timed out |
1029 ms |
364 KB |
Time limit exceeded |