2015北京网络赛 H题 Fractal 找规律

Fractal

Time Limit: 1 Sec

Memory Limit: 256 MB

题目连接

http://hihocoder.com/contest/acmicpc2015beijingonline/problem/8

Description

This is the logo of PKUACM 2016. More specifically, the logo is generated as follows:

1. Put four points A0(0,0), B0(0,1), C0(1,1), D0(1,0) on a cartesian coordinate system.

2. Link A0B0, B0C0, C0D0, D0A0 separately, forming square A0B0C0D0.

3. Assume we have already generated square AiBiCiDi, then square Ai+1Bi+1Ci+1Di+1 is generated by linking the midpoints of AiBi, BiCi, CiDi and DiAi successively.

4. Repeat step three 1000 times.

Now the designer decides to add a vertical line x=k to this logo( 0<= k < 0.5, and for k, there will be at most 8 digits after the decimal point). He wants to know the number of common points between the new line and the original logo.

Input

In the first line there’s an integer T( T < 10,000), indicating the number of test cases.

Then T lines follow, each describing a test case. Each line contains an float number k, meaning that you should calculate the number of common points between line x = k and the logo.

Output

For each test case, print a line containing one integer indicating the answer. If there are infinity common points, print -1.

Sample Input

3
0.375
0.001
0.478

Sample Output

-1
4
20

HINT

题意

给你一个正方形，然后下一个正方形是这个正方形的边上的终点连起来的，然后接着这样构造下去

然后划一条线，问你经过了多少个点

题解：

找规律题，怕爆精度，所以用的java

代码：

import java.io.*;
import java.math.*;
import java.util.*;

public class Main
{
    static BigDecimal a[] = new BigDecimal[];
    public static void main(String argv[]) throws Exception
    {
        Scanner cin = new Scanner(System.in);
        a[] = BigDecimal.valueOf();
        BigDecimal x = BigDecimal.valueOf(0.5);
        BigDecimal kk = BigDecimal.valueOf(0.5);
        BigDecimal y;
        for(int i =  ; i <=  ; ++ i)
        {
            x = x.multiply(kk);
            a[i] = a[i-].add(x);
        }
        int Case = cin.nextInt();
        while(Case != )
        {
            y = cin.nextBigDecimal();
            int L =  , R = ;
            while(L <= R)
            {
                int mid = L + (R-L) / ;
                int result = a[mid].compareTo(y);
                if(result == ) R = mid - ;
                else if(result == -) L = mid + ;
                else
                {
                    L = mid;
                    break;
                }
            }
            if(a[L].compareTo(y) == ) System.out.println(-);
            else System.out.println(L*);
            Case--;
        }
    }
}