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

Squared Frequency

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 512000/512000 K (Java/Others)
Total Submission(s): 692    Accepted Submission(s): 78


Problem Description
You are now working in a physical laboratory. One day, when you were skimming through your records of experiments, you find that the squared frequency, defined as (P/Q)2, in which Q indicates times of experiments and P means number of experiments in which the expected phenomenon appears, is somehow unreasonable. The squared frequency F (0 < F < 1) is written in decimal form, and rounded to K (K ≤ 9) numbers after the decimal point. You think that Q, i.e. times of experiments, is too small to obtain such a number. Now you need to work out a fraction P/Q, so that rounding (P/Q)2 to K numbers after the decimal point gets exactly F, and minimizes Q.
 

Input
Input contains no more than 2000 test cases.

Each test case has a single line, which contains a decimal fraction indicating F, the squared frequency.
 

Output
For each test case, output your answer in a line with the case number, follow the format in sample. You should print a blank after ':'.

If the answer is not unique, output the one with the minimum P.
 

Sample Input
0.3 0.5 0.50
 

Sample Output
Case #1: 1/2 Case #2: 5/7 Case #3: 12/17
 

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-11-22 16:17:51, Gzip enabled