sdut 2840 Best string Orz~ (dp)

 1 #include <iostream>
 2 #include <cstdio>
 3 #include <cstring>
 4 #include <queue>
 5 #include <cmath>
 6 #include <algorithm>
 7 using namespace std;
 8 #define LL long long
 9 
10 int main()
11 {
12     int n1, n2, n3, n4;
13     int i1, i2, i3, i4;
14     LL d[11][11][11][11];
15     d[0][0][0][0] = 1;
16     for(i1 = 0; i1 < 10; i1++)
17         for(i2 = 0; i2 <= i1; i2++)
18             for(i3 = 0; i3 <= i2; i3++)
19                 for(i4 = 0; i4 <= i3; i4++)
20                 {
21                     if(i1) d[i1][i2][i3][i4] += d[i1-1][i2][i3][i4];
22                     if(i2) d[i1][i2][i3][i4] += d[i1][i2-1][i3][i4];
23                     if(i3) d[i1][i2][i3][i4] += d[i1][i2][i3-1][i4];
24                     if(i4) d[i1][i2][i3][i4] += d[i1][i2][i3][i4-1];
25                 }
26     while(cin>>n1>>n2>>n3>>n4)
27     {
28         if(n1==0&&n2==0&&n3==0&&n4==0) break;
29         cout<<d[n1][n2][n3][n4]<<endl;
30     }
31     return 0;
32 }