# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20665 | 한국카레라이스 (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | 43 ms | 1116 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 <cstdio>
#include <algorithm>
#define ll long long
using namespace std;
int n;
int main(){
int i, j, m;
ll a, s, now;
scanf("%d", &n);
for(i = 0; i < n; i++){
scanf("%lld %lld", &a, &s);
m = 0; now = a;
while(now) m++, now /= 10; now = 1;
for(j = 0; j < m; j++) now *= 10; m = 0;
while(a + now <= s) now *= 10, m++;
printf("%d\n", m);
}
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |