枚举块的大小x,令siz[p]表示p的子树中节点数,那么这棵树能被分成n/x块大小为x的块当且仅当存在n/x个p满足 x|siz[p] x | s i z [ p ] ,感受一下可以发现根随意定都是一样的
code:
#include<set>
#include<map>
#include<deque>
#include<queue>
#include<stack>
#include<cmath>
#include<ctime>
#include<bitset>
#include<string>
#include<vector>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<climits>
#include<complex>
#include<iostream>
#include<algorithm>
#define ll long long
using namespace std;
inline void read(int &x)
{
char c; while(!((c=getchar())>='0'&&c<='9'));
x=c-'0';
while((c=getchar())>='0'&&c<='9') (x*=10)+=c-'0';
}
const int maxn = 1100000;
int n;
struct edge{int y,nex;}a[maxn<<1]; int len,fir[maxn];
inline void ins(const int x,const int y){a[++len]=(edge){y,fir[x]};fir[x]=len;}
int siz[maxn],s[maxn];
void dfs(const int x,const int fa)
{
siz[x]=1;
for(int k=fir[x],y=a[k].y;k;k=a[k].nex,y=a[k].y) if(y!=fa)
dfs(y,x),siz[x]+=siz[y];
s[siz[x]]++;
}
int main()
{
read(n);
for(int i=1;i<n;i++)
{
int x,y; read(x); read(y);
ins(x,y); ins(y,x);
}
dfs(1,0);
int re=1;
for(int i=2;i<=n;i++) if(n%i==0)
{
int now=0;
for(int j=i;j<=n;j+=i) now+=s[j];
re+=(now==n/i);
}
printf("%d\n",re);
return 0;
}