D. Two Divisors(数学+构造)

https://codeforces.com/problemset/problem/1366/D

---

思路：

ai分解成质因子形式。对于其中一个pi，取到pi^k1满。

那么此时对于a的所有质因子来说，不管取啥， 其b1+b2的公共因子只有一边能满足。此时互质了。

#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e7+1000;
typedef int LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL primes[maxn],v[maxn],cnt=0;
LL a[maxn];
void getprimes(LL n){
     for(LL i=2;i<=n;i++){
        if(!v[i]){
            primes[++cnt]=i;v[i]=i;
        }
        for(LL j=1;j<=cnt&&primes[j]<=n/i;j++){
            v[primes[j]*i]=primes[j];
            if(i%primes[j]==0){
                break;
            }
        }
     }
}
int main(void){
   cin.tie(0);std::ios::sync_with_stdio(false);
   getprimes(1e7);
   LL n;cin>>n;
   vector<LL>v1,v2;
   for(LL i=1;i<=n;i++) cin>>a[i];
   for(LL i=1;i<=n;i++){
       if(v[a[i]]==a[i]){
          v1.push_back(-1);v2.push_back(-1);
       }
       else{
          LL temp1=v[a[i]];LL ans1=1;
          while(a[i]%temp1==0&&a[i]){
              a[i]/=temp1;ans1*=temp1;
          }
          if(a[i]>1){
             v1.push_back(ans1);
             v2.push_back(a[i]);
          }
          else{
             v1.push_back(-1);
             v2.push_back(-1);
          }
       }
   }
   for(auto i:v1){
       cout<<i<<" ";
   }cout<<"\n";
   for(auto i:v2){
       cout<<i<<" ";
   }cout<<"\n";
   return 0;
}