# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
20409 | 2017-02-11T06:35:41 Z | warning.or.kr(#43, exqt) | 채점 시스템 (OJUZ11_judge) | C++ | 46 ms | 2020 KB |
#include <iostream> #include <algorithm> #include <vector> #include <cstring> #include <fstream> #include <string> #include <map> #include <queue> #include <utility> #include <stack> #include <cstdio> #include <cmath> #include <set> using namespace std; #define in cin #define out cout #define REP(i,n) for(int i=0; i<n; i++) #define REP2(i,s,e) for(int i=s; i<e; i++) #define REPE(i,s,e) for(int i=s; i<=e; i++) #define REPR(i,s,e) for(int i=s; i>=e; i--) #define all(v) v.begin(), v.end() #define pb push_back #define ll long long #define pii pair<int, int> #define x first #define y second #define intINF 2147483647 #define llINF 9223372036854775807LL #define MOD 1000000007 int main() { int tc; scanf("%d", &tc); while(tc--) { ll x, y; scanf("%lld%lld", &x, &y); ll t = 10; while(t <= x) t *= 10; int r = 0; while(t+x <= y) { t *= 10; r++; } printf("%d\n", r); } return 0; }
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 | 36 ms | 2020 KB | Output is correct |
4 | Correct | 36 ms | 2020 KB | Output is correct |
5 | Correct | 36 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 | 36 ms | 2020 KB | Output is correct |
4 | Correct | 36 ms | 2020 KB | Output is correct |
5 | Correct | 36 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 | 46 ms | 2020 KB | Output is correct |
9 | Correct | 39 ms | 2020 KB | Output is correct |
10 | Correct | 36 ms | 2020 KB | Output is correct |
11 | Correct | 33 ms | 2020 KB | Output is correct |