# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20674 | 2017-02-13T13:14:48 Z | alex9801 == gs13105(#83, gs13105) | 채점 시스템 (OJUZ11_judge) | C++14 | 43 ms | 1116 KB |
#include <stdio.h> #include <string.h> #include <algorithm> int main() { int n, p, t, c, i, j; long long x; scanf("%d", &n); for(i = 0; i<n; i++) { scanf("%d%d", &p, &t); x = 1; c = 0; for(j = 0; j<11; j++, x *= 10) { if(x<=p) continue; if(x+p > t) { printf("%d\n", p==0 ? c-1 : c); break; } 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 | 39 ms | 1116 KB | Output is correct |
3 | Correct | 36 ms | 1116 KB | Output is correct |
4 | Correct | 36 ms | 1116 KB | Output is correct |
5 | Correct | 39 ms | 1116 KB | Output is correct |
6 | Correct | 39 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 1116 KB | Output is correct |
2 | Correct | 39 ms | 1116 KB | Output is correct |
3 | Correct | 36 ms | 1116 KB | Output is correct |
4 | Correct | 36 ms | 1116 KB | Output is correct |
5 | Correct | 39 ms | 1116 KB | Output is correct |
6 | Correct | 39 ms | 1116 KB | Output is correct |
7 | Correct | 43 ms | 1116 KB | Output is correct |
8 | Correct | 33 ms | 1116 KB | Output is correct |
9 | Correct | 39 ms | 1116 KB | Output is correct |
10 | Correct | 36 ms | 1116 KB | Output is correct |
11 | Correct | 33 ms | 1116 KB | Output is correct |