Code Forces 26A Almost Prime
2015-08-08 19:42
281 查看
D - Almost Prime
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeCodeForces
26A
Description
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 andn,
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 Input
Input
Output
Input
Output
水题。开个数组记录个数。
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64u
SubmitStatusPracticeCodeForces
26A
Description
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 andn,
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 Input
Input
10
Output
2
Input
21
Output
8
水题。开个数组记录个数。
#include <stdio.h> #include <string.h> int flag[3005]; int main() { memset(flag,0,sizeof(flag)); int n; scanf("%d",&n); int sum=0; for(int i=2;i<=n;i++) { for(int j=2;j<i;j++) if(i%j==0&&flag[j]==0) flag[i]++; if(flag[i]==2) sum++; } printf("%d\n",sum); }
相关文章推荐
- CodeForces 445A
- 可重定位目标文件
- C++(19)类与数据抽象
- Android Studio:Multiple dex files define Landroid/support/annotation/AnimRes
- 可重定位目标文件
- [leedcode 236] Lowest Common Ancestor of a Binary Tree
- jftp 解决中文乱码。支持中文
- zend studio快捷键
- Codeforces Gym100286G Giant Screen (暴力)
- Win7 x64 系统环境下配置VS2013&PCL1.7.2
- iOS 读书笔记-国际化
- 解决wampserver + laravel无法访问自定义路由
- ThinkPHP下SMTP的发送邮件
- Codeforces Gym H. Hell on the Markets 贪心
- PHP函数库(other)
- 1075. PAT Judge (25)
- Unity 真机调试
- 1075. PAT Judge (25)
- [leetcode] Search for a Range
- 机房收费总结