BZOJ 1411 ZJOI2009 硬币游戏

 递推;

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
#define ll long long
#define FILE "dealing"
#define up(i,j,n) for(int i=j;i<=n;i++)
#define db long double 
#define pii pair<int,int>
#define pb push_back
#define mem(a,L) memset(a,0,sizeof(int)*(L+1))
template<class T> inline bool cmin(T& a,T b){return a>b?a=b,true:false;}
template<class T> inline bool cmax(T& a,T b){return a<b?a=b,true:false;}
template<class T> inline T squ(T a){return a*a;}
const int maxn=210000+10,inf=1e9+10,mod=10003;
ll read(){
    ll x=0,f=1,ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')f=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')x=(x<<1)+(x<<3)+ch-'0',ch=getchar();
    return x*f;
}
ll n;
ll T,f;
ll a[maxn],b[maxn];
int main(){
    freopen(FILE".in","r",stdin);
    freopen(FILE".out","w",stdout);
    n=read(),T=read();
    up(i,0,n-1)a[i]=(read()+1)%2;
    for(int i=1;i<=60;i++)
        if(T&(1LL<<i)){
            memcpy(b,a,sizeof(ll)*(n+1));
            for(int j=0;j<n;j++)
                a[j]=b[(j-(1LL<<i-1)%n+n)%n]^b[(j+(1LL<<i-1))%n];
        }
    if(T&1){
        memcpy(b,a,sizeof(ll)*(n+1));
        for(int j=0;j<n;j++)
            a[j]=b[j%n]^b[(j+1)%n];
    }
    if(T&1)up(i,0,n-1)printf("0 %lld%c",(a[i]+1),i==n-1?'
':' ');
    else up(i,0,n-1)printf("%lld 0%c",(a[i]+1),i==n-1?'
':' ');
    return 0;
}