UVA 1575

从n的范围容易得出素数的范围不会超过100，所以首先将100以内的素数找出来，然后按照dfs，逐步的枚举所选择的的素数的个数，在枚举的同时计算出n以及k的值即可，同时注意枚举的素数的个数是逐步减少的，因为题目中要求得到的k的值要尽量的小，而我们存储在prime中的素数是从小到大排列的，所以尽量多选小的，少选大的，具体实现见如下代码：

#include<iostream>
#include<vector>
#include<string>
#include<set>
#include<stack>
#include<queue>
#include<map>
#include<algorithm>
#include<cmath>
#include<iomanip>
#include<cstring>
#include<sstream>
#include<cstdio>
#include<deque>
#include<functional>
using namespace std;

typedef unsigned long long LL;
LL n;

vector<int> prime;
bool vis[110];
LL C[101][101];


void Init(){
	prime.push_back(0);
	memset(vis, 0, sizeof(vis));
	for (int i = 2; i <= 100; i++){
		if (!vis[i]){
			prime.push_back(i);
			for (int j = i*i; j <= 100; j += i)
				vis[j] = 1;
		}
	}
	C[0][0] = 1;
	for (int i = 1; i <= 100; i++){
		C[0][i] = C[i][i] = 1;
		for (int j = 1; j < i; j++)
			C[j][i] = C[j - 1][i - 1] + C[j][i-1];
	}
}


void dfs(LL cur_k,LL& ans,LL cur_n,int ind,int pre,int up){
	if (cur_k > ans) return;
	if (cur_n == n){ 
		ans = cur_k;
		return;
	}
	if (ind >= prime.size() || cur_n > n) return;
	LL temp = 1;
	for (int i = 1; i <= up; i++){
		temp *= prime[ind];
		if (cur_k >= ans / temp) return;
		dfs(cur_k*temp, ans, cur_n*C[i][pre+i], ind + 1, pre + i, i);
	}
}

int main(){
	Init();
	while (cin >> n){
		if (n == 1) cout << "1 2\n";
		else{
			LL ans = (LL)1 << 63;
			dfs(1, ans, 1, 1, 0, 63);
			cout << n << " " << ans << endl;
		}
	}
	return 0;
}