# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
975881 | vjudge1 | Trol (COCI19_trol) | C++17 | 1 ms | 348 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
#define ll long long
using namespace std;
#define FUE(i, a, N) for(int i = a; i <= N; i++)
int Q;
ll L, R, prefr, prefl;
int main(){
ios_base::sync_with_stdio(false), cin.tie(0), cout.tie(0);
cin >> Q;
while(Q--){
cin >> L >> R;
prefr = R / 9 * 45;
R %= 9;
FUE(i, 1, R){
prefr += i;
}
L--;
prefl = L / 9 * 45;
L %= 9;
FUE(i, 1, L){
prefl += i;
}
cout << prefr - prefl << "\n";
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |