# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|
20667 | | Kwiyomi Express (#35) | 채점 시스템 (OJUZ11_judge) | C++98 | | 299 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 <math.h>
#include <stdio.h>
#include <string.h>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <algorithm>
#include <cmath>
#include <iostream>
#include <sstream>
#include <set>
using namespace std;
int main()
{
int n;
cin >> n;
for (int i=0; i<n; i++) {
string a, b;
cin >> a >> b;
int cnt = 0;
while (1) {
string c = "1";
for (int j=0; j<cnt; j++) c += '0';
c += a;
while (c.size() < b.size()) { string d = "0"; c = d + c; }
while (c.size() > b.size()) { string d = "0"; b = d + b; }
if (c > b) break;
cnt ++;
}
cout << cnt << endl;
}
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |