TC SRM474 500points

先求出最短路。本来以为是d[j] == sum(d[i])或者d[j]== mul(d[i])之类的式子。不过后来发现既然是独立的那么就直接把每个点的最短路条数乘起来就行了……这也叫DP？（额-。=

然后就是vector的使用。以前总找借口说不想学，不过现在是时候学起来了。其实也没想象中的那么难用，只要愿意去学。

#include <vector>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <stack>
#include <bitset>
#include <algorithm>
#include <functional>
#include <numeric>
#include <utility>
#include <sstream>
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <ctime>

using namespace std;

class TreesCount {
public:
 int count(vector <string>);
};

int TreesCount::count(vector <string> graph)
{
    int d[60],i,j;
    int n = graph[0].size();
    d[0] = 0;
    for(i = 1;i<n;i++)d[i] = 9999999;
    int vis[60],x = 0;
    memset(vis,0,sizeof(vis));
    for(i = 1;i<n;i++)
    {
        int minn = 9999999;
        for(j = 0;j<n;j++)
           if(!vis[j]&&d[j]<minn)minn = d[x = j];
        vis[x] = 1;
        for(j = 0;j<n;j++)
           d[j] = min(d[j],d[x]+graph[x][j]-'0');
    }
    int deg[60];
    memset(deg,0,sizeof(deg));
    for(i = 0;i<n;i++)
      for(j = 0;j<n;j++)
         if(i!=j&&d[j] == d[i]+graph[i][j]-'0')
            deg[j]++;
    int ans = 1;
    for(i = 1;i<n;i++)
       ans = (ans*deg[i])%1000000007;

    return ans;
}