Submission #1607263

---

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;

LL ansMount = 1;//約数の数
LL ansNumber = 1;//数
LL N;
vector<LL> prime;
vector<LL> val;
void cal(LL num){//約数の数を数える
	int size = val.size();
	LL ans = 1;
	for(int i=0;i<size;++i){
		ans *= (val[i]+1);
	}

	if( ansMount < ans ){
		ansMount = ans;
		ansNumber = num;
	}else if( ansMount == ans ){
		if( num < ansNumber ){
			ansNumber = num;
		}
	}
	
}
void dfs(int v,LL num){
	LL temp = num;
	int Lim;
	if( v == 0 ){
		Lim = INF;
	}else{
		Lim = val[v-1];
	}
	while( (val[v]+1) <= Lim && temp * prime[v] <= N ){
		val[v]++;
		temp *= prime[v];
	}
	cal( temp );

	while( val[v] ){
		dfs(v+1,temp);
		val[v]--;
		temp /= prime[v];
	}
}

void solve(){
	
	const int N_MAX = 100;
	vector<bool> num(N_MAX,true);
	num[0] = false;
	num[1] = false;
	int cnt = 0;
	LL ans = 1;
	for(int i=2;i<N_MAX;++i){
		if( num[i] ){
			prime.push_back( i );
			ans *= LL(i);
			if( ans >= 100000000000000000ll ){
				break;
			}
			for(int j=i+i;j<N_MAX;j+=i){
				num[j] = false;
			}
		}
	}
	/*
	int size = prime.size();
	cout << "[" << size << "]" << endl;
	for(int i=0;i<size;++i){
		cout << prime[i] << " ";
	}
	*/
	val.resize(prime.size(),0);
	int Q;
	cin >> Q;
	while(Q--){
		cin >> N;
		ansMount = 1;
		ansNumber = 1;
		dfs(0,1);
		cout << ansMount << " " << ansNumber << "\n";
	}
	cout << flush;
}

#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