oj.uz

Submission #152421

# Submission time Handle Problem Language Result Execution time Memory
152421 2019-09-08T01:22:20 Z cheetose 채점 시스템 (OJUZ11_judge) C++11
100 / 100
 36 ms 632 KB 
#include<cstdio>
#include<cstdlib>
#include<iostream>
#include<vector>
#include<queue>
#include<bitset>
#include<string>
#include<stack>
#include<set>
#include<unordered_set>
#include<map>
#include<unordered_map>
#include<cstring>
#include<complex>
#include<cmath>
#include<iomanip>
#include<numeric>
#include<algorithm>
#include<list>
#include<functional>
#include<cassert>
#define mp make_pair
#define pb push_back
#define X first
#define Y second
#define y0 y12
#define y1 y22
#define INF 987654321
#define PI 3.141592653589793238462643383279502884
#define fup(i,a,b,c) for(int (i)=(a);(i)<=(b);(i)+=(c))
#define fdn(i,a,b,c) for(int (i)=(a);(i)>=(b);(i)-=(c))
#define MEM0(a) memset((a),0,sizeof(a));
#define MEM_1(a) memset((a),-1,sizeof(a));
#define ALL(a) a.begin(),a.end()
#define SYNC ios_base::sync_with_stdio(false);cin.tie(0)
using namespace std;
typedef long long ll;
typedef long double ld;
typedef double db;
typedef unsigned int uint;
typedef unsigned long long ull;
typedef pair<int, int> Pi;
typedef pair<ll, ll> Pll;
typedef pair<ld, ld> Pd;
typedef vector<int> Vi;
typedef vector<ll> Vll;
typedef vector<double> Vd;
typedef vector<Pi> VPi;
typedef vector<Pll> VPll;
typedef vector<Pd> VPd;
typedef tuple<int, int, int> iii;
typedef tuple<int,int,int,int> iiii;
typedef tuple<ll, ll, ll> LLL;
typedef vector<iii> Viii;
typedef vector<LLL> VLLL;
typedef complex<double> base;
const ll MOD = 1000000007;
ll POW(ll a, ll b, ll MMM = MOD) {ll ret=1; for(;b;b>>=1,a=(a*a)%MMM)if(b&1)ret=(ret*a)% MMM; return ret; }
ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
ll lcm(ll a, ll b) { if (a == 0 || b == 0)return a + b; return a*(b / gcd(a, b)); }
int dx[] = { 0,1,0,-1,1,1,-1,-1 }, dy[] = { 1,0,-1,0,1,-1,1,-1 };

ll p[18];
int len(ll x)
{
	if(x==0)return 1;
	int c=0;
	while(x)
	{
		c++;
		x/=10;
	}
	return c;
}
int main() {
	p[0]=1;
	fup(i,1,17,1)p[i]=p[i-1]*10;
	int tc;
	scanf("%d",&tc);
	while(tc--)
	{
		ll x,t;
		scanf("%lld%lld",&x,&t);
		int l=len(x);
		if(p[l]+x>t)puts("0");
		else
		{
			int ans=0;
			fup(i,l,17,1)
			{
				if(p[i]+x>t)break;
				ans++;
			}
			printf("%d\n",ans);
		}
	}
}

Compilation message

judge.cpp: In function 'int main()':
judge.cpp:79:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d",&tc);
  ~~~~~^~~~~~~~~~
judge.cpp:83:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld",&x,&t);
   ~~~~~^~~~~~~~~~~~~~~~~~

Subtask #1
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 504 KB Output is correct

Subtask #2
47.0 / 47.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 504 KB Output is correct
2 Correct 30 ms 504 KB Output is correct
3 Correct 30 ms 476 KB Output is correct
4 Correct 30 ms 504 KB Output is correct
5 Correct 30 ms 632 KB Output is correct
6 Correct 30 ms 568 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 504 KB Output is correct
2 Correct 30 ms 504 KB Output is correct
3 Correct 30 ms 476 KB Output is correct
4 Correct 30 ms 504 KB Output is correct
5 Correct 30 ms 632 KB Output is correct
6 Correct 30 ms 568 KB Output is correct
7 Correct 36 ms 508 KB Output is correct
8 Correct 36 ms 448 KB Output is correct
9 Correct 36 ms 512 KB Output is correct
10 Correct 36 ms 492 KB Output is correct
11 Correct 35 ms 476 KB Output is correct