#include<bits/stdc++.h>
#define ll long long
#define fi first
#define se second
using namespace std;
const ll MOD = 1e9+7;
const ll INF = 1e18;
void solve(){
ll q; cin >> q;
while(q--){
ll l, r; cin >> l >> r;
ll ans = 0;
for(ll i=l; i<=r; i++){
ll a = i % 9;
if(a == 0) a = 9;
ans += a;
}
cout << ans << '\n';
}
}
int main(){
ll t=1;// cin >> t;
while(t--){
solve();
}
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
1 ms |
600 KB |
Output is correct |
3 |
Correct |
1 ms |
348 KB |
Output is correct |
4 |
Execution timed out |
1062 ms |
348 KB |
Time limit exceeded |
5 |
Execution timed out |
1066 ms |
348 KB |
Time limit exceeded |