2015 网络赛
来源:互联网 发布:seo推广培训 编辑:程序博客网 时间:2024/05/25 19:58
Fractal
- 样例输入
30.3750.0010.478
- 样例输出
-1420
描述
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.
#include <cstdio>#include <algorithm>#include <cstring>#include <iostream>using namespace std;#define N 1000 + 10#define M 50double a[N];double mul_pow(double x, int k){ double res = 1.0; while(k) { if(k & 1) res *= x; x = x * x; k >>= 1; } return res;}int init(){ for(int i = 1; i <= M; i++) { a[i] = 0.5 - 0.5 * mul_pow(0.5, i - 1); } cout << a[M - 1] << endl; cout << a[M] << endl;}int main(){ init(); int T; scanf("%d", &T); double x; while(T--) { scanf("%lf", &x); if(x == 0.5) printf("2004\n"); else { int ans = lower_bound(a + 1, a + M, x) - a; if(a[ans] == x) printf("-1\n"); else { printf("%d\n", (ans - 1) * 4); } } } return 0;}/*100.3750.0010.478*/
- 2015长春网络赛
- 2015 网络赛
- 2015 上海网络赛
- 2015长春网络赛小结
- 2015沈阳网络赛总结
- 2015北京网络赛 Boxes
- 网络赛
- 2015区域赛长春网络赛 Travel
- 2015长春网络赛(hdu 5442)
- hdu 5442 2015长春网络赛
- hdu5437(2015长春网络赛A题)
- hdu5438(2015长春网络赛B题)
- hdu5443(2015长春网络赛G题)
- hdu5444(2015长春网络赛H题)
- hdu5441(2015长春网络赛E题)
- hdu5446(2015长春网络赛J题)
- Hdu5441 2015长春赛区网络赛
- hdu5442(2015长春网络赛F题)
- 图的定义
- 零基础学python-18.6 lambda表达式快速入门
- Hibernate整合Strtus
- 僵尸进程和孤儿进程
- MySQL学习笔记20150920MySQL的基本概念与管理
- 2015 网络赛
- 树状数组及其应用
- xcode6中添加pch全局引用文件
- MyBatis初次环境配置
- hdu 5463 Clarke and minecraft(BestCoder Round #56 (div.2))
- Ubuntu 中 设置 FireFox 豆沙绿
- 冒泡排序
- java SE复习笔记25
- java 在jtextarea(文本框)里显示拖动进来文件的路径