zoukankan      html  css  js  c++  java
  • hihoCoder 1234 fractal

    #1234 : Fractal

    时间限制:1000ms
    单点时限:1000ms
    内存限制:256MB

    描述

    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.

    输入

    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.

    输出

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

    样例输入
    3
    0.375
    0.001
    0.478
    样例输出
    -1
    4
    20

    重复1000次是个幌子,根本没有那么极端的数据,实际上重复到50多次就全是0.500000……了(用double)

    所以不用纠结循环500还是循环1000,更不用纠结是501还是499.只要循环50就够了。

    #include<math.h>
    #include<stdio.h>
    #include<string.h>
    #include<string>
    #include<iostream>
    #include<algorithm>
    using namespace std;
    #define N 1234
    
    int n,flag,b[N];
    double x,a[N];
    const double eps = 1e-12;
    
    void init()
    {
        a[0] = 0.0;
        b[0] = 0;
        double f = 1.0 / 4;
        for(int i = 1; i <= 50; i++)
        {
            a[i] += a[i-1] + f;
            b[i] = b[i-1] + 4;
            f = f / 2;
        }
    //    for(int i = 1; i <= 55; i++)
    //    {
    //        printf("%.60f
     ", a[i]);
    //    }
    }
    
    int main()
    {
        init();
        int T;cin>>T;
        while(T--)
        {
            scanf("%lf", &x);
            if(x > 0.5) x = 1 - x;
            for(int i = 0; i <= 50; i++)
            {
                if(fabs(x - a[i]) < eps)
                {
                    printf("-1
    ");
                    break;
                }
                else if(x < a[i] && x > a[i-1])
                {
                    printf("%d
    ", b[i]);
                    break;
                }
            }
        }
    
        return 0;
    }
    
    /*
    3
    0.375
    0.001
    0.478
    
    */
  • 相关阅读:
    向日葵、阳光
    laravel还是给我太多惊喜了
    滴滴笔试题——小试牛刀
    剑指offer——二叉搜索树的后序遍历序列
    2019春招美团笔试
    首次实习生招聘会——航天一院
    有趣的数字
    剑指offer——从上往下打印二叉树
    剑指offer——栈的压入、弹出序列
    剑指offer——包含min函数的栈
  • 原文地址:https://www.cnblogs.com/wmxl/p/4823265.html
Copyright © 2011-2022 走看看