# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20384 | 2017-02-10T16:19:59 Z | 윤지학(#34, gs13068) | 채점 시스템 (OJUZ11_judge) | C++ | 46 ms | 1116 KB |
#include <cstdio> int main() { long long a, b, t; int i, n; scanf("%d", &n); while (n--) { scanf("%lld%lld", &a, &b); for (t = 10; t <= a; t *= 10); for (i = 0; t + a <= b; i++) t *= 10; printf("%d\n", i); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 1116 KB | Output is correct |
2 | Correct | 36 ms | 1116 KB | Output is correct |
3 | Correct | 33 ms | 1116 KB | Output is correct |
4 | Correct | 46 ms | 1116 KB | Output is correct |
5 | Correct | 36 ms | 1116 KB | Output is correct |
6 | Correct | 33 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 1116 KB | Output is correct |
2 | Correct | 36 ms | 1116 KB | Output is correct |
3 | Correct | 33 ms | 1116 KB | Output is correct |
4 | Correct | 46 ms | 1116 KB | Output is correct |
5 | Correct | 36 ms | 1116 KB | Output is correct |
6 | Correct | 33 ms | 1116 KB | Output is correct |
7 | Correct | 46 ms | 1116 KB | Output is correct |
8 | Correct | 43 ms | 1116 KB | Output is correct |
9 | Correct | 43 ms | 1116 KB | Output is correct |
10 | Correct | 46 ms | 1116 KB | Output is correct |
11 | Correct | 36 ms | 1116 KB | Output is correct |