找新朋友 |
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) |
Total Submission(s): 4159 Accepted Submission(s): 1891 |
Problem Description
新年快到了,“猪头帮协会”准备搞一个聚会,已经知道现有会员N人,把会员从1到N编号,其中会长的号码是N号,凡是和会长是老朋友的,那么该会员的号码肯定和N有大于1的公约数,否则都是新朋友,现在会长想知道究竟有几个新朋友?请你编程序帮会长计算出来。
|
Input
第一行是测试数据的组数CN(Case number,1<CN<10000),接着有CN行正整数N(1<n<32768),表示会员人数。
|
Output
对于每一个N,输出一行新朋友的人数,这样共有CN行输出。
|
Sample Input
2
25608
24027
|
Sample Output
7680
16016
|
Author
SmallBeer(CML)
|
Source
杭电ACM集训队训练赛(VII)
|
Recommend
lcy
|
第一版代码:
思路:最大公约数为一说明是新朋友
代码如下:
#include <iostream>
using namespace std;
/*
* 最大公约数的递归:
* 1、若a可以整除b,则最大公约数是b
* 2、如果1不成立,最大公约数便是b与a%b的最大公约数
*/
unsigned int gcd(int aVal, int bVal)
{
return aVal%bVal ? gcd(bVal, aVal%bVal) : bVal;
}
int main()
{
unsigned int CN = 0;
unsigned int memNum = 0;
int nNewFriends = 0;
cin >> CN;
// Judge first
while (CN--)
{
cin >> memNum;
for (int index = 1; index < memNum; index++)
{
// 最大公约数为1 说明是新朋友
if (1 == gcd(memNum, index))
{
nNewFriends++;
}
}
cout << nNewFriends << endl;
nNewFriends = 0;
}
//system("pause");
return 0;
}
缺点:算法复杂度太高,接近O(n^n),
Time Limit Exceeded 提交失败
优化
思路:只有有一个数和它的最大公约数不为1,则它的整数倍的数均成立
代码如下:
#include <iostream>
#define MAX_NUM 32770
using namespace std;
int main()
{
unsigned int CN = 0;
int k = 0;
unsigned int memNum = 0;
unsigned int member[MAX_NUM];
int nNewFriends = 0;
cin >> CN;
// Judge first
while (CN--)
{
memset(member, 0, sizeof(member));
cin >> memNum;
for (int index = 2; index < memNum; index++)
{
if (memNum % index == 0)
{
for (k = index; k < memNum; k += index)
{
member[k] = 1;
}
}
}
for (int i = 1; i < memNum; i++)
{
if (member[i] == 0)
{
nNewFriends++;
}
}
cout << nNewFriends << endl;
nNewFriends = 0;
}
//system("pause");
return 0;
}
第三版:
优化重复查找
#include <iostream>
#define MAX_NUM 32770
using namespace std;
int main()
{
unsigned int CN = 0;
int k = 0;
unsigned int memNum = 0;
unsigned int member[MAX_NUM];
int nNewFriends = 0;
cin >> CN;
// Judge first
while (CN--)
{
memset(member, 0, sizeof(member));
cin >> memNum;
for (int index = 2; index < memNum; index++)
{
if ((memNum % index == 0) && (member[index] == 0))
{
for (k = index; k < memNum; k += index)
{
member[k] = 1;
}
}
}
for (int i = 1; i < memNum; i++)
{
if (member[i] == 0)
{
nNewFriends++;
}
}
cout << nNewFriends << endl;
nNewFriends = 0;
}
//system("pause");
return 0;
}
Accept