东大OJ-1430-PrimeNumbers

最新推荐文章于 2020-10-25 02:19:37 发布

原创最新推荐文章于 2020-10-25 02:19:37 发布 · 856 阅读

0 ·

CC 4.0 BY-SA版权

数论专栏收录该内容

12 篇文章

订阅专栏

本文详细介绍了如何通过编程解决一个数学问题，即确定给定整数的不同质因数数量。提供了算法实现和样例输入输出，帮助读者理解并解决类似问题。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

题目描述

I'll give you a number , please tell me how many different prime factors in this number.

输入

There is multiple test cases , in each test case there is only one line contains a number N(2<=N<=100000). Process to the end of file.

输出

For each test case , output one line contains one number , indicating different prime factor in the number N.

样例输入

12
5
30

样例输出

2
1
3

提示

12 = 2 * 2 * 3

5 = 5

30 = 2 * 3 * 5

#include<iostream>
using namespace std;
int a[100001];
void go(){
	memset(a, 0, sizeof(a));
	int i,j;
	for (i = 2; i < 100001;i++)
	if (a[i] == 0){
		for (j = i; j < 100001; j+=i)a[j]++;
	}
}
int main(){
	//freopen("in.txt", "r", stdin);
	int x;
	go();
	while (cin >> x)cout << a[x] << endl;
	return 0;
}