# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
20486 | 2017-02-12T04:46:32 Z | 안녕하세요 투어리스트입니다 진짜에요(#49, Namnamseo) | 채점 시스템 (OJUZ11_judge) | C++14 | 46 ms | 2020 KB |
#include <bits/stdc++.h> using namespace std; typedef long long ll; typedef pair<int,int> pp; void read(int& x){ scanf("%d",&x); } void read(ll& x){ scanf("%lld",&x); } template<typename T,typename... Args> void read(T& a,Args&... b){ read(a); read(b...); } #define all(x) (x).begin(),(x).end() #define pb push_back int main() { int t; read(t); for(;t--;){ ll man, cur; read(cur, man); ll high = 1; while(high <= cur) high *= 10; int ans=0; while(true){ if(cur + high > man) break; ++ans; high *= 10; } printf("%d\n", ans); } return 0; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 2020 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 2020 KB | Output isn't correct |
2 | Incorrect | 36 ms | 2020 KB | Output isn't correct |
3 | Incorrect | 36 ms | 2020 KB | Output isn't correct |
4 | Incorrect | 39 ms | 2020 KB | Output isn't correct |
5 | Incorrect | 33 ms | 2020 KB | Output isn't correct |
6 | Incorrect | 39 ms | 2020 KB | Output isn't correct |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 33 ms | 2020 KB | Output isn't correct |
2 | Incorrect | 36 ms | 2020 KB | Output isn't correct |
3 | Incorrect | 36 ms | 2020 KB | Output isn't correct |
4 | Incorrect | 39 ms | 2020 KB | Output isn't correct |
5 | Incorrect | 33 ms | 2020 KB | Output isn't correct |
6 | Incorrect | 39 ms | 2020 KB | Output isn't correct |
7 | Incorrect | 46 ms | 2020 KB | Output isn't correct |
8 | Incorrect | 43 ms | 2020 KB | Output isn't correct |
9 | Incorrect | 39 ms | 2020 KB | Output isn't correct |
10 | Incorrect | 43 ms | 2020 KB | Output isn't correct |
11 | Incorrect | 36 ms | 2020 KB | Output isn't correct |