1053: [HAOI2007]反素数ant
Time Limit: 10 Sec Memory Limit: 162 MB
Description
对于任何正整数x,其约数的个数记作g(x)。例如g(1)=1、g(6)=4。如果某个正整数x满足:g(x)>g(i) 0<i<x,则称x为反质数。例如,整数1,2,4,6等都是反质数。现在给定一个数N,你能求出不超过N的最大的反质数么?
Input
一个数N(1<=N<=2,000,000,000)。
Output
不超过N的最大的反质数。
Sample Input
1000
Sample Output
840
这里问最大的反素数其实就是问约数个数最多的最小正整数,这里的数据规模是2,000,000,000,
可以算出最多不超出10个素因子。
接着深搜就可以了。
还有一些定理这里就不说了。上一篇博客有讲。
/**************************************************************
Problem: 1053
User: _ostreamBaba
Language: C++
Result: Accepted
Time:0 ms
Memory:1296 kb
****************************************************************/
#include<iostream>
#include<cstring>
#include<cstdlib>
#include<algorithm>
#include<cctype>
#include<cmath>
#include<ctime>
#include<string>
#include<stack>
#include<deque>
#include<queue>
#include<list>
#include<set>
#include<map>
#include<cstdio>
#include<limits.h>
#define MOD 1000000007
#define fir first
#define sec second
#define fin freopen("/home/ostreambaba/文档/input.txt", "r", stdin)
#define fout freopen("/home/ostreambaba/文档/output.txt", "w", stdout)
#define mes(x, m) memset(x, m, sizeof(x))
#define Pii pair<int, int>
#define Pll pair<ll, ll>
#define INF 1e9+7
#define Pi 4.0*atan(1.0)
#define lowbit(x) (x&(-x))
#define lson l,m,rt<<1
#define rson m+1,r,rt<<1|1
#define scin(n) scanf("%d", &n)
#define scout(n) printf("%d\n", n);
typedef long long ll;
typedef unsigned long long ull;
const double eps = 1e-6;
const int maxn = 50010;
using namespace std;
ll res, N;
int maxSum;
const int prime[10] = {2, 3, 5, 7, 11, 13, 17, 19, 23, 29}; //列出素因子
inline void dfs(int k, ll sum, int cnt, int limits)
{
if(k >= 10){
return;
}
if(cnt > maxSum){
maxSum = cnt;
res = sum;
}
if(maxSum == cnt && sum < res){
res = sum;
}
for(int i = 1; i <= limits; ++i){
if(N/prime[k] < sum){
break;
}
dfs(k + 1, sum*=prime[k], cnt*(i+1), i);
}
}
int log2(const ll &m)
{
int count = 0;
ll tmp = 1;
while(tmp < m){
tmp <<= 1;
++count;
}
return count;
}
int main()
{
cin >> N;
res = LLONG_MAX;
maxSum = 0;
// cout << res << endl;
dfs(0, 1, 1, log2(N));
cout << res << endl;
return 0;
}