結果

問題 No.639 An Ordinary Sequence
コンテスト
ユーザー komori3
提出日時 2018-02-19 03:03:33
言語 C++11（廃止可能性あり）
(gcc 13.3.0)
結果
AC  
実行時間 2 ms / 1,000 ms
コード長 4,659 bytes
コンパイル時間 1,891 ms
コンパイル使用メモリ 171,724 KB
実行使用メモリ 6,820 KB
最終ジャッジ日時 2025-01-02 02:18:43
合計ジャッジ時間 2,647 ms
ジャッジサーバーID
（参考情報） 		judge4 / judge1
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 2
other AC * 17
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define _CRT_SECURE_NO_WARNINGS
#include "bits/stdc++.h"
#include <random>
//#include "util.k"

using namespace std;

//呪文
#define DUMPOUT cout
#define dump(...) DUMPOUT<<"  ";DUMPOUT<<#__VA_ARGS__<<" :["<<__LINE__<<":"<<__FUNCTION__<<"]"<<endl;DUMPOUT<<"    ";dump_func(__VA_ARGS__)

typedef unsigned uint; typedef long long ll; typedef unsigned long long ull; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; typedef pair<string, string> pss;
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { ostr << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { ostr << ", " << *itr; }	ostr << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const stack<_Ty>& s) { if (s.empty()) { ostr << "{ }"; return ostr; } stack<_Ty> t(s); ostr << "{" << t.top(); t.pop(); while (!t.empty()) { ostr << ", " << t.top(); t.pop(); } ostr << "}";	return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const list<_Ty>& l) { if (l.empty()) { ostr << "{ }"; return ostr; } ostr << "{" << l.front(); for (auto itr = ++l.begin(); itr != l.end(); ++itr) { ostr << ", " << *itr; } ostr << "}"; return ostr; }
template <typename _KTy, typename _Ty> istream& operator >> (istream& istr, pair<_KTy, _Ty>& m) { istr >> m.first >> m.second; return istr; }
template <typename _Ty> istream& operator >> (istream& istr, vector<_Ty>& v) { for (size_t i = 0; i < v.size(); i++) istr >> v[i]; return istr; }
namespace aux { // print tuple
	template<typename Ty, unsigned N, unsigned L> struct tp { static void print(ostream& os, const Ty& v) { os << get<N>(v) << ", "; tp<Ty, N + 1, L>::print(os, v); } };
	template<typename Ty, unsigned N> struct tp<Ty, N, N> { static void print(ostream& os, const Ty& value) { os << get<N>(value); } };
}
template<typename... Tys> ostream& operator<<(ostream& os, const tuple<Tys...>& t) { os << "{"; aux::tp<tuple<Tys...>, 0, sizeof...(Tys)-1>::print(os, t); os << "}"; return os; }

template<typename A, size_t N, typename T> inline void Fill(A(&array)[N], const T &val) { std::fill((T*)array, (T*)(array + N), val); }

void dump_func() { DUMPOUT << endl; }
template <class Head, class... Tail> void dump_func(Head&& head, Tail&&... tail) { DUMPOUT << head; if (sizeof...(Tail) == 0) { DUMPOUT << " "; } else { DUMPOUT << ", "; } dump_func(std::move(tail)...); }

#define PI 3.14159265358979323846
#define EPS 1e-11
#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define REP(i,n)  FOR(i,0,n)
#define all(x) (x).begin(), (x).end()
#define SZ(x) ((int)(x).size())
#define fake false



template <typename Ty>
Ty ipow(Ty x, Ty n) {
	Ty ret = Ty(1);
	for (Ty i = Ty(0); i < n; i++) ret *= x;
	return ret;
}

int main() {

	//clock_t start, end;
	//start = clock();
	
	/*
	vector<ll> aa(100000);
	aa[0] = 1;
	ll cur = 1;
	for (int i = 1; i < 100000; i++) {
		aa[i] = aa[i / 3] + aa[i / 5];
		if (aa[i] != cur) {
			cout << i << " : " << aa[i] << endl;
			cur = aa[i];
		}
	}
	*/

	double lg3 = log10(3), lg5 = log10(5);

	set<ll> st;
	st.insert(0);
	for (ll p = 0; p * lg3 <= 18; p++) {
		for (ll q = 0; p * lg3 + q * lg5 <= 18; q++) {
			st.insert(ipow(3LL, p) * ipow(5LL, q));
		}
	}

	vector<ll> v;
	v.assign(st.begin(), st.end());

	map<ll, ll> a;
	a[0] = 1;

	for (auto itr = ++st.begin(); itr != st.end(); itr++) {
		ll e = *itr;
		ll x = *(upper_bound(v.begin(), v.end(), e / 3) - 1);
		ll y = *(upper_bound(v.begin(), v.end(), e / 5) - 1);

		//dump(e, x, y);

		a[e] = a[x] + a[y];
		//dump(a[e], a[x], a[y]);
	}
	/*
	for (const auto& e : st) {
		ll x = a[*lower_bound(v.begin(), v.end(), e / 3)];
		ll y = a[*lower_bound(v.begin(), v.end(), e / 5)];

		a[e] = x + y;
	}
	*/

	ll N;
	cin >> N;

	cout << a[*(upper_bound(v.begin(), v.end(), N) - 1)] << endl;
	//dump(a);

	//end = clock();
	//printf("%d msec.\n", end - start);

	return 0;
}
0