LightOJ1032(数位DP)

最新推荐文章于 2021-05-25 11:51:06 发布

qkoqhh

最新推荐文章于 2021-05-25 11:51:06 发布

阅读量231

点赞数

分类专栏： DP

本文链接：https://blog.csdn.net/qkoqhh/article/details/79198718

版权

DP 专栏收录该内容

116 篇文章 1 订阅

订阅专栏

这个还是非常好统计的。。统计好首位为1的数的个数就没啥了。。

不过这个oj的数据还真是良心。。基本过了样例就可以A了。。。

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#define inc(i,l,r) for(int i=l;i<=r;i++)
#define dec(i,l,r) for(int i=l;i>=r;i--)
#define link(x) for(edge *j=h[x];j;j=j->next)
#define eps 1e-8
#define inf 1000000007
#define mem(a) memset(a,0,sizeof(a))
#define ll long long
#define succ(x) (1<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define ls T[i<<1]
#define rs T[i<<1|1]
#define op T[i]
#define mid (x+y>>1)
#define NM 35
#define nm 10005
#define pi 3.141592653
using namespace std;
int read(){
    int x=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch))x=x*10+ch-'0',ch=getchar();
    return f*x;
}


int n,b[NM],c[NM][2];
ll d[NM];

ll dfs(int i,bool f){
	if(!i)return 0;
	if(!f&&d[i])return d[i];
	int m=f?b[i]:1;ll ans=0;
	ans=dfs(i-1,f&&m==0);
	c[i][0]=c[i-1][0]+c[i-1][1];
	if(m)ans+=dfs(i-1,f),ans+=c[i-1][1],c[i][1]=c[i-1][0]+c[i-1][1];else c[i][1]=0;
	return d[i]=ans;
}

ll solve(int x){
	n=0;mem(d);mem(b);
	for(int t=x;t;t>>=1)b[++n]=t%2;
	return dfs(n,1);
}

int main(){
	//freopen("data.in","r",stdin);
	c[0][0]=1;
	int _=read();
	inc(T,1,_)printf("Case %d: %lld\n",T,solve(read()));
	return 0;
}

1032 - Fast Bit Calculations

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

A bit is a binary digit, taking a logical value of either 1or 0 (also referred to as "true" or "false"respectively). And every decimal number has a binary representation which isactually a series of bits. If a bit of a number is 1 and its next bit isalso 1 then we can say that the number has a 1 adjacent bit. Andyou have to find out how many times this scenario occurs for all numbers up to N.

Examples:

Number Binary Adjacent Bits

12 1100 1

15 1111 3

27 11011 2