BOJ 33168 - 三角足し算 (Triangle Addition) [C++]

문제

링크

풀이

#include <iostream>
#include <vector>
using namespace std;
 
void solve(void) {
  int n; cin >> n;
  vector<int> a(n);
  for (int i=0; i<n; i++) cin >> a[i];
 
  for (int i=n-1; i>=0; i--) {
    for (int j=0; j<i; j++) {
      a[j] += a[j+1];
      cout << a[j] << " ";
    }
    cout << "\n";
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}