# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20582 | 2017-02-12T12:50:20 Z | 키-파(#75, kipa00) | 채점 시스템 (OJUZ11_judge) | C++ | 46 ms | 1116 KB |
#include <cstdio> using namespace std; int main() { int n; scanf("%d", &n); while (n--) { int t, p; scanf("%d%d", &t, &p); int temp = t; long long int p10 = 1; while (temp > 0) { p10 *= 10; temp /= 10; } if (t == 0) { p10 = 10; } int c = 0; while (p10 + t <= p) { ++c; p10 *= 10; } printf("%d\n", c); } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 1116 KB | Output is correct |
2 | Correct | 43 ms | 1116 KB | Output is correct |
3 | Correct | 36 ms | 1116 KB | Output is correct |
4 | Correct | 33 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 | 29 ms | 1116 KB | Output is correct |
2 | Correct | 43 ms | 1116 KB | Output is correct |
3 | Correct | 36 ms | 1116 KB | Output is correct |
4 | Correct | 33 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 | 39 ms | 1116 KB | Output is correct |
8 | Correct | 43 ms | 1116 KB | Output is correct |
9 | Correct | 36 ms | 1116 KB | Output is correct |
10 | Correct | 46 ms | 1116 KB | Output is correct |
11 | Correct | 36 ms | 1116 KB | Output is correct |