#include <bits/stdc++.h>
#define HABIBA ios_base::sync_with_stdio(0);cin.tie(0),cout.tie(0);
#define PP push_back
#define LL long long
#define F first
#define S second
#define lp int Q; cin >>Q; while (Q--)
#define inp for(LL i=0; i<n;i++){cin >>a[i];}
#define sorting sort (a,a+n);
#define outp for (LL I=0; I<N;I++) {cout <<ARRAY[I]<<"\n";}
#define cout(X) for(auto V:X)cout<<V<<"\n";
#define coutp(X) for(auto V:X)cout<<V.F<<' '<<V.S<<'\n';
#define cin(X) for(auto &V:X)cin>>V;
#define pb(X) push_back(X);
#define all(X) X.begin(),X.end()
#define OR or
#define AND and
const LL MOD = 1e9 + 7;
const LL N = 1e5 + 7;
using namespace std;
int main() {
HABIBA
lp{
unsigned long long a,b,sum=0,c=1,sum1=0;
cin >>a>>b;
if (a==b){
cout <<a<<"\n";
continue;
}
c+=(b-a);
while (a>0 || sum>9){
if (a==0) a=sum,sum=0;
sum+=(a%10);
a/=10;
}
while (b>0 || sum1>9){
if (b==0) b=sum1,sum1=0;
sum1+=(b%10);
b/=10;
}
unsigned long long ans=0;
if (c>9){
ans+= (45*(c/10));
}
if (sum1<=sum) sum1+=9;
for (unsigned long long i=sum; i<=sum1;i++){
ans+=sum;
sum++; if (sum==10) sum=1;
} cout <<ans<<"\n";
}
return 0;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
0 ms |
344 KB |
Output is correct |
| 2 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 3 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 4 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
| 5 |
Incorrect |
0 ms |
348 KB |
Output isn't correct |
