算术基本定理
#include<cstdio>
#include<cmath>
#include<algorithm>
#include<cstring>
#include<vector>
#define ll long long
using namespace std;
int n;
struct Int{
int d,m;
int factor[101],p[101];
}t[40];
void break_down(int x)
{
t[x].m = 0;
int _t = t[x].d,_tmp = sqrt(t[x].d + 0.5);
for(int i = 2;i <= _tmp;++i)
{
if(_t % i == 0)
{
t[x].factor[++t[x].m] = i;
while(_t % i == 0)
{
_t /= i;
t[x].p[t[x].m]++;
}
}
}
if(_t != 1)
{
t[x].factor[++t[x].m] = _t;
t[x].p[t[x].m]++;
}
}
int main()
{
scanf("%d",&n);
for(int i = 1;i <= n;++i)
{
scanf("%d",&t[i].d);
}
return 0;
}