Codeforces Round #326 (Div. 2)B. Duff in Love
2015-10-16 11:04
295 查看
B. Duff in Love
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Duff is in love with lovely numbers! A positive integer
x is called lovely if and only if there is no such positive integer
a > 1 such that a2 is a divisor of
x.
Malek has a number store! In his store, he has only divisors of positive integer
n (and he has all of them). As a birthday present, Malek wants to give her a
lovely number from his store. He wants this number to be as big as possible.
Malek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.
Input
The first and only line of input contains one integer,
n (1 ≤ n ≤ 1012).
Output
Print the answer in one line.
Sample test(s)
Input
Output
Input
Output
Note
In first sample case, there are numbers 1, 2, 5 and 10 in the shop. 10 isn't divisible by any perfect square, so 10 is
lovely.
In second sample case, there are numbers 1, 2, 3, 4, 6 and 12 in the shop. 12 is divisible by
4 = 22, so 12 is not
lovely, while 6 is indeed
lovely.
题目大意:在n的所有因子中找出,不能被任何平方数整除的,最大的数
解题思路:从2开始一层循环扫到i*i<=n时,碰到可以整除的,就除一个i
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define LL long long
const int MAX=1<<30;
using namespace std;
int main()
{
// freopen("in.txt","r",stdin);
LL n;
cin>>n;
for(LL i=2;i*i<=n;i++)
{
while(n%(i*i)==0)
n/=i;
}
cout<<n<<endl;
return 0;
}
一点小问题吧:一开始没写成while,写成if,就没法把含有多个i*i因子去干净
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
Duff is in love with lovely numbers! A positive integer
x is called lovely if and only if there is no such positive integer
a > 1 such that a2 is a divisor of
x.
Malek has a number store! In his store, he has only divisors of positive integer
n (and he has all of them). As a birthday present, Malek wants to give her a
lovely number from his store. He wants this number to be as big as possible.
Malek always had issues in math, so he asked for your help. Please tell him what is the biggest lovely number in his store.
Input
The first and only line of input contains one integer,
n (1 ≤ n ≤ 1012).
Output
Print the answer in one line.
Sample test(s)
Input
10
Output
10
Input
12
Output
6
Note
In first sample case, there are numbers 1, 2, 5 and 10 in the shop. 10 isn't divisible by any perfect square, so 10 is
lovely.
In second sample case, there are numbers 1, 2, 3, 4, 6 and 12 in the shop. 12 is divisible by
4 = 22, so 12 is not
lovely, while 6 is indeed
lovely.
题目大意:在n的所有因子中找出,不能被任何平方数整除的,最大的数
解题思路:从2开始一层循环扫到i*i<=n时,碰到可以整除的,就除一个i
#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <string>
#include <cmath>
#include <cstdlib>
#include <ctime>
#define LL long long
const int MAX=1<<30;
using namespace std;
int main()
{
// freopen("in.txt","r",stdin);
LL n;
cin>>n;
for(LL i=2;i*i<=n;i++)
{
while(n%(i*i)==0)
n/=i;
}
cout<<n<<endl;
return 0;
}
一点小问题吧:一开始没写成while,写成if,就没法把含有多个i*i因子去干净
相关文章推荐
- 动易2006序列号破解算法公布
- Ruby实现的矩阵连乘算法
- C#插入法排序算法实例分析
- Transformation 能将 Windows XP/Server 2003 操作系统,完美地模拟成 Windows Vista 的软件
- 超大数据量存储常用数据库分表分库算法总结
- C#数据结构与算法揭秘二
- C#冒泡法排序算法实例分析
- 算法练习之从String.indexOf的模拟实现开始
- C#算法之关于大牛生小牛的问题
- C#实现的算24点游戏算法实例分析
- 用javascript和css模拟select的脚本
- c语言实现的带通配符匹配算法
- 浅析STL中的常用算法
- 算法之排列算法与组合算法详解
- C++实现一维向量旋转算法
- Ruby实现的合并排序算法
- C#折半插入排序算法实现方法
- 基于C++实现的各种内部排序算法汇总
- C++线性时间的排序算法分析
- C++实现汉诺塔算法经典实例