nowcoder多校4C(数位DP)

好久没写数位DP了。。手好生啊。。

这题的难点在于找规律。。打表看起来并不容易看出来（给打表看出规律的神仙跪了orz

要算a[i]的值，要将i转化成二进制，对连续的二进制位，如果相同则+1，不同则-1，然后就能算出a[i]的值了。。

这个的证明大概是这样。。

可以这样分类讨论，n%4==3或n%4==0时（即最后2位相同时）为1， n%4==2或n%2==1（即最后2位不同时）为-1

然后n/2这个相当于扫描区间向前移一位，所以就是看每2个连续二进制位的相同于否来相加了。。。

接着根据范围显然可以数位DP了。。

 

 

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<queue>
#include<cmath>
#include<map>
#include<stack>
#include<set>
#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 mem(a) memset(a,0,sizeof(a))
#define ll long long
#define eps 1e-8
#define succ(x) (1LL<<x)
#define lowbit(x) (x&(-x))
#define sqr(x) ((x)*(x))
#define mid (x+y>>1)
#define NM 500005
#define nm 1000000
#define N 1000005
#define M(x,y) x=max(x,y)
const double pi=acos(-1);
const ll inf=1e9+7;
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 n,b[NM];
ll d[70][200][2],t;

ll dfs(int k,int x,int t,bool f,bool _f){
    if(!k)return abs(x-100);
    if(!f&&_f&&d[k][x][t])return d[k][x][t];
    int m=f?b[k]:1;ll ans=0;
    inc(i,0,m)if(_f)ans+=dfs(k-1,x+(t^i?-1:1),i,f&&i==m,_f||i);else ans+=dfs(k-1,x,i,f&&i==m,_f||i);
    ans%=inf;
    if(!f&&_f)d[k][x][t]=ans;
    return ans;
}

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

int main(){int _=read();while(_--)printf("%lld\n",solve(read()));return 0;}

 

 

链接：https://www.nowcoder.com/acm/contest/142/C
来源：牛客网
 

Chiaki Sequence Reloaded

时间限制：C/C++ 1秒，其他语言2秒
空间限制：C/C++ 131072K，其他语言262144K
64bit IO Format: %lld

题目描述

Chiaki is interested in an infinite sequence a1, a2, a3, ..., which defined as follows:

Chiaki would like to know the sum of the first n terms of the sequence, i.e. . As this number may be very large, Chiaki is only interested in its remainder modulo (109 + 7).

输入描述:

There are multiple test cases. The first line of input contains an integer T (1 ≤ T ≤ 105), indicating the number of test cases. For each test case:
The first line contains an integer n (1 ≤ n ≤ 1018).

输出描述:

For each test case, output an integer denoting the answer.

示例1

输入

复制

10
1
2
3
4
5
6
7
8
9
10

输出

复制

0
1
2
2
4
4
6
7
8
11