1 #include<iostream>
 2 #include<cstring>
 3 #include<cstdio>
 4 #include<map>
 5 #include<set>
 6 #include<vector>
 7 #include<algorithm>
 8 #include<cmath>
 9 #include<fstream>
10 #include<iomanip>
11 #include<queue>
12 #include<unordered_set>
13 using namespace std;
14 typedef long long ll;
15 typedef unsigned long long ull;
16 const ll maxn = 300 + 5;
17 int target;
18
19 int num = 1;
20
21 int a[maxn], b[maxn];
22 bool f[maxn][maxn][maxn];
23
24 void dfs(int n, int x, int y){
25     if(f[n][x][y])return;
26     f[n][x][y] = true;
27     if(n == target - 1){
28         for(int i = 0; i <= 2; i++){
29             if((3 * a[n] - b[n - 1] + i) / 2 == a[n + 1]){//原等式 应为 2 * a[n + 1] (+1) = 3 * a[n] - b[n - 1](+1) (+2)  其中括号为可选项，代码里左边等式的 +1 消失了是因为有 /2 的存在。
30                 b[n + 1] = 3 * a[n] - b[n - 1] - b[n] + i;
31                 for(int i = 1; i <= target; i++){
32                     cout << b[i] << " ";
33                 }
34                 exit(0);
35             }
36         }
37     }
38     for(int i = 0; i < 3; i++){
39         b[n + 1] = 3 * a[n] - b[n] - b[n - 1] + i;
40         if(b[n + 1] >= 1)dfs(n + 1, y, b[n + 1]);
41     }
42     return;
43 }
44
45
46 int main(){
47 //    ios::sync_with_stdio(false);
48 //    ifstream cin("data.txt");
49 //    freopen("data.txt", "r", stdin);
50     memset(f, false, sizeof(f));
51     int n;
52     cin >> n;
53     target = n;
54     for(int i = 1; i <= n; i++){
55         cin >> a[i];
56     }
57     for(int i = 1; i <= 2 * a[1]; i++){
58         b[1] = i;
59         if(i != 2 * a[1]){
60             b[2] = 2 * a[1] - i;
61             dfs(2, b[1], b[2]);
62         }
63         b[2] = 2 * a[i] - i + 1;
64         dfs(2, b[1], b[2]);
65     }
66     return 0;
67 }