# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
292371 | MilosMilutinovic | Trol (COCI19_trol) | C++14 | 1 ms | 288 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.
#include <bits/stdc++.h>
using namespace std;
long long f(long long n){
if(n<10)return n;
int sum=0;
while(n>0)sum+=n%10,n/=10;
return f(sum);
}
int main(){
int t;
scanf("%i",&t);
while(t--){
long long L,R;
scanf("%lld %lld",&L,&R);
if(R-L<=10){
long long ans=0;
for(long long i=L;i<=R;i++)ans+=f(i);
printf("%lld\n",ans);
continue;
}
long long ans=0;
while(f(L)!=1)ans+=f(L),L++;
while(f(R)!=9)ans+=f(R),R--;
ans+=(R-L+1)/9*45;
printf("%lld\n",ans);
}
return 0;
}
//1+2+3+4+5+6+7+8+9
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |