# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20370 | 2017-02-07T09:35:34 Z | 채점 시스템 (OJUZ11_judge) | C++ | 45 ms | 512 KB |
#include <cstdio> #include <algorithm> using namespace std; typedef long long ll; int N; int main(){ scanf("%d",&N); ll a,b; for(int i=0;i<N;i++){ scanf("%lld %lld",&a,&b); int sum=1; for(int j=1;j<10;j++){ sum*=10; if(sum+a>b){ if(sum/10<=a)puts("0"); else printf("%d\n",j-1); break; } } } return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 368 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 368 KB | Output is correct |
2 | Incorrect | 38 ms | 396 KB | Output isn't correct |
3 | Incorrect | 45 ms | 464 KB | Output isn't correct |
4 | Incorrect | 31 ms | 464 KB | Output isn't correct |
5 | Incorrect | 30 ms | 464 KB | Output isn't correct |
6 | Incorrect | 41 ms | 464 KB | Output isn't correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 24 ms | 368 KB | Output is correct |
2 | Incorrect | 38 ms | 396 KB | Output isn't correct |
3 | Incorrect | 45 ms | 464 KB | Output isn't correct |
4 | Incorrect | 31 ms | 464 KB | Output isn't correct |
5 | Incorrect | 30 ms | 464 KB | Output isn't correct |
6 | Incorrect | 41 ms | 464 KB | Output isn't correct |
7 | Incorrect | 38 ms | 512 KB | Output isn't correct |
8 | Incorrect | 35 ms | 512 KB | Output isn't correct |
9 | Incorrect | 35 ms | 512 KB | Output isn't correct |
10 | Incorrect | 36 ms | 512 KB | Output isn't correct |
11 | Incorrect | 23 ms | 512 KB | Output isn't correct |