TOJ 3259.Mysterious Number(埃式筛法)
来源:互联网 发布:常见协议的端口号 编辑:程序博客网 时间:2024/06/05 14:09
题目链接:http://acm.tju.edu.cn/toj/showp3259.html
Time Limit: 1.0 Seconds Memory Limit: 65536K
Total Runs: 1356 Accepted Runs: 435
Mysterious Number refers to a number which can be divisible by the number of distinct factors that it has. For instance, 1 (1 factor), 12 (6 factors) and 9 (3 factors) are Mysterious Numbers, but 7(2 factors) or 16 (5 factors) are not.
Given two integers low and high, please calculate the number of Mysterious Numbers between low and high, inclusive.
Input
For each test case, there are two integers low and high in one line separated by spaces. 1 ≤ low ≤ high ≤ 1,000,000Output
Print out the number of Mysterious Numbers between low and high, inclusive.Sample Input
1 1010 15
Sample Output
41
Author: WTommy
Source: TJU Team Selection Contest 2009 (4)
Maintance:G.D.Retop. Developer: SuperHacker, G.D.Retop
题意很好理解,所谓神秘数就是指一个数是否能够被它的约数整除。然后我就傻乎乎的枚举暴力来了一波,果不其然——超时。随后学习了一下大神的帖子,知道了一种算法叫:埃式筛法,关于埃式筛法具体的内容见博客:
#include <stdio.h>#include <algorithm>using namespace std;const int MAX = 1000000+2; int fac[MAX] = {0,1}; int main(){int low,high,sum;fill(fac+2,fac+MAX,2);for (int i = 2; i < (MAX>>1); ++i) for (int j = 2; i * j < MAX; ++j) { ++fac[i*j]; }while(~scanf("%d%d",&low,&high)){sum=0;for(int i=low;i<=high;i++)if(i%fac[i]==0)sum++;printf("%d\n",sum);}}
0 0
- TOJ 3259.Mysterious Number(埃式筛法)
- 3259. Mysterious Number
- toj-3515-middle number(优先队列)
- TOJ Number Sequence
- TOJ 4148 number 0
- toj 4610 Biggest Number
- TOJ 3534.Shift Number
- toj3259[Mysterious Numbers]埃式筛法
- 【TOJ 2807】 Number Sort【水题】
- TOJ--3071:Number Game (BFS)
- TOJ 4115 Find the number
- toj 4613 Number of Battlefields
- Mysterious Bacteria ( lightOJ 1220)
- TOJ 1868.Count the factors(埃式筛法)
- [TOJ 3515][优先队列]Middle number
- LightOj 1220 Mysterious Bacteria(数论)
- CodeForces 4D Mysterious Present(DP)
- uva 10122 Mysterious Mountain and ZOJ 1231 Mysterious Mountain (二分+二部图最大匹配)
- Android使用ScrollView嵌套ListView实现复杂数据列表选择处理
- HDU1087:Super Jumping! Jumping! Jumping!
- FreeSwitch 信道状态(Channel Status)
- HDOJ -- 2066 一个人的旅行
- 关于js中变量作用于和变量提升的那些事
- TOJ 3259.Mysterious Number(埃式筛法)
- Android Studio 掌握这些调试技巧,Debug能力不能再高啦
- 安卓如何利用资源名称获得资源Id
- 借鉴系统UITableView的设计思想,自定义一个"花瓣"菜单
- php 将中文字符串截取为数组
- Two Bases
- Trie树编程实现
- ATOM -- A hackable text editor for the 21st Century
- PL/SQL不配tnsnames.ora直接连接Oracle数据库的方法