当前你的浏览器版本过低,网站已在兼容模式下运行,兼容模式仅提供最小功能支持,网站样式可能显示不正常。
请尽快升级浏览器以体验网站在线编辑、在线运行等功能。

建议使用的浏览器:

谷歌Chrome 火狐Firefox Opera浏览器 微软Edge浏览器 QQ浏览器 360浏览器 傲游浏览器

3543:Roba number

题目描述
As we know, in Roba's seraglio,there are many girls,according to this image.
So,you will be curious.So many girls,Roba may don't have enough time.
You start to doubt the authentic of this problem,assume Roba can meet 100 girls per day,and Roba can live 100years or so,then his dream will come true,but you don't know how many girs Roba will meet,so you have to guess.
So,the bigger positive factor the number has,the more likely the number become the girls in Roba's seraglio!.
But this is not the case,define Roba number,the least probably a number become the girls in Roba's seraglio,ie,the numbers have the least positive factors between 30000000 and 40000000,You are to output all the numbers
输出解释
all the Roba numbers between 3*10^7 and 4*10^7
输出样例
30000001
30000023
30000037
......
So many
来自杭电HDUOJ的附加信息
Author daizhenyang
Recommend zhengfeng

该题目是Virtual Judge题目,来自 杭电HDUOJ

源链接: HDU-3543

最后修改于 2020-10-25T23:04:35+00:00 由爬虫自动更新

共提交 0

通过率 --%
时间上限 内存上限
6000/3000MS(Java/Others) 131072/65536K(Java/Others)