# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20460 | 2017-02-11T22:46:06 Z | 책상다리황새두렁넘기(#60, khsoo01) | 채점 시스템 (OJUZ11_judge) | C++11 | 43 ms | 2020 KB |
#include<bits/stdc++.h> using namespace std; typedef long long ll; ll n; int main() { scanf("%lld",&n); for(int i=1;i<=n;i++) { ll A, B, T, C = 10, R = 0; scanf("%lld%lld",&A,&B); T = A / 10; while(T) {C *= 10; T /= 10;} while(C + A <= B) {C *= 10; R++;} printf("%lld\n",R); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 2020 KB | Output is correct |
2 | Correct | 33 ms | 2020 KB | Output is correct |
3 | Correct | 29 ms | 2020 KB | Output is correct |
4 | Correct | 33 ms | 2020 KB | Output is correct |
5 | Correct | 33 ms | 2020 KB | Output is correct |
6 | Correct | 36 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 26 ms | 2020 KB | Output is correct |
2 | Correct | 33 ms | 2020 KB | Output is correct |
3 | Correct | 29 ms | 2020 KB | Output is correct |
4 | Correct | 33 ms | 2020 KB | Output is correct |
5 | Correct | 33 ms | 2020 KB | Output is correct |
6 | Correct | 36 ms | 2020 KB | Output is correct |
7 | Correct | 39 ms | 2020 KB | Output is correct |
8 | Correct | 39 ms | 2020 KB | Output is correct |
9 | Correct | 39 ms | 2020 KB | Output is correct |
10 | Correct | 43 ms | 2020 KB | Output is correct |
11 | Correct | 29 ms | 2020 KB | Output is correct |