# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20671 | Kwiyomi Express (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | 46 ms | 2020 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i=0; i<n; i++) {
long long a, b;
scanf("%lld %lld", &a, &b);
long long val = 10;
while (val <= a) val *= 10;
int cnt = 0;
while (val + a <= b) {
cnt ++;
val *= 10;
}
printf("%d\n", cnt);
}
}
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... |