P4980 【模板】Polya定理:
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<map>
#include<queue>
#define ll long long
#define llu unsigned ll
using namespace std;
const int mod=1000000007;
const int maxn=100100;
int prime[maxn];
int ha[maxn];
int cnt=0;
void Prime(void)
{
ha[1]=true;
for(int i=2;i<maxn;i++)
{
if(!ha[i]) prime[cnt++]=i;
for(int j=0;<