UVa 701 The Archeologists' Dilemma (数学&枚举)
来源:互联网 发布:淘宝网天猫纯棉四件套 编辑:程序博客网 时间:2024/06/05 17:30
701 - The Archeologists' Dilemma
Time limit: 3.000 seconds
http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=115&page=show_problem&problem=642
An archeologist seeking proof of the presence of extraterrestrials in the Earth's past, stumbles upon a partially destroyed wall containing strange chains of numbers. The left-hand part of these lines of digits is always intact, but unfortunately the right-hand one is often lost by erosion of the stone. However, she notices that all the numbers with all its digits intact are powers of 2, so that the hypothesis that all of them are powers of 2 is obvious. To reinforce her belief, she selects a list of numbers on which it is apparent that the number of legible digits is strictly smaller than the number of lost ones, and asks you to find the smallest power of 2 (if any) whose first digits coincide with those of the list.
Thus you must write a program such that given an integer, it determines (if it exists) the smallest exponentE such that the first digits of 2E coincide with the integer (remember that more than half of the digits are missing).
Input
It is a set of lines with a positive integer N not bigger than 2147483648 in each of them.
Output
For every one of these integers a line containing the smallest positive integer E such that the first digits of 2E are precisely the digits of N, or, if there is no one, the sentence ``no power of 2".
Sample Input
1210
Sample Output
7820
思路:
黑书上说这题可以用连分数逼近?没想出来...(坑)
完整代码:
/*0.023s*/#include<cstdio>#include<cmath>const double log2_10 = log2(10.0);int main(void){int n, m, i, tot, lower, upper;double t1, t2;while (~scanf("%d", &n)){t1 = log2(n), t2 = log2(n + 1);tot = 0;for (m = n; m; m /= 10)tot++;for (i = tot + 1;; ++i){lower = (int)(t1 + i * log2_10);upper = (int)(t2 + i * log2_10);if (lower != upper){printf("%d\n", upper);break;}}}return 0;}
- UVa 701 The Archeologists' Dilemma (数学&枚举)
- UVa 701 The Archeologists' Dilemma
- UVA 701 - The Archeologists\' Dilemma
- uva 701 - The Archeologists' Dilemma
- UVA 701 The Archeologists' Dilemma
- H题:UVA 701 The Archeologists' Dilemma
- UVA 701 - The Archeologists' Dilemma(数论)
- uva 701——The Archeologists\' Dilemma
- 110503 The Archeologists' Dilemma
- programming-challenges The Archeologists' Dilemma (110503) 题解
- UVa Problem Solution: 701 - The Archaeologist's Dilemma
- UVa Problem 701 The Archeologist’s Dilemma (考古学家的烦恼)
- Inspector's Dilemma UVA
- Inspector's Dilemma UVA
- The Archeologist's Dilemma
- HDU4152 ZZY’s Dilemma【枚举】
- UVA 10325 The Lottery (组合数学,容斥原理,二进制枚举)
- UVA.10325 The Lottery (组合数学 容斥原理 二进制枚举)
- Block介绍(二)内存管理与其他特性
- Java Web 视频教程(收藏)
- ACM网站
- block介绍(三)揭开神秘面纱(上)
- paip.提升用户体验---c++ gcc 命令语法着色搭配方案
- UVa 701 The Archeologists' Dilemma (数学&枚举)
- block介绍(四)揭开神秘面纱(下)
- CoreAnimation编程指南-目录
- Groovy闭包理解
- hdu 1695 GCD
- Windows下配置Apache+PHP+MySQL
- IOS详解TableView——选项抽屉(天猫商品列表)
- Linux程序设计第一章
- CoreAnimation编程指南(简介)