# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
1007333 |
2024-06-24T15:50:47 Z |
vjudge1 |
Trol (COCI19_trol) |
C++17 |
|
1000 ms |
348 KB |
#include <iostream>
#define ll long long
using namespace std;
// Fungsi untuk menghitung digit root
int digit_root(int n) {
return 1 + (n - 1) % 9;
}
int main() {
int q;
cin >> q;
while (q--) {
ll l, r;
cin >> l >> r;
ll ans = 0;
for (ll i = l; i <= r; i++) {
ans += digit_root(i);
}
cout << ans << '\n';
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
344 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Incorrect |
1 ms |
348 KB |
Output isn't correct |
4 |
Execution timed out |
1099 ms |
348 KB |
Time limit exceeded |
5 |
Execution timed out |
1061 ms |
348 KB |
Time limit exceeded |