UVa11076 - Add Again

#include <cstdio>#include <cstring>usingnamespacestd;
typedeflonglongLL;
constintN=10;
intcnt[N];
intn;
LLfactorial(intx);
LLf(intx);
voidsolve();
boolinput();
intmain()
{
#ifndef ONLINE_JUDGEfreopen("e:\\uva_in.txt", "r", stdin);
#endifwhile (input()) {
solve();
    }
return0;
}
boolinput()
{
if (scanf("%d", &n) !=1||n==0) returnfalse;
memset(cnt, 0x00, sizeof(cnt));
for (inti=0; i<n; i++) {
intx;
scanf("%d", &x);
cnt[x]++;
    }
returntrue;
}
LLfactorial(intx)
{
if (x==0||x==1) return1LL;
elsereturn (LL)x*factorial(x-1);
}
LLf(intx)
{
LLans=0;
for (inti=0; i<n; i++) {
ans=ans*10+x;
    }
returnans;
}
voidsolve()
{
LLnum=factorial(n);
for (inti=0; i<N; i++) {
if (cnt[i] !=0) {
num/=factorial(cnt[i]);
        }
    }
LLans=0;
for (inti=0; i<N; i++) {
if (cnt[i] !=0) {
ans+=f(i) *num*cnt[i] /n;
        }
    }
printf("%lld\n", ans);
}