ZOJ 1174 1!到n!的和

 1
 2
 3
 4
 5
 6
 7
 8
 9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61

#include <iostream>
#include <algorithm>
#include <numeric>
#include <bitset>
#include <vector>
#include <set>
#include <deque>
#include <list>
#include <map>
#include <stack>
#include <cstdio>
#include <cstring>
#include <cmath>

using namespace std;

#define fe(i, a, b) for (int i = int(a); i <= int(b); i++)
#define fu(i, a, b) for (int i = int(a); i < int(b); i++)
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef pair<int, int> pii;
#define pb push_back
#define mp make_pair

#define MAXN 12 + 1

int r[MAXN] = {0};
int f[MAXN] = {0};

int fact(int n)
{
    if (n == 1 || n == 0) return 1;
    if (f[n]) return f[n];
    f[n] = fact(n-1) * n;
    return f[n];
}

int solve(int n)
{
    if (!n) return 0;
    if (r[n])
        return r[n];
    else
        r[n] = solve(n-1) + fact(n-1)* n;
    return r[n];
}

int main()
{
    int n;

    while (cin >> n) cout << solve(n) << endl;
    for (int i = 0; i < MAXN; i++) {
        cout << r[i] << endl;
    }

    return 0;
}