結果

問題 No.303 割れません
ユーザー heno239heno239
提出日時 2020-08-23 13:08:36
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
MLE  
実行時間 -
コード長 6,806 bytes
コンパイル時間 1,834 ms
コンパイル使用メモリ 125,996 KB
実行使用メモリ 817,536 KB
最終ジャッジ日時 2024-10-15 18:09:06
合計ジャッジ時間 7,784 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 230 ms
288,640 KB
testcase_01 AC 178 ms
288,768 KB
testcase_02 AC 168 ms
288,640 KB
testcase_03 MLE -
testcase_04 -- -
testcase_05 -- -
testcase_06 -- -
testcase_07 -- -
testcase_08 -- -
testcase_09 -- -
testcase_10 -- -
testcase_11 -- -
testcase_12 -- -
testcase_13 -- -
testcase_14 -- -
testcase_15 -- -
testcase_16 -- -
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include<iostream>
#include<string>
#include<cstdio>
#include<vector>
#include<cmath>
#include<algorithm>
#include<functional>
#include<iomanip>
#include<queue>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
#include<complex>
#include<numeric>
#include<array>
using namespace std;

//#define int long long
typedef long long ll;

typedef unsigned long long ul;
typedef unsigned int ui;
constexpr ll mod = 1000000007;
const ll INF = mod * mod;
typedef pair<int, int>P;
#define stop char nyaa;cin>>nyaa;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
#define all(v) (v).begin(),(v).end()
typedef pair<ll, ll> LP;
typedef long double ld;
typedef pair<ld, ld> LDP;
const ld eps = 1e-12;
const ld pi = acosl(-1.0);

ll mod_pow(ll x, ll n, ll m) {
	ll res = 1;
	while (n) {
		if (n & 1)res = res * x % m;
		x = x * x % m; n >>= 1;
	}
	return res;
}
struct modint {
	ll n;
	modint() :n(0) { ; }
	modint(ll m) :n(m) {
		if (n >= mod)n %= mod;
		else if (n < 0)n = (n % mod + mod) % mod;
	}
	operator int() { return n; }
};
bool operator==(modint a, modint b) { return a.n == b.n; }
modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= mod; return a; }
modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += mod; return a; }
modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }
modint operator+(modint a, modint b) { return a += b; }
modint operator-(modint a, modint b) { return a -= b; }
modint operator*(modint a, modint b) { return a *= b; }
modint operator^(modint a, ll n) {
	if (n == 0)return modint(1);
	modint res = (a * a) ^ (n / 2);
	if (n % 2)res = res * a;
	return res;
}

ll inv(ll a, ll p) {
	return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);
}
modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }

const int max_n = 1 << 18;
modint fact[max_n], factinv[max_n];
void init_f() {
	fact[0] = modint(1);
	for (int i = 0; i < max_n - 1; i++) {
		fact[i + 1] = fact[i] * modint(i + 1);
	}
	factinv[max_n - 1] = modint(1) / fact[max_n - 1];
	for (int i = max_n - 2; i >= 0; i--) {
		factinv[i] = factinv[i + 1] * modint(i + 1);
	}
}
modint comb(int a, int b) {
	if (a < 0 || b < 0 || a < b)return 0;
	return fact[a] * factinv[b] * factinv[a - b];
}

struct bigint {
	string s;
	bigint() {};
	bigint(ll n) { s = to_string(n); };
	bigint(string t) { s = t; };
};
bool operator==(const bigint& a, const bigint& b) { return a.s == b.s; };
bool operator==(const bigint& a, const int& b) { return a.s == to_string(b); };
bool operator!=(const bigint& a, const bigint& b) { return !(a == b); };
bool operator!=(const bigint& a, const int& b) { return a != to_string(b); };
bool operator<(const bigint& a, const bigint& b) {
	if (a.s.length() != b.s.length())return a.s.length() < b.s.length();
	return a.s < b.s;
}
bool operator>(const bigint& a, const bigint& b) {
	if (a.s.length() != b.s.length())return a.s.length() > b.s.length();
	return a.s > b.s;
}
bool operator>=(const bigint& a, const bigint& b) {
	return !(a < b);
}
bool operator<=(const bigint& a, const bigint& b) {
	return !(a > b);
}
bigint operator+(const bigint& a, const bigint& b) {
	int len = max(a.s.length(), b.s.length());
	bigint ret; bool f = false;
	rep(i, len) {
		int c = 0;
		if (f)c = 1, f = false;
		int j = a.s.length() - 1 - i;
		if (j >= 0)c += a.s[j] - '0';
		j = b.s.length() - 1 - i;
		if (j >= 0)c += b.s[j] - '0';
		if (c >= 10)f = true, c -= 10;
		ret.s.push_back('0' + c);
	}
	if (f)ret.s.push_back('1');
	reverse(ret.s.begin(), ret.s.end()); return ret;
}
bigint operator+(const bigint& a, const int b) {
	return a + bigint(b);
}
bigint operator-(const bigint& a, const bigint& b) {
	int len = max(a.s.length(), b.s.length());
	bigint ret; bool f = false;
	rep(i, len) {
		int c = 0;
		if (f)c = -1, f = false;
		int j = a.s.length() - 1 - i;
		if (j >= 0)c += a.s[j] - '0';
		j = b.s.length() - 1 - i;
		if (j >= 0)c -= b.s[j] - '0';
		if (c < 0)f = true, c += 10;
		ret.s.push_back('0' + c);
	}
	while (ret.s.size() > 1 && ret.s.back() == '0')ret.s.pop_back();
	reverse(ret.s.begin(), ret.s.end());
	return ret;
}
bigint operator/(const bigint& a, const bigint& b) {
	bigint ret(0);
	bigint ans;
	int len = a.s.length();
	rep(i, len) {
		ret = ret + (a.s[i] - '0');
		int cnt = 0;
		while (ret >= b)++cnt, ret = ret - b;
		ans.s.push_back('0' + cnt);
		if (ret != 0)ret.s.push_back('0');
	}
	rep(i, ans.s.length()) {
		if (ans.s[i] != '0') {
			ans.s.erase(ans.s.begin(), ans.s.begin() + i);
			break;
		}
		if (i == (int)ans.s.length() - 1) {
			ans = 0;
		}
	}
	return ans;
}
bigint operator%(const bigint& a, const bigint& b) {
	bigint ret(0);
	int len = a.s.length();
	rep(i, len) {
		ret = ret + (a.s[i] - '0');
		while (ret >= b)ret = ret - b;
		if (ret != 0 && i < len - 1)ret.s.push_back('0');
	}

	rep(i, ret.s.size()) {
		if (ret.s[i] != '0' || i == ret.s.size() - 1) {
			ret.s.erase(ret.s.begin(), ret.s.begin() + i);
			break;
		}
	}
	return ret;
}
bigint multi(const bigint& a, const int& t) {
	bigint ret;
	int c = 0;
	per(i, a.s.length()) {
		c += (a.s[i] - '0') * t;
		ret.s.push_back('0' + (c % 10));
		c /= 10;
	}
	while (c > 0) {
		ret.s.push_back('0' + (c % 10));
		c /= 10;
	}
	while (ret != 0 && ret.s.back() == '0')ret.s.pop_back();
	reverse(ret.s.begin(), ret.s.end());
	return ret;
}
bigint operator*(const bigint& a, const bigint& b) {
	bigint ret(0);
	int l = b.s.length();
	rep(i, b.s.length()) {
		bigint u = multi(a, (b.s[l - 1 - i] - '0'));
		if (u != 0) {
			rep(j, i)u.s.push_back('0');
		}
		ret = ret + u;
	}
	rep(i, ret.s.size()) {
		if (ret.s[i] != '0' || i == ret.s.size() - 1) {
			ret.s.erase(ret.s.begin(), ret.s.begin() + i);
			break;
		}
	}
	return ret;
}
bigint min(const bigint& a, const bigint& b) {
	if (a < b)return a;
	else return b;
}

bigint gcd(bigint a, bigint b) {
	if (a < b)swap(a, b);
	while (b > 0) {
		bigint r = a % b; a = b; b = r;
	}
	return a;
}
typedef pair<bigint, bigint> bP;


bigint dp[3000001];
bigint rdp[3000001][2];
bigint calc(ll n) {
	dp[0] = 1;
	rdp[1][0] = 1;
	rep1(i, n) {
		dp[i] = rdp[i][(i - 1) % 2];
		rep(j, 2)rdp[i + 1][j] = rdp[i][j];
		rdp[i + 1][i % 2] = rdp[i+1][i%2]+ dp[i];
	}
	return dp[n];
}
void solve() {
	ll n; cin >> n;
	bigint ans = calc(n);
	if (n % 2 == 0)ans = ans -  calc(n / 2)* calc(n / 2);
	cout << n << "\n";
	cout << ans.s << "\n";
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(15);
	//init_f();
	//expr();
	//int t; cin >> t; rep(i, t)
	solve();
	return 0;
}
0