oj.uz

답안 #20668

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
20668 2017-02-13T12:46:28 Z Kwiyomi Express(#82, ainu7) 채점 시스템 (OJUZ11_judge) C++
31 / 100
 173 ms 2020 KB 
#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;
		string e = "1";
		while (1) {
			string c = e + a;
			if (c.size() == b.size() && c > b) break;
			if (c.size() > b.size()) break;
			cnt ++;
			e += '0';
		}
		cout << cnt << endl;
	}
}

Subtask #1
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 2020 KB Output is correct

Subtask #2
0 / 47.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 2020 KB Output is correct
2 Runtime error 129 ms 2020 KB Execution timed out (wall clock limit exceeded)
3 Runtime error 103 ms 2020 KB Execution timed out (wall clock limit exceeded)
4 Correct 129 ms 2020 KB Output is correct
5 Runtime error 126 ms 2020 KB Execution timed out (wall clock limit exceeded)
6 Correct 133 ms 2020 KB Output is correct

Subtask #3
0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 106 ms 2020 KB Output is correct
2 Runtime error 129 ms 2020 KB Execution timed out (wall clock limit exceeded)
3 Runtime error 103 ms 2020 KB Execution timed out (wall clock limit exceeded)
4 Correct 129 ms 2020 KB Output is correct
5 Runtime error 126 ms 2020 KB Execution timed out (wall clock limit exceeded)
6 Correct 133 ms 2020 KB Output is correct
7 Correct 163 ms 2020 KB Output is correct
8 Correct 149 ms 2020 KB Output is correct
9 Correct 153 ms 2020 KB Output is correct
10 Correct 153 ms 2020 KB Output is correct
11 Correct 173 ms 2020 KB Output is correct