# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20413 | tlwpdus (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | 56 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<stdio.h>
#include<algorithm>
#include<vector>
#include<math.h>
using namespace std;
int n;
long long po[15];
int main() {
int i;
po[0] = 1;
for (i=1;i<15;i++) po[i] = po[i-1]*10LL;
scanf("%d",&n);
for (i=0;i<n;i++) {
long long rp, p, t;
scanf("%lld%lld",&p,&t);
rp = p;
int rlen, len = 0;
if (!p) len = 1;
else {
while(rp>0) {
rp/=10;
len++;
}
}
rlen = len;
for(;;len++) {
if (po[len]+p>t) break;
}
printf("%d\n",len-rlen);
}
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... |