# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20426 | 2017-02-11T11:41:10 Z | I_forgot_password(#50, mAng0) | 채점 시스템 (OJUZ11_judge) | C++ | 39 ms | 2020 KB |
#include<bits/stdc++.h> int main(){ int n; scanf("%d",&n); for(int i=0;i<n;i++){ long long m,l; scanf("%lld%lld",&m,&l); long long jari = 1; long long nn = m; while(nn>0){ nn /= 10; jari *= 10; } if(m == 0) jari = 10; int ans = 0; long long gop = 1; for(;gop*jari+m<=l;ans+=1,gop*=10); printf("%d\n",ans); } }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
2 | Correct | 36 ms | 2020 KB | Output is correct |
3 | Correct | 33 ms | 2020 KB | Output is correct |
4 | Correct | 36 ms | 2020 KB | Output is correct |
5 | Correct | 33 ms | 2020 KB | Output is correct |
6 | Correct | 33 ms | 2020 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 29 ms | 2020 KB | Output is correct |
2 | Correct | 36 ms | 2020 KB | Output is correct |
3 | Correct | 33 ms | 2020 KB | Output is correct |
4 | Correct | 36 ms | 2020 KB | Output is correct |
5 | Correct | 33 ms | 2020 KB | Output is correct |
6 | Correct | 33 ms | 2020 KB | Output is correct |
7 | Correct | 39 ms | 2020 KB | Output is correct |
8 | Correct | 36 ms | 2020 KB | Output is correct |
9 | Correct | 39 ms | 2020 KB | Output is correct |
10 | Correct | 39 ms | 2020 KB | Output is correct |
11 | Correct | 29 ms | 2020 KB | Output is correct |