F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

Roba number

Time Limit: 6000/3000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 560    Accepted Submission(s): 292


Problem Description
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
 

Output
all the Roba numbers between 3*10^7 and 4*10^7
 

Sample Output
30000001 30000023 30000037 ...... So many
 

Author
daizhenyang
 

Source
 

Statistic | Submit | Discuss | Note
Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-05-12 13:07:24, Gzip enabled