ural 1142. Relations

 1 /**
 2 Create By yzx - stupidboy
 3 */
 4 #include <cstdio>
 5 #include <cstring>
 6 #include <cstdlib>
 7 #include <cmath>
 8 #include <deque>
 9 #include <vector>
10 #include <queue>
11 #include <iostream>
12 #include <algorithm>
13 #include <map>
14 #include <set>
15 #include <ctime>
16 #include <iomanip>
17 using namespace std;
18 typedef long long LL;
19 typedef double DB;
20 #define MIT (2147483647)
21 #define INF (1000000001)
22 #define MLL (1000000000000000001LL)
23 #define sz(x) ((int) (x).size())
24 #define clr(x, y) memset(x, y, sizeof(x))
25 #define puf push_front
26 #define pub push_back
27 #define pof pop_front
28 #define pob pop_back
29 #define ft first
30 #define sd second
31 #define mk make_pair
32 
33 inline int Getint()
34 {
35     int Ret = 0;
36     char Ch = ‘ ‘;
37     bool Flag = 0;
38     while(!(Ch >= ‘0‘ && Ch <= ‘9‘))
39     {
40         if(Ch == ‘-‘) Flag ^= 1;
41         Ch = getchar();
42     }
43     while(Ch >= ‘0‘ && Ch <= ‘9‘)
44     {
45         Ret = Ret * 10 + Ch - ‘0‘;
46         Ch = getchar();
47     }
48     return Flag ? -Ret : Ret;
49 }
50 
51 const int N = 15;
52 int n;
53 int dp[N][N], ans[N];
54 
55 inline void Init()
56 {
57     dp[0][0] = 1;
58     for(int i = 1; i <= 10; i++)
59         for(int j = 1; j <= i; j++)
60             dp[i][j] = dp[i - 1][j] * j + dp[i - 1][j - 1] * j;
61     for(int i = 1; i <= 10; i++)
62         for(int j = 1; j <= i; j++)
63             ans[i] += dp[i][j];
64 }
65 
66 inline void Solve();
67 
68 inline void Input()
69 {
70     Init();
71     while(scanf("%d", &n) == 1)
72     {
73         if(n == -1) return;
74         Solve();
75     }
76 }
77 
78 inline void Solve()
79 {
80     printf("%d\n", ans[n]);
81 }
82 
83 int main()
84 {
85     freopen("a.in", "r", stdin);
86     Input();
87     //Solve();
88     return 0;
89 }