题目链接:
HDU 4542 小明系列故事——未知剩余系
#include <iostream>
#include <cstdio>
#include <cstring>
#include <string>
#include <algorithm>
#include <climits>
#include <cmath>
#include <ctime>
#include <cassert>
#define IOS ios_base::sync_with_stdio(0); cin.tie(0);
using namespace std;
typedef long long ll;
typedef unsigned long long lint;
const lint inf = (lint)1 << 62;
const int prime[]= {2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53};
const int MAX_N = 50010;
int T, cnt, type, k, cases = 0, id[MAX_N];
lint ans;
void init()
{
for(int i = 1; i < MAX_N; ++i) id[i] = i; //初始化id[i]最多有i个数与其互质
for(int i = 1; i < MAX_N; ++i) {
for(int j = i; j < MAX_N; j += i) id[j]--; //根据j的约数有i,id[j]--
if(id[id[i]] == 0) id[id[i]] = i;
//因为我们最终是要将id[k]表示成约数个数为n-k的最小数n,如果此时id[id[i]]=0说明小于i的数中不存在数x
//使得x的约数个数为x-id[i],那么实际上使得约数个数恰为n-id[i]的最小数n只能是i了
id[i] = 0; //显然小于等于i的数不存在数x使得x的约数个数恰为x-i个,所以要赋id[i]=0
}
}
void dfs(int depth, int limit, lint tmp, int num)
{
if(tmp > inf || num > k) return;
if(num == k && tmp < ans) ans = tmp;
for(int i = 1; i <= limit; ++i) {
if((double)tmp * prime[depth] > ans) break;
tmp *= prime[depth];
if(k % (num * (i + 1)) == 0) dfs(depth + 1, i, tmp, num * (i + 1));
}
}
int main()
{
init();
scanf("%d", &T);
while(T--) {
cin >> type >> k;
ans = inf + 1, cnt = 0;
if(type == 0) dfs(0, 62, 1, 1);
else ans = id[k];
cout << "Case " << ++cases << ": ";
if(ans == 0) cout << "Illegal" << endl;
else if(ans == inf + 1) cout << "INF" << endl;
else cout << ans << endl;
}
return 0;
}