1081E - Missing Numbers - CodeForces Solution

#include <bits/stdc++.h>
using namespace std;
#define int long long
const int N = 1e5 + 5;
int t , n , a[N];
void solve()
{
	cin >> n;int sum = 0;
	for(int i = 2;i <= n;i += 2) cin >> a[i];
	for(int i = 2;i <= n;i += 2)
	{
		int ansa = -1;
		if(!(a[i] & 1) && !(a[i] % 4 == 0))
		{
			puts("No");
			return;
		}
		for(int j = 1;j * j <= a[i];j ++)
		{
			if(a[i] % j) continue;
			int x = j , y = a[i] / j;
			if((x & 1) ^ (y & 1)) continue;
			int A = (y - x) / 2 , B = (x + y) / 2;
			if(A * A <= sum || B * B <= sum + a[i]) continue;
			ansa = A * A;  
		}
		if(ansa == -1)
		{
			puts("No");
			return ;
		}
		a[i - 1] = ansa - sum;
		sum += a[i - 1] + a[i];
	}
	puts("Yes");
	for(int i = 1;i <= n;i ++) cout << a[i] << ' ';
}
signed main()
{
	t = 1;
	while(t --) solve();
	return 0;
}