# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20671 | 2017-02-13T12:53:15 Z | Kwiyomi Express(#82, ainu7) | 채점 시스템 (OJUZ11_judge) | C++ | 46 ms | 2020 KB |
#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
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
2 | Correct | 33 ms | 2020 KB | Output is correct |
3 | Correct | 36 ms | 2020 KB | Output is correct |
4 | Correct | 43 ms | 2020 KB | Output is correct |
5 | Correct | 36 ms | 2020 KB | Output is correct |
6 | Correct | 36 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
2 | Correct | 33 ms | 2020 KB | Output is correct |
3 | Correct | 36 ms | 2020 KB | Output is correct |
4 | Correct | 43 ms | 2020 KB | Output is correct |
5 | Correct | 36 ms | 2020 KB | Output is correct |
6 | Correct | 36 ms | 2020 KB | Output is correct |
7 | Correct | 46 ms | 2020 KB | Output is correct |
8 | Correct | 46 ms | 2020 KB | Output is correct |
9 | Correct | 39 ms | 2020 KB | Output is correct |
10 | Correct | 36 ms | 2020 KB | Output is correct |
11 | Correct | 26 ms | 2020 KB | Output is correct |