# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
20408 | | warning.or.kr (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | | 179 ms | 2020 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#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; in >> tc;
while(tc--)
{
ll x, y; in >> x >> y;
ll t = 1;
while(t <= x) t *= 10;
int r = 0;
while(t+x <= y)
{
t *= 10;
r++;
}
out << r << '\n';
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |