ural1437

1437

记忆化 模拟倒水过程

 #include <iostream>
 #include<cstdio>
 #include<cstring>
 #include<algorithm>
 #include<stdlib.h>
 #include<vector>
 #include<cmath>
 #include<queue>
 #include<set>
 using namespace std;
 #define N 256
 #define LL long long
 #define INF 0xfffffff
 const double eps = 1e-;
 const double pi = acos(-1.0);
 const double inf = ~0u>>;
 bool dp[N][N][N];
 bool o[];
 int n,m,k;
 void dfs(int i,int j,int g)
 {
     if(dp[i][j][g]) return ;
     dp[i][j][g] = ;
     o[i] = ,o[j] = ,o[g] = ;
     o[i+j] = ,o[j+g] = ,o[i+g] = ;
     o[i+j+g] = ;
     dfs(n,j,g);dfs(i,m,g);dfs(i,j,k);
     int ii = n-i,jj = m-j,gg = k-g;
     if(j<=ii) dfs(i+j,,g);
     else dfs(n,j-ii,g);
     if(g<=ii) dfs(i+g,j,);
     else dfs(n,j,g-ii);
     if(i<=jj) dfs(,i+j,g);
     else dfs(i-jj,m,g);
     if(g<=jj) dfs(i,j+g,);
     else dfs(i,m,g-jj);
     if(i<=gg) dfs(,j,i+g);
     else dfs(i-gg,j,k);
     if(j<=gg) dfs(i,,j+g);
     else dfs(i,j-gg,k);
 }
 int main()
 {
     int i,j,g;
     while(cin>>n>>m>>k)
     {//cout<<",";
         memset(dp,,sizeof(dp));
         memset(o,,sizeof(o));
         dfs(,,);

         int ans = ;
         for(i =  ; i <= n+m+k ; i++)
         if(o[i]) ans++;
         cout<<ans<<endl;
     }
     return ;
 }