#210793 (C++11) No.375 立方体のN等分 (1)

• 問題: No.375 立方体のN等分 (1)
• ユーザー: komori3
• 提出日時: 2017-10-21 05:24:21
• 言語: C++11 (gcc 11.4.0)
• 結果: AC
• 実行時間: 114 ms / 5,000 ms
• コード長: 2,275 bytes
• コンパイル時間: 740 ms
• コンパイル使用メモリ: 80,016 KB
• 実行使用メモリ: 5,248 KB
• 最終ジャッジ日時: 2024-11-21 11:18:22
• 合計ジャッジ時間: 2,368 ms
• ジャッジサーバーID （参考情報）: judge2 / judge1

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	2 ms; 5,248 KB
testcase_01	AC	2 ms; 5,248 KB
testcase_02	AC	23 ms; 5,248 KB
testcase_03	AC	2 ms; 5,248 KB
testcase_04	AC	2 ms; 5,248 KB
testcase_05	AC	2 ms; 5,248 KB
testcase_06	AC	2 ms; 5,248 KB
testcase_07	AC	5 ms; 5,248 KB
testcase_08	AC	16 ms; 5,248 KB
testcase_09	AC	4 ms; 5,248 KB
testcase_10	AC	7 ms; 5,248 KB
testcase_11	AC	7 ms; 5,248 KB
testcase_12	AC	8 ms; 5,248 KB
testcase_13	AC	9 ms; 5,248 KB
testcase_14	AC	53 ms; 5,248 KB
testcase_15	AC	11 ms; 5,248 KB
testcase_16	AC	8 ms; 5,248 KB
testcase_17	AC	88 ms; 5,248 KB
testcase_18	AC	58 ms; 5,248 KB
testcase_19	AC	11 ms; 5,248 KB
testcase_20	AC	6 ms; 5,248 KB
testcase_21	AC	5 ms; 5,248 KB
testcase_22	AC	114 ms; 5,248 KB
testcase_23	AC	9 ms; 5,248 KB
testcase_24	AC	5 ms; 5,248 KB
testcase_25	AC	21 ms; 5,248 KB
testcase_26	AC	8 ms; 5,248 KB
testcase_27	AC	11 ms; 5,248 KB
testcase_28	AC	5 ms; 5,248 KB
testcase_29	AC	5 ms; 5,248 KB
testcase_30	AC	8 ms; 5,248 KB
testcase_31	AC	10 ms; 5,248 KB
testcase_32	AC	5 ms; 5,248 KB
testcase_33	AC	8 ms; 5,248 KB

ソースコード

#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <climits>
#include <cmath>
#include <string>
#include <vector>
#include <algorithm>
#include <queue>
#include <map>
#include <functional>
#include <set>
#include <numeric>
#include <stack>
#include <utility>
#include <time.h>
#include <iterator>
//#include "util.h"

using namespace std;
typedef unsigned uint;
typedef long long lint;
typedef unsigned long long ulint;



//呪文
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const pair<_KTy, _Ty>& m) { cout << "{" << m.first << ", " << m.second << "}"; return ostr; }
template <typename _KTy, typename _Ty> ostream& operator << (ostream& ostr, const map<_KTy, _Ty>& m) { if (m.empty()) { cout << "{ }"; return ostr; } cout << "{" << *m.begin(); for (auto itr = ++m.begin(); itr != m.end(); itr++) { cout << ", " << *itr; } cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const vector<_Ty>& v) { if (v.empty()) { cout << "{ }"; return ostr; }	cout << "{" << v.front(); for (auto itr = ++v.begin(); itr != v.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
template <typename _Ty> ostream& operator << (ostream& ostr, const set<_Ty>& s) { if (s.empty()) { cout << "{ }"; return ostr; } cout << "{" << *(s.begin()); for (auto itr = ++s.begin(); itr != s.end(); itr++) { cout << ", " << *itr; }	cout << "}"; return ostr; }
//template <typename T> void print(T* v, int N) { if (N == 0) cout << "{ }"; cout << "{" << v[0]; for (int i = 1; i < N; i++) cout << ", " << v[i]; cout << "}"; }
#define PI 3.14159265358979323846
#define EPS 1e-8
#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()



int yuki0375()
{
	lint N;
	cin >> N;

	double q = pow((double)N, (double)1 / 3);

	lint m = 100000000000;
	for (lint a = 1; a <= q + EPS; a++) {
		if (N % a) continue;
		lint NN = N / a;
		double s = sqrt(NN);
		for (lint b = 1; b <= s + EPS; b++) {
			if (NN % b) continue;
			lint c = NN / b;
			m = min(m, a + b + c - 3);
		}
	}

	cout << m << " " << N - 1 << endl;

	return 0;
}

int main()
{
	//clock_t start, end;
	//start = clock();

	yuki0375();

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

	return 0;
}