Submission #1627573

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> P;
typedef pair<int,P> P1;
typedef pair<P,P> P2;
#define pu push
#define pb push_back
#define mp make_pair
#define eps 1e-7
#define INF 1000000000
#define mod 1000000007
#define fi first
#define sc second
#define rep(i,x) for(int i=0;i<x;i++)
#define repn(i,x) for(int i=1;i<=x;i++)
#define SORT(x) sort(x.begin(),x.end())
#define ERASE(x) x.erase(unique(x.begin(),x.end()),x.end())
#define POSL(x,v) (lower_bound(x.begin(),x.end(),v)-x.begin())
#define POSU(x,v) (upper_bound(x.begin(),x.end(),v)-x.begin())
string n;
bool rec(int val){
	int cur = val*9;
	int up = 0;
	for(int i=0;i<n.size();i++){
		if(i==n.size()-1){
			return (up+cur>=n[i]-'0');
		}
		else{
			int target = n[i]-'0';
			target -= up;
			target = (target%10+10)%10;
			while(1){
				if(cur%10==target) break;
				else if(cur==0) return 0;
				cur--;
			}
			up = (cur+up)/10;
		}
	}
}
int main(){
	cin>>n; reverse(n.begin(),n.end());
	int lb = 0,ub = 500005;
	while(ub-lb>1){
		ll mid = (lb+ub)/2;
		if(rec(mid)) ub=mid;
		else lb=mid;
	}
	cout<<ub<<endl;
}

Submission Info

Judge Result