poj3252(数位DP)

继续数位DP吧。。这几天tm全在颓。。

这个和上次cf题应该是一样的。。由于只有01，这个数位DP就比较好写，而且方案也可以用过组合数求出来，也是降低了一些难度，所以上次直接转移就比较成功了。。组合数这个思路还是比较好的。。

http://blog.csdn.net/qkoqhh/article/details/79127495

这次就补上个正统的解法。。

#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 1e9
#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 100498
#define pi 3.141592653
using namespace std;
ll read(){
    ll 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 d[NM][4*NM],_x,_y,n,b[NM];

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

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

int main(){
	_x=read();_y=read();
	return 0*printf("%d\n",solve(_y)-solve(_x-1));
}

Round Numbers

Time Limit: 2000MS		Memory Limit: 65536K
Total Submissions: 14958		Accepted: 6033

Description

The cows, as you know, have no fingers or thumbs and thus are unable to play Scissors, Paper, Stone' (also known as 'Rock, Paper, Scissors', 'Ro, Sham, Bo', and a host of other names) in order to make arbitrary decisions such as who gets to be milked first. They can't even flip a coin because it's so hard to toss using hooves.

They have thus resorted to "round number" matching. The first cow picks an integer less than two billion. The second cow does the same. If the numbers are both "round numbers", the first cow wins,
otherwise the second cow wins.

A positive integer N is said to be a "round number" if the binary representation of N has as many or more zeroes than it has ones. For example, the integer 9, when written in binary form, is 1001. 1001 has two zeroes and two ones; thus, 9 is a round number. The integer 26 is 11010 in binary; since it has two zeroes and three ones, it is not a round number.

Obviously, it takes cows a while to convert numbers to binary, so the winner takes a while to determine. Bessie wants to cheat and thinks she can do that if she knows how many "round numbers" are in a given range.

Help her by writing a program that tells how many round numbers appear in the inclusive range given by the input (1 ≤ Start < Finish ≤ 2,000,000,000).

Input

Line 1: Two space-separated integers, respectively Start and Finish.

Output

Line 1: A single integer that is the count of round numbers in the inclusive range Start.. Finish

Sample Input

2 12

Sample Output

6

Source

USACO 2006 November Silver

[Submit]   [Go Back]   [Status]   [Discuss]