Submission #1632140

---

Source Code Expand

#pragma region include
#include <iostream>
#include <iomanip>
#include <stdio.h>

#include <sstream>
#include <algorithm>
#include <iterator>
#include <cmath>
#include <complex>

#include <string>
#include <cstring>
#include <vector>
#include <tuple>
#include <bitset>

#include <queue>
#include <complex>
#include <set>
#include <map>
#include <stack>
#include <list>

#include <fstream>
#include <random>
//#include <time.h>
#include <ctime>
#pragma endregion //#include
/////////
#define REP(i, x, n) for(int i = x; i < n; ++i)
#define rep(i,n) REP(i,0,n)
#define ALL(X) X.begin(), X.end()
/////////
#pragma region typedef
typedef long long LL;
typedef long double LD;
typedef unsigned long long ULL;
typedef std::pair<LL,LL> PLL;//
typedef std::pair<int,int> PII;//
#pragma endregion //typedef
////定数
const int INF = (int)1e9;
const LL MOD = (LL)1e9+7;
const LL LINF = (LL)1e18+20;
const LD PI = acos(-1.0);
const double EPS = 1e-9;
/////////
using namespace::std;

/*
thx
http://dwango2016-honsen.contest.atcoder.jp/submissions/679288
*/
vector<LL> Nnum;//
LL N;
void make_Nnum(){
	LL ter2,ter5;
	ter2 = 2;
	ter5 = 5;
	Nnum.push_back( ter2 );
	Nnum.push_back( ter5 );
	for(int index=0;ter2<=N && ter5<=N;++index){
		if( index&1 ){
			ter2 = ter2*10 + 2;
			ter5 = ter5*10 + 5;
		}else{
			ter2 = ter2*10 + 5;
			ter5 = ter5*10 + 2;
		}
		Nnum.push_back( ter2 );
		Nnum.push_back( ter5 );
	}
}
map<LL,LL> memo;
LL dfs(LL num){
	if( num == 0 ) return 0;
	if( memo.find(num) != memo.end() ){
		return memo[num];
	}
	LL ret = num;
	vector<LL>::iterator itr,end;
	itr = Nnum.begin();
	end = Nnum.end();
	for(;itr!=end;++itr){
		LL val = (*itr);
		if( val > num ) break;
		ret = min(ret,num%val + dfs(num/val) );
	}
	memo[num] = ret;
	return ret;
}
void solve(){
	cin >> N;
	make_Nnum();
	LL ans = dfs(N);
	cout << ans << endl;
}

#pragma region main
signed main(void){
	std::cin.tie(0);
	std::ios::sync_with_stdio(false);
	std::cout << std::fixed;//小数を10進数表示
	cout << setprecision(16);//小数点以下の桁数を指定//coutとcerrで別	

	solve();
}
#pragma endregion //main()

Submission Info

Judge Result