2013 Asia Nanjing Regional Contest I

Wall Painting

Time Limit: 10000/5000 MS (Java/Others)   

 Memory Limit: 32768/32768 K (Java/Others)

Total Submission(s): 411    Accepted Submission(s): 121

Problem Description

Ms.Fang loves painting very much. She paints GFW(Great Funny Wall) every day. Every day before painting, she produces a wonderful color of pigments by mixing water and some bags of pigments. On the K-th day, she will select K specific bags of pigments and mix them to get a color of pigments which she will use that day. When she mixes a bag of pigments with color A and a bag of pigments with color B, she will get pigments with color A xor B. When she mixes two bags of pigments with the same color, she will get color zero for some strange reasons. Now, her husband Mr.Fang has no idea about which K bags of pigments Ms.Fang will select on the K-th day. He wonders the sum of the colors Ms.Fang will get with different plans. For example, assume n = 3, K = 2 and three bags of pigments with color 2, 1, 2. She can get color 3, 3, 0 with 3 different plans. In this instance, the answer Mr.Fang wants to get on the second day is 3 + 3 + 0 = 6. Mr.Fang is so busy that he doesn’t want to spend too much time on it. Can you help him? You should tell Mr.Fang the answer from the first day to the n-th day.

 

Input

There are several test cases, please process till EOF. For each test case, the first line contains a single integer N(1 <= N <= 10³).The second line contains N integers. The i-th integer represents the color of the pigments in the i-th bag.

 

Output

For each test case, output N integers in a line representing the answers(mod 10⁶ +3) from the first day to the n-th day.

 

Sample Input

4

1 2 10 1

 

Sample Output

14 36 30 8

 

Source

2013ACM/ICPC亚洲区南京站现场赛——题目重现

 

Recommend

liuyiding

 

#include <cstdio>
#include <vector>
#include <cmath>
#include <queue>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
#define INF 0x7fffffff
#define mod 1000003
#define ll long long
#define maxn 1005
#define pi acos(-1.0)
int n, m, k, d, x, y;
int a[maxn],p[maxn];
int c[maxn][maxn];
void init(){
    p[1] = 1;
    for (int i = 2; i < 32; i++)p[i] = (p[i - 1]<<1)%mod;
    c[0][0] = 1; c[1][0] = c[1][1] = 1;
    for (int i = 2; i < maxn; i++){
        c[i][0] = 1;
        for (int j = 1; j <= i; j++){
            c[i][j] = (c[i-1][j] +c[i-1][j-1])%mod;
        }
    }
}
int main(){
    init();
    while (~scanf("%d", &n)){
        memset(a, 0, sizeof a);
        for (int i = 1; i <= n; i++){
            scanf("%d", &x);
            for (int j = 1; x; j++,x>>=1)
                a[j]+=x&1;
        }
        for (int i = 1; i <= n; i++){
            int ans = 0;
            for (int j = 1; j < 32; j++){
                for (int k = 1; k <= a[j] && k <= i; k += 2){
                    if (n - a[j] < i - k)continue;
                    int tmp = ((ll)c[a[j]][k] * c[n - a[j]][i - k]) % mod;
                    ans = (ans + (ll)tmp*p[j]%mod) % mod;
                }
            }
            printf(i == n ? "%d\n" : "%d ", ans);
        }
    }
    return 0;
}