2015 Multi-University Training Contest 3 1002 RGCDQ(hdu5317)
2015-07-29 09:36
513 查看
#include<stdio.h> #include<iostream> #include<string.h> #include<stdlib.h> #include<vector> #include<algorithm> #include<math.h> #include<string> #include<set> #include<queue> #include<map> using namespace std; #define INF 0x7fffffff //vector<int> f; int f[100000]; int countt; bool num[1000010]; int sf[1000010];//i这个数有几种素数因子 int jz[1000010][10];//i这个数有j种素数因子的个数 void init(){ countt=0; memset(num,false,sizeof(num)); memset(sf,0,sizeof(sf)); memset(jz,0,sizeof(jz)); for(int i=2;i<=1000000;++i){ if(num[i]==false){ sf[i]=1; for(int j=2;i*j<=1000000;++j){ num[j*i]=true; sf[j*i]++; } } } jz[1][1]=1; for(int i=2;i<=1000000;++i){ for(int j=1;j<=9;++j) jz[i][j]=jz[i-1][j]; jz[i][sf[i]]++; } } int main(){ //freopen("G://test.txt","r",stdin); int t,n,m; init(); scanf("%d",&t); while(t--){ int l,r; scanf("%d%d",&l,&r); int haha[10]; for(int i=1;i<=9;++i){ haha[i]=jz[r][i]-jz[l][i]; } haha[sf[l]]++; int maxn=1; for(int i=9;i>=1;--i){ if(haha[i]>=2){ if(i>maxn) maxn=i; } } if(maxn<2) if(haha[4]>=1&&haha[2]>=1) maxn=2; printf("%d\n",maxn); } return 0; }
相关文章推荐
- ZOJ 3450 Doraemon's Railgun (DP·分组背包)
- C++使用localtime函数需要注意的地方http://blog.csdn.net/shellching/article/details/8114266
- zoj 3450Doraemon's Railgun
- HDU 5326 Work 并查集 (2015 Multi-University Training Contest 3 2015多校联合)
- HDU 5319 Painter (2015 Multi-University Training Contest 3 2015多校联合)
- STL中的模板类pair 和map http://blog.csdn.net/calvin_zcx/article/details/6072286
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- 线程安全C/C++ http://blog.csdn.net/huangxy10/article/details/8068653
- mysql_num_rows()的作用的功能!!! http://zhidao.baidu.com/link?url=E-LmBdz-E5ff5PKfiXucFY-wWBLV4_vt6Cmg2i4k
- 模拟+思维 HDOJ 5319 Painter
- 多校3 1004 Painter
- Train Problem I
- HDU 5319 Painter(模拟)
- EAIPChina航图查看器项目手记
- Design Pattern Explained 读书笔记三——Adapter
- RAID简介
- 20150728多校第三场1004 - Painter
- 2015 Multi-University Training Contest 3 1011
- Leetcode: Contains Duplicate III
- HDU 5316 Magician(2015 Multi-University Training Contest 3 1001)