#include #include using namespace std; typedef long long ll; typedef pair P; long long int INF = 3e18; const ll fact_table = 5000000; double Pi = 3.1415926535897932384626; //vector G[550010]; vector

tree[500010]; priority_queue pql; priority_queue

pqp; //big priority queue priority_queue ,greater > pqls; priority_queue ,greater

> pqps; //small priority queue //top pop int dx[8]={1,0,-1,0,1,1,-1,-1}; int dy[8]={0,1,0,-1,1,-1,-1,1}; char dir[] = "DRUL"; //ll bit[500005]; //↓,→,↑,← #define p(x) cout< number2){ swap(number1,number2); } if(number1 == 0 || number1 == number2){ return number2; }else{ return gcd(number2 % number1,number1); } } void YES(bool condition){ if(condition){ p("YES"); }else{ p("NO"); } return; } void Yes(bool condition){ if(condition){ p("Yes"); }else{ p("No"); } return; } /* ll fact[fact_table + 5],rfact[fact_table + 5]; void c3_init(){ fact[0] = rfact[0] = 1; for(ll i=1; i<=fact_table; i++){ fact[i] = (fact[i-1]*i) % mod; } rfact[fact_table] = rui(fact[fact_table],mod - 2); for(ll i=fact_table; i>=1; i--){ rfact[i-1] = rfact[i] * i; rfact[i-1] %= mod; } return;} ll c3(ll n,ll r){ return (((fact[n] * rfact[r]) % mod ) * rfact[n-r]) % mod;} */ ll n,m,num,sum,a,b,c,d,e,g,h,w,i,j,q,r,l; ll k,idx,ans; ll x[500005],y[500005],z[500005]; ll dp[55][3000]; vector v; ll find_idx(ll num){ return lb(v.begin(), v.end(), num) - v.begin(); } void solve(ll idx){ v.clear(); for(int i=1;i*i<=x[idx];i++){ if(x[idx] % i == 0){ v.pb(i); if(i * i != x[idx]){ v.pb(x[idx] / i); } } } sort(v.begin(), v.end()); m = v.size(); for(int i=0;i> n; for(int i=0;i> x[i]; } for(int i=0;i