# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20669 | 2017-02-13T12:48:42 Z | 한국카레라이스(#81, chan492811) | 채점 시스템 (OJUZ11_judge) | C++11 | 43 ms | 1116 KB |
#include <cstdio> #include <algorithm> #define ll long long using namespace std; int n; int main(){ int i, j, m; ll a, s, now; scanf("%d", &n); for(i = 0; i < n; i++){ scanf("%lld %lld", &a, &s); m = 0; now = a; if(now == 0) m = 1; while(now) m++, now /= 10; now = 1; for(j = 0; j < m; j++) now *= 10; m = 0; while(a + now <= s) now *= 10, m++; printf("%d\n", m); } return 0; }
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 | 39 ms | 1116 KB | Output is correct |
3 | Correct | 43 ms | 1116 KB | Output is correct |
4 | Correct | 36 ms | 1116 KB | Output is correct |
5 | Correct | 33 ms | 1116 KB | Output is correct |
6 | Correct | 36 ms | 1116 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 33 ms | 1116 KB | Output is correct |
2 | Correct | 39 ms | 1116 KB | Output is correct |
3 | Correct | 43 ms | 1116 KB | Output is correct |
4 | Correct | 36 ms | 1116 KB | Output is correct |
5 | Correct | 33 ms | 1116 KB | Output is correct |
6 | Correct | 36 ms | 1116 KB | Output is correct |
7 | Correct | 36 ms | 1116 KB | Output is correct |
8 | Correct | 39 ms | 1116 KB | Output is correct |
9 | Correct | 43 ms | 1116 KB | Output is correct |
10 | Correct | 43 ms | 1116 KB | Output is correct |
11 | Correct | 39 ms | 1116 KB | Output is correct |