Submission #803245

---

Source Code Expand

#include <algorithm>
#include <vector>
#include <math.h>
#include <stdio.h>
#include <cctype>
#include <iostream>
#include <set>
#include <string>
#include <queue>
#include <map>
#include <utility>
using namespace std;
int size(string x){
	string::size_type size=x.size();
	return size;
}
#define fu(l,k) for(int i=l;i<k;i++)
#define fd(l,k) for(int i=l;i>k;i--)
#define sort(ss) sort(ss.begin(), ss.end())
#define rsort(ss) sort(ss.rbegin(), ss.rend())
typedef  vector<string> vs;
typedef  vector<int> vi;
double pi(){
	return acos(-1.0);
}
typedef set<int> set_i;
typedef set<string> set_s;
int INF=1000000;
int main(){
	long long int a,k,ss=0,ans=0;
	cin>>a>>k;
	ss=a;
	if(k==0){
		ans=(long long)(2*pow(10,12))-ss;
	}
	else{
		while(1){
			if(ss>=(long long)(2*pow(10,12))) break;
			ans++;
			ss+=1+k*ss;
		}
	}
	cout<<ans<<endl;
}

Submission Info

Judge Result