Submission #1872127

---

Source Code Expand

#include <iostream>
#include <map>
using namespace std;
typedef long long ll;
ll n, M=1e9+7;
map<ll, ll> m;
ll f(ll p) {
	if(p<2) return p+1;
	if(m[p]) return m[p];
	return m[p] = (f(p/2) + f((p-1)/2) + f((p-2)/2)) % M;
}

int main() {
	cin>>n;
	cout<<f(n);
	return 0;
}

Submission Info

Judge Result