【codeforces26A】Almost Prime
来源:互联网 发布:幽默app软件下载 编辑:程序博客网 时间:2024/06/10 04:06
A. Almost Prime
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output
A number is called almost prime if it has exactly two distinct prime divisors. For example, numbers 6, 18, 24 are almost prime, while 4, 8, 9, 42 are not. Find the amount of almost prime numbers which are between 1 and n, inclusive.
Input
Input contains one integer number n (1 ≤ n ≤ 3000).
Output
Output the amount of almost prime numbers between 1 and n, inclusive.
Sample test(s)
Input
10
Output
2
Input
21
Output
8
题意:输出小于等于n的有且只有两个质因数的个数。
解题思路:本来看数据3000,就想着纯打表,后来看看,也还有蛮多,就老老实写吧,先用prime数组存1-1500之间的素数,然后判断小于等于n之间的满足题意的个数。
code:
#include <iostream>#include <cstdio>#include <algorithm>#include <cstring>#include <string>#include <map>#include <cmath>using namespace std;int prime[250];int is_prime(int n){ for(int i=2;i<=n/2;i++) if(n%i==0) return 0; return 1;}bool is_alpme(int i){bool flag=false;int pos=0,nbr=i;while(1){if(prime[pos]>nbr) return false;if(flag==false && nbr%prime[pos]==0){flag=true;while(nbr%prime[pos]==0) nbr=nbr/prime[pos];}else if(flag==true && nbr%prime[pos]==0){nbr=nbr/prime[pos];while(nbr%prime[pos]==0) nbr=nbr/prime[pos];if(nbr==1) return true;else return false;}if(prime[pos]==1499) return false;pos++;}}int main(){ int cnt=0; int res=0; int n; for(int i=2;i<1500;i++) if(is_prime(i)){ prime[res++]=i; } scanf("%d",&n); for(int i=1;i<=n;i++){if(is_alpme(i)) cnt++;} printf("%d\n",cnt); return 0;}
0 0
- 【codeforces26A】Almost Prime
- A. Almost Prime
- UVa10539 Almost Prime Numbers
- UVa10539 - Almost Prime Numbers
- UVA10539 - Almost Prime Numbers
- 10539 - Almost Prime Numbers
- A. Almost Prime
- uva10539 Almost Prime Numbers
- Almost Prime Numbers UVA
- UVA 10539 Almost Prime
- Almost Prime Numbers UVA
- UVa 10539 - Almost Prime Numbers
- UVa 10539 - Almost Prime Numbers
- UVa 10539 - Almost Prime Numbers
- UVa 10539 - Almost Prime Numbers
- CF 26A-Almost prime
- UVA 10539 Almost Prime Numbers
- Uva 10539 Almost Prime Numbers
- HttpServlect详情
- 源码浅析activity window和view的关系
- Java入门-泛型
- ubuntu下修改文件夹权限
- shell syntax
- 【codeforces26A】Almost Prime
- usaco Agri-Net
- C++ 虚函数是否需要定义?
- Java基础针对自己薄弱环节总结09(线程中)
- CCF 201403-4无线网络 (二维最短路)
- [华为MU203] 使用AT命令实现网络访问
- Can't open framebuffer device /dev/fb0 ------[TQ2440-QT-first]
- 计算机系统结构的总体概述
- 9-4第二次简单实验