#pragma GCC optimize ("Ofast")
#include<bits/stdc++.h>
using namespace std;
template < class T> inline T GCD_L( T a,T b) {
T r;
while ( a) {
r= b;
b= a;
a= r% a;
}
return b;
}
#define main dummy_main
int main( ) {
return 0 ;
}
#undef main
class Solution{
public :
bool isGoodArray( vector< int > & nums) {
int Lj4PdHRW;
int KL2GvlyY;
if ( nums.size ( ) == 0 ) {
KL2GvlyY = 0 ;
}
else {
KL2GvlyY = nums[ 0 ] ;
for ( Lj4PdHRW= ( 1 ) ; Lj4PdHRW< ( nums.size ( ) ) ; Lj4PdHRW++ ) {
KL2GvlyY = GCD_L( KL2GvlyY, nums[ Lj4PdHRW] ) ;
}
}
if ( KL2GvlyY== 1 ) {
return true ;
}
return false ;
}
}
;
// cLay varsion 20191102-1
// --- original code ---
// #define main dummy_main
// {}
// #undef main
//
// class Solution {
// public:
// bool isGoodArray(vector<int>& nums) {
// if(gcd(nums(nums.size()))==1) return true;
// return false;
// }
// };
I3ByYWdtYSBHQ0Mgb3B0aW1pemUgKCJPZmFzdCIpCiNpbmNsdWRlPGJpdHMvc3RkYysrLmg+CnVzaW5nIG5hbWVzcGFjZSBzdGQ7CnRlbXBsYXRlPGNsYXNzIFQ+IGlubGluZSBUIEdDRF9MKFQgYSxUIGIpewogIFQgcjsKICB3aGlsZShhKXsKICAgIHI9YjsKICAgIGI9YTsKICAgIGE9ciVhOwogIH0KICByZXR1cm4gYjsKfQojZGVmaW5lIG1haW4gZHVtbXlfbWFpbgppbnQgbWFpbigpewogIHJldHVybiAwOwp9CiN1bmRlZiBtYWluCmNsYXNzIFNvbHV0aW9uewogIHB1YmxpYzoKICBib29sIGlzR29vZEFycmF5KHZlY3RvcjxpbnQ+JiBudW1zKXsKICAgIGludCBMajRQZEhSVzsKICAgIGludCBLTDJHdmx5WTsKICAgIGlmKG51bXMuc2l6ZSgpPT0wKXsKICAgICAgS0wyR3ZseVkgPSAwOwogICAgfQogICAgZWxzZXsKICAgICAgS0wyR3ZseVkgPSBudW1zWzBdOwogICAgICBmb3IoTGo0UGRIUlc9KDEpO0xqNFBkSFJXPChudW1zLnNpemUoKSk7TGo0UGRIUlcrKyl7CiAgICAgICAgS0wyR3ZseVkgPSBHQ0RfTChLTDJHdmx5WSwgbnVtc1tMajRQZEhSV10pOwogICAgICB9CiAgICB9CiAgICBpZihLTDJHdmx5WT09MSl7CiAgICAgIHJldHVybiB0cnVlOwogICAgfQogICAgcmV0dXJuIGZhbHNlOwogIH0KfQo7Ci8vIGNMYXkgdmFyc2lvbiAyMDE5MTEwMi0xCgovLyAtLS0gb3JpZ2luYWwgY29kZSAtLS0KLy8gI2RlZmluZSBtYWluIGR1bW15X21haW4KLy8ge30KLy8gI3VuZGVmIG1haW4KLy8gCi8vIGNsYXNzIFNvbHV0aW9uIHsKLy8gcHVibGljOgovLyAgIGJvb2wgaXNHb29kQXJyYXkodmVjdG9yPGludD4mIG51bXMpIHsKLy8gICAgIGlmKGdjZChudW1zKG51bXMuc2l6ZSgpKSk9PTEpIHJldHVybiB0cnVlOwovLyAgICAgcmV0dXJuIGZhbHNlOwovLyAgIH0KLy8gfTsK