計算出每一位上數(shù)字i會出現(xiàn)的次數(shù) ?累加

#include <cstdio> #include <cstdlib> #include <cmath> #include <map> #include <set> #include <stack> #include <vector> #include <sstream> #include <string> #include <cstring> #include <algorithm> #include <iostream> #define maxn 1010 #define INF 0x7fffffff #define inf 10000000 #define MOD 1000000007 #define ull unsigned long long #define ll long long using namespace std;int a[10], b[10], sum, f[13]; void init() {memset(a, 0, sizeof(a));memset(b, 0, sizeof(b));sum = 0;f[0] = f[1] = 1;for(int i = 2; i < 13; ++ i)f[i] = f[i-1]*i; }int main() {int n, r;while(scanf("%d", &n) == 1 && n){init();for(int i = 0; i < n; ++ i) {scanf("%d", &r); a[r] ++; sum ++;}for(int i = 1; i < 10; ++ i)if(a[i]){b[i] = f[sum-1];for(int j = 0; j < 10; ++ j)if(a[j])b[i] /= i == j ? f[a[j]-1]:f[a[j]];}ll ans = 0;for(int i = 0; i < n; ++ i){ans *= 10;for(int j = 0; j < 10; ++ j)ans += j*b[j];}printf("%lld\n", ans);}return 0; }

轉(zhuǎn)載于:https://www.cnblogs.com/avema/p/3774192.html

總結(jié)

以上是生活随笔為你收集整理的uva 11076的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。