Codeforces Round #259 (Div. 2) D

D. Little Pony and Harmony Chest

time limit per test

4 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

Princess Twilight went to Celestia and Luna's old castle to research the chest from the Elements of Harmony.

A sequence of positive integers bi is harmony if and only if for every two elements of the sequence their greatest common divisor equals 1. According to an ancient book, the key of the chest is a harmony sequence bi which minimizes the following expression:

You are given sequence ai, help Princess Twilight to find the key.

Input

The first line contains an integer n (1 ≤ n ≤ 100) — the number of elements of the sequences a and b. The next line contains n integersa1, a2, ..., an (1 ≤ ai ≤ 30).

Output

Output the key — sequence bi that minimizes the sum described above. If there are multiple optimal sequences, you can output any of them.

Sample test(s)

input

5
1 1 1 1 1

output

1 1 1 1 1 

input

5
1 6 4 2 8

output

1 5 3 1 8 

sl : 很傻比的状态压缩，直接背包就搞了，又傻逼了。

// by caonima

// hehe
#include <bits/stdc++.h>
using namespace std;
const int MAX= ;
const int inf = 0x3f3f3f3f;
int dp[MAX][<<],val[MAX],a[MAX],ans[MAX][<<];
int prime[MAX],vis[MAX],cur=;
vector<int> C;
void init() {
    memset(vis,,sizeof(vis));
    vis[]=;
    for(int i=;i<;i++) {
        if(!vis[i]) prime[cur++]=i;
        for(int j=i;j<;j+=i) vis[j]=;
    }
    return ;
}
int main() {
    init();
    int n;
    while(scanf("%d",&n)==) {
        memset(val,,sizeof(val));
        for(int i=;i<=n;i++) {
            scanf("%d",&a[i]);
        }
        for(int i=;i<;i++) {
            for(int j=;j<cur;j++) {
                if(i%prime[j]==) {
                    val[i]|=(<<j);
                }
            }
        }
        for(int i=;i<=n;i++) {
            for(int j=;j<(<<cur);j++) dp[i][j]=inf;
        }
        for(int i=;i<(<<cur);i++) dp[][i]=;
        for(int i=;i<=n;i++) {
            for(int j=;j<(<<cur);j++) {
                for(int k=;k<;k++) {
                    if((j&val[k])==) {
                        int res=dp[i-][j^val[k]]+abs(k-a[i]);
                        if(res<dp[i][j]) {
                            dp[i][j]=res;
                            ans[i][j]=k;
                        }
                    }
                }
            }
        }
        int res=inf ,state;
        for(int i=;i<(<<cur);i++) {
            if(res>dp[n][i]) {
                res=dp[n][i];
                state=i;
            }
        }
     //   printf("%d\n",ans[n][0]);
        for(int i=n;i>=;i--) {
            C.push_back(ans[i][state]);
            int k=ans[i][state];
            state=state^(val[k]);
        }
        for(int i=C.size()-;i>=;i--) {
            printf("%d ",C[i]);
        }
        printf("\n");
    }
    return ;
}

#include <bits/stdc++.h>
#define debug() printf("sss");
using namespace std;
const int inf = 0x3f3f3f3f;
const int MAX = ;
int cur=,vis[MAX],prime[MAX],state[MAX];
vector<int> C;
int dp[MAX][<<],a[MAX],b[MAX],n,res[MAX][<<];
void init() {
    for(int i=;i<MAX;i++) {
        if(!vis[i]) prime[cur++]=i;
        for(int j=i;j<MAX;j+=i) vis[j]=;
    }
    memset(state,,sizeof(state));
    for(int i=;i<;i++) {
        for(int j=;j<;j++) {
            if(i%prime[j]==) state[i]|=(<<j);
        }
    }
}
int dfs(int pos,int s) {
    if(pos>n) return ;
    if(~dp[pos][s]) return dp[pos][s];
    int ans=inf;
    for(int i=;i<;i++) {
        if(s&state[i]) continue;
        int t=dfs(pos+,s|state[i])+abs(i-a[pos]);
        if(ans>t) {
            ans=t;
            res[pos][s]=i;
        }
    }
    return dp[pos][s]=ans;
}
int main() {
    init();

while(scanf("%d",&n)==) {
        for(int i=;i<=n;i++) {
            scanf("%d",&a[i]);
        }
        memset(dp,-,sizeof(dp));
        dfs(,);
        int s=;
       
        for(int i=;i<=n;i++) {
            C.push_back(res[i][s]);
            int k=res[i][s];
            s=s|(state[k]);
        }
        for(int i=;i<C.size();i++) {
            printf("%d ",C[i]);
        }
        printf("\n");
    }
}