2015 网络赛
2015-09-20 19:53
337 查看
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
#include <cstdio> #include <algorithm> #include <cstring> #include <iostream> using namespace std; #define N 1000 + 10 #define M 50 double a ; 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; } /* 10 0.375 0.001 0.478 */
相关文章推荐
- hihoCoder 1234 Fractal——ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛
- 转 TCP中的序号和确认号
- 计算机网络之面试常考
- 计算机网络之局域网&以太网
- httpd2.4特性
- Android中的Http通信
- 当打开sql server2008打开,出现报错“评估期已过。有关如何升级的测试版软件的信息请访问,http://www.....”
- 2015北京赛区网络赛模拟题
- flex http请求error#1090XML 分析器失败: 元素格式不正确。
- 2015年ACM北京网络赛 B题 (模拟+枚举题意请原谅我英语不好。。。)
- 程序一启动检查网络,如果没有网络就退出程序
- ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛A题2015-9-20
- python keras (一个超好用的神经网络框架)的使用以及实例
- 2015 ACM-ICPC 沈阳网络赛总结
- servlet学习---第二天(GenericServlet、HttpServlet开发servler程序)
- 5种服务器网络编程模型讲解
- MITM to crack Https connections
- 网络通讯方式 ------ TCP、UDP
- TCP、UDP练习题 (UDP聊天程序、TCP上传文本文件和图片文件)
- ACM-ICPC国际大学生程序设计竞赛北京赛区(2015)网络赛H题2015-9-20