# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20534 | 2017-02-12T08:05:45 Z | SD(#70, sang7) | 채점 시스템 (OJUZ11_judge) | C++14 | 39 ms | 1116 KB |
#include<cstdio> long long mat[15]; int lenll(long long pi) { int cnt = 0; while (pi > 0) { pi /= 10LL; cnt++; } return cnt; } int Go(long long pi, long long ti) { int cnt = 0; int len = lenll(pi); long long t = pi + mat[len]; while (t <= ti) { cnt++; len++; t = pi + mat[len]; } return cnt; } int main() { mat[0] = 1; for (int i = 1; i < 15; i++) { mat[i] = mat[i - 1] * 10LL; } mat[0] = 0; int N; scanf("%d", &N); for (int i = 0; i < N; i++) { long long pi, ti; scanf("%lld %lld", &pi,&ti); printf("%d\n", Go(pi, ti)); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
2 | Incorrect | 33 ms | 1116 KB | Output isn't correct |
3 | Incorrect | 36 ms | 1116 KB | Output isn't correct |
4 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
5 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
6 | Incorrect | 36 ms | 1116 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
2 | Incorrect | 33 ms | 1116 KB | Output isn't correct |
3 | Incorrect | 36 ms | 1116 KB | Output isn't correct |
4 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
5 | Incorrect | 29 ms | 1116 KB | Output isn't correct |
6 | Incorrect | 36 ms | 1116 KB | Output isn't correct |
7 | Incorrect | 39 ms | 1116 KB | Output isn't correct |
8 | Incorrect | 39 ms | 1116 KB | Output isn't correct |
9 | Incorrect | 39 ms | 1116 KB | Output isn't correct |
10 | Incorrect | 36 ms | 1116 KB | Output isn't correct |
11 | Incorrect | 33 ms | 1116 KB | Output isn't correct |