http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=4091
C++版本一
题解:高精度
1、对原数循环除以2;
2、添加每次的结果到ans数组;
3、数据范围二进制大概2的3400次;
4、代码不是最优(比如如果原数已经0,可以直接退出);
/*
*@Author: STZG
*@Language: C++
*/
#include <bits/stdc++.h>
#include<iostream>
#include<algorithm>
#include<cstdlib>
#include<cstring>
#include<cstdio>
#include<string>
#include<vector>
#include<bitset>
#include<queue>
#include<deque>
#include<stack>
#include<cmath>
#include<list>
#include<map>
#include<set>
//#define DEBUG
#define RI register int
#define endl "\n"
using namespace std;
typedef long long ll;
//typedef __int128 lll;
const int N=100000+10;
const int M=100000+10;
const int MOD=1e9+7;
const double PI = acos(-1.0);
const double EXP = 1E-8;
const int INF = 0x3f3f3f3f;
int t,n,m,k,p,l,r,u,v;
int ans,cnt,flag,temp,sum;
int a[N],c[N];
char str[N];
struct node{};
int main()
{
#ifdef DEBUG
freopen("input.in", "r", stdin);
//freopen("output.out", "w", stdout);
#endif
//ios::sync_with_stdio(false);
//cin.tie(0);
//cout.tie(0);
scanf("%d",&t);
while(t--){
//scanf("%d",&n);
cin>>str;
int len=strlen(str);
memset(c,0,sizeof(c));
memset(a,0,sizeof(a));
for(int i=1;i<=len;i++){
a[i]=str[len-i]-'0';
}
c[0]=1;
for(int i=0;i<3400+10;i++){
int now=0;
for(int j=len;j>=1;j--){
a[j]+=now*10;
now=0;
if(a[j]%2==1){
now=1;
}
a[j]/=2;
}
int limit=max(len,c[0])+100;
for(int j=1;j<=limit;j++){
c[j]+=a[j];
if(c[j]>=10){
c[j+1]+=c[j]/10;
c[j]%=10;
}
if(c[j]){
c[0]=max(c[0],j);
}
}
}
for(int i=c[0];i>=1;i--){
cout<<c[i];
}
cout<<endl;
}
#ifdef DEBUG
printf("Time cost : %lf s\n",(double)clock()/CLOCKS_PER_SEC);
#endif
//cout << "Hello world!" << endl;
return 0;
}
Python版本一
t = int(input())
while t > 0:
n = int(input())
ans = int(0)
t -= 1
while n > 0:
n //= 2
ans += n
print(ans)