Language: C++

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define vll vector<ll>
#define pll pair<ll,ll>
#define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
#define forD(i,a,n,x) for(auto i=n-1;i>=0;i-=x)
#define ranit(it,n) for(auto it:n)
#define testCases ll t;cin>>t;while(t--)
#define mp make_pair
#define pb push_back
#define F first
#define S second
#define mod 1000000007
#define init(a,x) memset(a,x,sizeof(a))

ll size = 1000003;
vector<bool> sievevect(size,0);
void sieve()
{
	sievevect[2]=1;;
	forA(i,3,size,2) sievevect[i]=1;
	forA(i,3,size,2) if(sievevect[i]==1){forA(j,i*i,size,i) sievevect[j]=0;}
}

ll gcd(ll a, ll b)
{
	if(a==0) return b;
	return gcd(b%a,a);
}

int main()
{
	ios_base::sync_with_stdio(false);	cin.tie(NULL);	cout.tie(NULL);
	sieve();
	ll n; cin>>n; vll v(n); forA(i,0,n,1)cin>>v[i];
	vll prime(n); if(sievevect[v[0]]==1)prime[0]=1;
	forA(i,1,n,1)
	{
		ll x=0;
		if(sievevect[v[i]]==1)x=1;
		prime[i]=prime[i-1]+x;
	}
	//forA(i,0,n,1)cout<<prime[i]<<" ";
	ll c=0;
	forA(i,0,n-1,1)
	{
		if(sievevect[v[i]]==1)c++;
		else
		{
			if(prime[n-1]-prime[i]==(n-i-1))c++;
		}
	}

	//cout<<gcd(6,0);
	if(c==n-1)cout<<"pairwise coprime";
	else
	{
		ll g=0;
		forA(i,0,n,1)g = gcd(g,v[i]);
		if(g==1)cout<<"setwise coprime";
		else cout<<"not coprime";
	}

	return 0;
}

Compiler output:
a.cc:18:24: error: reference to 'size' is ambiguous
   18 | vector<bool> sievevect(size,0);
      |                        ^~~~
In file included from /usr/include/c++/14/string:53,
                 from /usr/include/c++/14/bitset:52,
                 from /usr/include/x86_64-linux-gnu/c++/14/bits/stdc++.h:52,
                 from a.cc:1:
/usr/include/c++/14/bits/range_access.h:272:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
  272 |     size(const _Tp (&)[_Nm]) noexcept
      |     ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note:                 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
  262 |     size(const _Container& __cont) noexcept(noexcept(__cont.size()))
      |     ^~~~
a.cc:17:4: note:                 'long long int size'
   17 | ll size = 1000003;
      |    ^~~~
a.cc: In function 'void sieve()':
a.cc:22:18: error: reference to 'size' is ambiguous
   22 |         forA(i,3,size,2) sievevect[i]=1;
      |                  ^~~~
a.cc:6:36: note: in definition of macro 'forA'
    6 | #define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
      |                                    ^
/usr/include/c++/14/bits/range_access.h:272:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
  272 |     size(const _Tp (&)[_Nm]) noexcept
      |     ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note:                 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
  262 |     size(const _Container& __cont) noexcept(noexcept(__cont.size()))
      |     ^~~~
a.cc:17:4: note:                 'long long int size'
   17 | ll size = 1000003;
      |    ^~~~
a.cc:23:18: error: reference to 'size' is ambiguous
   23 |         forA(i,3,size,2) if(sievevect[i]==1){forA(j,i*i,size,i) sievevect[j]=0;}
      |                  ^~~~
a.cc:6:36: note: in definition of macro 'forA'
    6 | #define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
      |                                    ^
/usr/include/c++/14/bits/range_access.h:272:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
  272 |     size(const _Tp (&)[_Nm]) noexcept
      |     ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note:                 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
  262 |     size(const _Container& __cont) noexcept(noexcept(__cont.size()))
      |     ^~~~
a.cc:17:4: note:                 'long long int size'
   17 | ll size = 1000003;
      |    ^~~~
a.cc:23:57: error: reference to 'size' is ambiguous
   23 |         forA(i,3,size,2) if(sievevect[i]==1){forA(j,i*i,size,i) sievevect[j]=0;}
      |                                                         ^~~~
a.cc:6:36: note: in definition of macro 'forA'
    6 | #define forA(i,a,n,x) for(ll i=a;i<n;i+=x)
      |                                    ^
/usr/include/c++/14/bits/range_access.h:272:5: note: candidates are: 'template<class _Tp, long unsigned int _Nm> constexpr std::size_t std::size(const _Tp (&)[_Nm])'
  272 |     size(const _Tp (&)[_Nm]) noexcept
      |     ^~~~
/usr/include/c++/14/bits/range_access.h:262:5: note:                 'template<class _Container> constexpr decltype (__cont.size()) std::size(const _Container&)'
  262 |     size(const _Container& __cont) noexcept(noexcept(__cont.size()))
      |     ^~~~
a.cc:17:4: note:                 'long long int size'
   17 | ll size = 1000003;
      |    ^~~~