有dalao帮忙看下这道题么

#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
#include<queue>
#include<set>
using namespace std;
typedef long long LL;
int n,sta[100005],top,c[100005],mn,mx;
set<int> S,tmp;
LL ans,sum;
int main()
{
	//freopen("candy.in","r",stdin);
	while(scanf("%d",&n),n)
	{
		mn=1e9+7,sum=ans=top=0;
		mx=0;
		S.clear();
		for (int i=1;i<=n;++i)
		{
			scanf("%d",&c[i]);
			mn=min(mn,c[i]);
			mx=max(mx,c[i]);
			sum+=c[i];
		}
		for (int i=1;i*i<=c[1];++i)
		  if (!(c[1]%i))
		  {
		  	S.insert(i);
		  	S.insert(c[1]/i);
		  }
		S.insert(c[1]);
		//printf("%d\n",S.size());
		for (int i=2;i<=n;++i)
		{
			for (set<int>::iterator it=S.begin();it!=S.end();++it)
		      if (c[i]%(*it)==0) tmp.insert(*it);
		    S.clear();
		    for (set<int>::iterator it=tmp.begin();it!=tmp.end();++it)
		      S.insert(*it);
		    tmp.clear();
		}
		for (set<int>::iterator it=S.begin();it!=S.end();++it)
		  sta[++top]=(*it);
		//printf("%d\n",top);
		for (int i=1;i<=top;++i)
		{
			int k=sta[i];
			int num=sum/n/k;
			if (num<=1) continue;
			int w=mn/k;
			ans+=w/n;
			if (w%n==0) --ans;
		}
		printf("%lld\n",ans);
	}
	return 0;
}