Description:
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
2
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
2
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
exponent
E
E
E such that the first digits of
2
E
2^E
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 N N not bigger than 2147483648 2147483648 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 2 E 2^E 2E are precisely the digits of N N N, or, if there is no one, the sentence ‘no power of 2 ’ 2’ 2’.
Sample Input
1
2
10
Sample Output
7
8
20
题意:
给出 x x x,求一个 e e e,使得 x ∗ 1 0 y ≤ 2 e < ( x + 1 ) ∗ 1 0 y x * 10 ^ y ≤ 2 ^ e < (x + 1) * 10 ^ y x∗10y≤2e<(x+1)∗10y。
我们需要求出最小的 e e e,是的存在一个 i > l e n ( n ) i > len(n) i>len(n) , 满足 f l o o r [ 2 e / ( 1 0 i ) ] = n floor[2^e/ (10^i)]= n floor[2e/(10i)]=n, 即 n ∗ 1 0 i < 2 e < ( n + 1 ) ∗ 1 0 i n*10^i < 2^e < (n+1)*10^i n∗10i<2e<(n+1)∗10i。对两边同时取 l o g 10 log10 log10 ,得到 l g ( n ) + i < e ∗ l g ( 2 ) < l g ( n + 1 ) + i lg(n) + i < e*lg(2) < lg(n+1) + i lg(n)+i<e∗lg(2)<lg(n+1)+i。 注意len(n) = (int) lg(n)+1$, 之前一个条件 i > l e n ( n ) i > len(n) i>len(n) 可以转化为 i > l g ( n ) + 1 i > lg(n)+1 i>lg(n)+1, 然后暴力枚举即可。 2 2 2 的 p o w pow pow 有无限个,无解的情况不存在。
AC代码:
#include <cstdio>
#include <vector>
#include <queue>
#include <cstring>
#include <cmath>
#include <map>
#include <set>
#include <string>
#include <iostream>
#include <algorithm>
#include <iomanip>
#include <stack>
#include <queue>
using namespace std;
#define sd(n) scanf("%d", &n)
#define sdd(n, m) scanf("%d%d", &n, &m)
#define sddd(n, m, k) scanf("%d%d%d", &n, &m, &k)
#define pd(n) printf("%d\n", n)
#define pc(n) printf("%c", n)
#define pdd(n, m) printf("%d %d\n", n, m)
#define pld(n) printf("%lld\n", n)
#define pldd(n, m) printf("%lld %lld\n", n, m)
#define sld(n) scanf("%lld", &n)
#define sldd(n, m) scanf("%lld%lld", &n, &m)
#define slddd(n, m, k) scanf("%lld%lld%lld", &n, &m, &k)
#define sf(n) scanf("%lf", &n)
#define sc(n) scanf("%c", &n)
#define sff(n, m) scanf("%lf%lf", &n, &m)
#define sfff(n, m, k) scanf("%lf%lf%lf", &n, &m, &k)
#define ss(str) scanf("%s", str)
#define rep(i, a, n) for (int i = a; i <= n; i++)
#define per(i, a, n) for (int i = n; i >= a; i--)
#define mem(a, n) memset(a, n, sizeof(a))
#define debug(x) cout << #x << ": " << x << endl
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define fi first
#define se second
#define mod(x) ((x) % MOD)
#define gcd(a, b) __gcd(a, b)
#define lowbit(x) (x & -x)
typedef pair<int, int> PII;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
const int MOD = 1e9 + 7;
const double eps = 1e-9;
const ll INF = 0x3f3f3f3f3f3f3f3fll;
const int inf = 0x3f3f3f3f;
inline int read()
{
int ret = 0, sgn = 1;
char ch = getchar();
while (ch < '0' || ch > '9')
{
if (ch == '-')
sgn = -1;
ch = getchar();
}
while (ch >= '0' && ch <= '9')
{
ret = ret * 10 + ch - '0';
ch = getchar();
}
return ret * sgn;
}
inline void Out(int a) //Êä³öÍâ¹Ò
{
if (a > 9)
Out(a / 10);
putchar(a % 10 + '0');
}
ll gcd(ll a, ll b)
{
return b == 0 ? a : gcd(b, a % b);
}
ll lcm(ll a, ll b)
{
return a * b / gcd(a, b);
}
///快速幂m^k%mod
ll qpow(ll a, ll b, ll mod)
{
if (a >= mod)
a = a % mod + mod;
ll ans = 1;
while (b)
{
if (b & 1)
{
ans = ans * a;
if (ans >= mod)
ans = ans % mod + mod;
}
a *= a;
if (a >= mod)
a = a % mod + mod;
b >>= 1;
}
return ans;
}
// 快速幂求逆元
int Fermat(int a, int p) //费马求a关于b的逆元
{
return qpow(a, p - 2, p);
}
///扩展欧几里得
int exgcd(int a, int b, int &x, int &y)
{
if (b == 0)
{
x = 1;
y = 0;
return a;
}
int g = exgcd(b, a % b, x, y);
int t = x;
x = y;
y = t - a / b * y;
return g;
}
///使用ecgcd求a的逆元x
int mod_reverse(int a, int p)
{
int d, x, y;
d = exgcd(a, p, x, y);
if (d == 1)
return (x % p + p) % p;
else
return -1;
}
///中国剩余定理模板0
ll china(int a[], int b[], int n) //a[]为除数,b[]为余数
{
int M = 1, y, x = 0;
for (int i = 0; i < n; ++i) //算出它们累乘的结果
M *= a[i];
for (int i = 0; i < n; ++i)
{
int w = M / a[i];
int tx = 0;
int t = exgcd(w, a[i], tx, y); //计算逆元
x = (x + w * (b[i] / t) * x) % M;
}
return (x + M) % M;
}
int n, ans;
int main()
{
while (~sd(n))
{
bool flag = 0;
int i = log10(n) + 2;
for (;; ++i)
{
int a = (log10(n) + i) / log10(2), b = ceil((log10(n + 1) + i) / log10(2));
if (a + 1 < b)
{
ans = a + 1;
flag = 1;
break;
}
}
if (!flag)
ans = -1;
pd(ans);
}
}