# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
292371 | 2020-09-06T21:59:04 Z | MilosMilutinovic | Trol (COCI19_trol) | C++14 | 1 ms | 288 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 1 ms | 256 KB | Output is correct |
2 | Correct | 1 ms | 256 KB | Output is correct |
3 | Correct | 1 ms | 288 KB | Output is correct |
4 | Correct | 1 ms | 256 KB | Output is correct |
5 | Correct | 1 ms | 256 KB | Output is correct |