2015 Multi-University Training Contest 3 1002RGCDQ(hdu5317)
来源:互联网 发布:营销之道软件 编辑:程序博客网 时间:2024/05/16 08:49
#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; }
0 0
- 2015 Multi-University Training Contest 3 1002RGCDQ(hdu5317)
- 2015 Multi-University Training Contest 3 RGCDQ
- 2015 Multi-University Training Contest 3 1002 RGCDQ
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- hdu 5317 RGCDQ 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 2015 Multi-University Training Contest 3
- 【线段树】2015 Multi-University Training Contest 1 1002
- 2015 Multi-University Training Contest 2 1002 Buildings
- 2015 Multi-University Training Contest 2 1002 Buildings (HDU5301)
- 2015 Multi-University Training Contest 5 - 1002 MZL's xor
- 2015 Multi-University Training Contest 2 1002 Buildings
- 2016 Multi-University Training Contest 3 1002 Permutation Bo
- 2014 Multi-University Training Contest 8 1002
- 再Visual Studio中构建Nunit测试环境
- Linux驱动学习-----Ubuntu12.04构建Linux源码树
- shiro 注解授权不起作用问题解决方案
- uva 10237 Bishops 黑白染色处理
- 由爱故生忧,由爱故生怖,若离于爱者,无忧亦无怖。
- 2015 Multi-University Training Contest 3 1002RGCDQ(hdu5317)
- 判断是手机还是电脑访问网站
- write to text file DEMO
- VC++学习(VS2010)--设置智能提示
- 我谈谈:医院网站内部链接的重要性
- java.io,PrintWriter可以用来创建一个文件并向本文文件写入数据
- listview无数据的处理
- uva 193 Graph Coloring( 图染色 ) DFS+回溯
- 并查集find函数3种写法