BOJ 23432 - Steve's perfectionism [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=1; i<n; i++) {
    if (a[i-1] < a[i]) continue;
    a[i] = (a[i-1] / a[i] + 1) * a[i];
  }
 
  for (int i=0; i<n; i++) {
    cout << a[i] << " ";
  }
}
 
int main(void) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
 
  solve();
  return 0;
}