oj.uz

Submission #20459

# Submission time Handle Problem Language Result Execution time Memory
20459 2017-02-11T17:08:47 Z sgc109(#57, sgc109) 채점 시스템 (OJUZ11_judge) C++11
100 / 100
 113 ms 2180 KB 
// #include <bits/stdc++.h>
#include <vector>
#include <cstdio>
#include <iostream>
#include <cstring>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <algorithm>
#include <utility>
#include <string>
#define REP(i,a,b) for(int i=a;i<=b;++i)
#define FOR(i,n) for(int i=0;i<n;++i)
#define pb push_back
#define all(v) (v).begin(),(v).end()
#define sz(v) ((int)(v).size())
#define inp1(a) scanf("%d",&a)
#define inp2(a,b) scanf("%d%d",&a,&b)
#define inp3(a,b,c) scanf("%d%d%d",&a,&b,&c)
#define inp4(a,b,c,d) scanf("%d%d%d%d",&a,&b,&c,&d)
#define inp5(a,b,c,d,e) scanf("%d%d%d%d%d",&a,&b,&c,&d,&e)z
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int,int> pii;
typedef vector<pii> vii;
typedef vector<pll> vll;
typedef vector<vector<int> > vvi;
typedef pair<int,pair<int,int> > piii;
typedef vector<piii> viii;
const double EPSILON = 1e-9;
const double PI = acos(-1);
const int MOD = 1000000007;
const int INF = 0x3c3c3c3c;
const long long INFL = 0x3c3c3c3c3c3c3c3c;
const int MAX_N = 102;

int N;
string S;
ll T;
int main() {
	std::ios_base::sync_with_stdio(false);
	cin >> N;
	while(N--){
		cin >> S >> T;
		int i;
		for(i=0;T>=stoll("1"+S);i++){
			S="0"+S;
		}
		printf("%d\n",i);
	}
	return 0;
}

Subtask #1
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2180 KB Output is correct

Subtask #2
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2180 KB Output is correct
2 Correct 39 ms 2180 KB Output is correct
3 Correct 36 ms 2180 KB Output is correct
4 Correct 36 ms 2180 KB Output is correct
5 Correct 39 ms 2180 KB Output is correct
6 Correct 33 ms 2180 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 29 ms 2180 KB Output is correct
2 Correct 39 ms 2180 KB Output is correct
3 Correct 36 ms 2180 KB Output is correct
4 Correct 36 ms 2180 KB Output is correct
5 Correct 39 ms 2180 KB Output is correct
6 Correct 33 ms 2180 KB Output is correct
7 Correct 43 ms 2180 KB Output is correct
8 Correct 43 ms 2180 KB Output is correct
9 Correct 46 ms 2180 KB Output is correct
10 Correct 43 ms 2180 KB Output is correct
11 Correct 113 ms 2180 KB Output is correct