Untitled
Mohammed
plain_text
a year ago
1.1 kB
5
Indexable
#include <algorithm>
#include <iostream>
#include <sstream>
#include <string.h>
#include <bits/ranges_algo.h>
using namespace std;
bool cheak(int arr[],int n) {
for(int i=0;i<n-1;i++) {
bool flag = false;
int v=0;
for(int j=0;j<=100;j++) {
if (abs(arr[i]-j)==arr[i+1]) {
if (flag) {
return false;
}
flag = true;
v=j;
}
}
if (!flag) {
return false;
}
arr[i+1]=v;
}
return true;
}
int main() {
int t;
cin >> t;
while (t--) {
int n;
cin >> n;
int arr[n];
for (int i = 0; i < n; i++) {
cin >> arr[i];
}
if (cheak(arr,n)) {
for (int i = 0; i < n; i++) {
cout << arr[i] << " ";
}
}
else {
cout << "-1";
}
cout << endl;
}
return 0;
}
Editor is loading...
Leave a Comment