微软笔试-Divisors
2016-03-24 14:56
281 查看
时间限制:10000ms
单点时限:1000ms
内存限制:256MB
Given an integer n, for all integers not larger than n, find the integer with the most divisors. If there is more than one integer with the same number of divisors, print the minimum one.
One line with an integer n.
For 30% of the data, n ≤ 103
For 100% of the data, n ≤ 1016
One line with an integer that is the answer.
样例输入
样例输出
代码区:
单点时限:1000ms
内存限制:256MB
描述
Given an integer n, for all integers not larger than n, find the integer with the most divisors. If there is more than one integer with the same number of divisors, print the minimum one.
输入
One line with an integer n.For 30% of the data, n ≤ 103
For 100% of the data, n ≤ 1016
输出
One line with an integer that is the answer.样例输入
100
样例输出
60
代码区:
// MS.cpp : 定义控制台应用程序的入口点。 // #include "stdafx.h" #include <iostream> #include <math.h> #include <set> #include <algorithm> using namespace std; int primes[14]{ 2,3,5,7,11,13,17,19,23,29,31,37,41,43}; int maxdivs; long long result; long long N; void DFS(long long now,int divs, int primeIndex, int lastni) { if (now > N) return; if (maxdivs < divs || (maxdivs == divs&&now < result)) { maxdivs = divs; result = now; } int i = 1; while (now*pow(primes[primeIndex], i) <= N && i <= lastni) { long long newvalue = now*pow(primes[primeIndex],i); DFS(newvalue, divs*(i + 1), primeIndex + 1, i); i++; } } int main() { while (cin >> N) { int maxni = log2(N); result = 1; maxdivs = 0; for (int i = 0; i <= maxni; ++i) { DFS(pow(2, i), i + 1,1, i); } cout << result << endl; } return 0; }
相关文章推荐
- 书评:《算法之美( Algorithms to Live By )》
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例
- PHP实现克鲁斯卡尔算法实例解析