Submission #1497870

---

Source Code Expand

#include "iostream"
#include "climits"
#include "list"
#include "queue"
#include "stack"
#include "set"
#include "functional"
#include "algorithm"
#include "string"
#include "map"
#include "iomanip"
#include "random"

using namespace std;
const long long int MOD = 1000000007;

long long int power(long long int x, long long int n, long long int M) {
	long long int tmp = 1;

	if (n > 0) {
		tmp = power(x, n / 2, M);
		if (n % 2 == 0) tmp = (tmp*tmp) % M;
		else tmp = (((tmp*tmp) % M)*x) % M;
	}
	return tmp;
}

long long int N, M, K, Q, W, H, L, R;
long long int ans;

int main() {
	ios::sync_with_stdio(false);
	cin >> N;
	int box[100000];
	for (int i = 1; i < N; i++)cin >> box[i];
	int num[100000];
	num[0] = box[1];
	for (int i = 1; i < N; i++) {
		if (box[i] == num[i - 1])num[i] = 1;
		else num[i] = box[i];
	}
	for (int i = 0; i < N; i++) {
		if (i)cout << " ";
		cout << num[i];
	}
	cout << endl;
	return 0;
}

Submission Info

Judge Result