Code Forces 26A Almost Prime
来源:互联网 发布:matlab多目标遗传算法 编辑:程序博客网 时间:2024/06/06 08:32
D - Almost Prime
Time Limit:2000MS Memory Limit:262144KB 64bit IO Format:%I64d & %I64uDescription
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);}
0 0
- Code Forces 26A Almost Prime
- CF 26A-Almost prime
- 【详解打表】#26 A. Almost Prime
- codeforces-26A-Almost Prime【分解质因数】
- CodeForces 26 A.Almost Prime(数论)
- A. Almost Prime
- A. Almost Prime
- code forces 1A
- code forces 377A
- code forces 505A
- Code Forces 587A
- Code Forces 588A
- [code forces] 762A
- Codeforces Beta Round #26 (Codeforces format) A Almost Prime
- code forces 393A Nineteen
- code forces 399A Pages
- code forces 402A Nuts
- code forces 2A Winner
- Win7 x64 系统环境下配置VS2013&PCL1.7.2
- C++(19)类与数据抽象
- Android Studio:Multiple dex files define Landroid/support/annotation/AnimRes
- CodeForces 445A
- 可重定位目标文件
- Code Forces 26A Almost Prime
- 回收站清空的东西找回来
- C++对象模型——Member的各种调用方式(第四章)
- 集合幂集
- android中键盘不遮挡ui界面的方法
- C++(20)构造函数
- solr5.2.1环境搭建
- LintCode-硬币排成线
- sql左连接 右连接 笛卡尔积 全连接 内连接一看就懂的解释