Submission #1382831

---

Source Code Expand

#include <cstdio>
#include <cstdlib>
#include <cmath>
#include <climits>
#include <cfloat>
#include <cstring>
#include <map>
#include <utility>
#include <set>
#include <iostream>
#include <memory>
#include <string>
#include <vector>
#include <list>
#include <algorithm>
#include <functional>
#include <sstream>
#include <complex>
#include <stack>
#include <queue>
#include <unordered_set>
#include <unordered_map>
#include <array>
#include <cassert>
#include <bitset>
using namespace std;
using LL = long long;

using P = pair<LL, LL>;

const LL MOD = 1000000007;

map<P, LL>memo;
LL dp(LL S, LL X)
{
	if (memo.count(P(S, X)))
		return memo[P(S, X)];
	if (S == 0)return 1;
	if (X == 0)return S / 2;
	if (S == 1)return 2;
	LL yet = dp(S / 2, X / 2) + dp((S - 1) / 2, (X - 1) / 2) + dp((S - 2) / 2, X / 2);
	yet %= MOD;
	return memo[P(S, X)] = yet;
}

int main()
{
	//memo[P(0, 0)] = memo[P(0, 1)] = memo[P(1, 0)] = 1ll;
	//memo[P(1, 1)] = 2ll;
	LL N;
	cin >> N;
	LL ans = dp(N, N);
	cout << ans << endl;
	return 0;
}

Submission Info

Judge Result