Submission #9965931

---

Source Code Expand

#include <iostream>
#include <vector>
#include <queue>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <tuple>
#include <list>
#include <deque>
#include <stack>
#include <complex>
#include <functional>
#include <regex>
#include <map>
#include <numeric>

using namespace std;

#define REP(i,a,b) for(int i=(a); i<(b); ++(i))
#define rep(i,n) REP(i,0,n)

const int dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const int dy[] = {1, 0, -1, 0, 1, -1, -1, 1};

using ll = long long;
using ld = long double;
using ull = unsigned long long;

int main(void) {
  int N; cin >> N;
  vector<int> A(N), X(N);

  ll S = 0;
  rep(i, N) {
    cin >> A[i];
    S += A[i];
  }

  X[0] = S;
  for (int i = 1; i < A.size(); i += 2) {
    X[0] -= 2 * A[i];
  }

  for (int i = 1; i < N; i++) {
    X[i] = 2 * A[i - 1] - X[i - 1];
  }

  rep(i, N) {
    if (i) cout << " ";
    cout << X[i];
  }
  cout << endl;
  return 0;
}

Submission Info

Judge Result