1081E-Missing_Numbers.cpp

/*
	written by Pankaj Kumar.
	country:-INDIA
*/
#include <bits/stdc++.h>
using namespace std;
typedef long long ll ;
typedef set<pair<int,int>> spi;
typedef set<pair<ll,ll>> spl;
typedef vector<pair<int,int>> vpi;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef vector<bool> vb;
typedef vector<char> vc;
typedef vector<pair<ll,ll>> vpl;
typedef vector<string> vs;
typedef map<int,int>mi;
typedef map<ll,ll> ml;
typedef set<string> ss;
typedef set<int> si;
typedef set<ll> sl;
#define pan cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
// define values.
#define mod 1000000007;
#define phi 1.618
/* Bit-Stuff */
#define get_set_bits(a) (__builtin_popcount(a))
#define get_set_bitsll(a) ( __builtin_popcountll(a))
#define get_trail_zero(a) (__builtin_ctz(a))
#define get_lead_zero(a) (__builtin_clz(a))
#define get_parity(a) (__builtin_parity(a))
/*  Abbrevations  */
#define ff first
#define ss second
#define mp make_pair
#define line cout<<endl;
#define pb push_back
#define Endl "\n"
#define loopi(a,b) for(int i=a;i<=b;i++)
// Some print
#define no cout<<"NO"<<endl
#define yes cout<<"YES"<<endl
// function

ll power(ll x,ll y)
{
	ll res=1;
	while(y>0)
	{
		if(y%2==1)res*=x;
		y/=2; x*=x;
	}
	return res;
}
/* ascii value 
A=65,Z=90,a=97,z=122
*/
/*  -----------------------------------------------------------------------------------*/

int main()
{
	pan;
	int n;
	cin>>n;
	vl v(n/2,0);
	vl ans(n,0);
	for(auto &s:v)
		cin>>s;
	ll sum=0;
	int flag=0;
	for(int i=0;i<n/2;i++)
	{
		ll temp=0;
		sum+=v[i];
		temp=int(sqrt(sum));
		for(ll j=temp+1;j<10000000;j++)
		{
			ll temp_square=j*j;
			ll temp_diff=temp_square-sum;
			ll temp_sqrt=sqrt(temp_diff);
			ll temp_previous=sum-v[i]+temp_diff;
			ll temp_previous_sqrt=sqrt(temp_previous);
			if(temp_previous_sqrt*temp_previous_sqrt==temp_previous)
			{
				sum+=temp_diff;
				ans[flag]=temp_diff;
				ans[flag+1]=v[i];
				flag+=2;
				break;
			}
		}
	}
	if(flag<n)
		cout<<"No"<<endl;
	else
	{
		cout<<"Yes"<<endl;
		for(int i=0;i<n;i++)
		{
			if(ans[i]!=0)
				cout<<ans[i]<<" ";
		}
	}
	line;
	// cout<<"no of terms is "<<flag<<Endl;
}