解题报告

题意：

有一个旅游团如今去出游玩，如今有n个城市，m条路。因为每一条路上面规定了最多可以通过的人数，如今想问这个旅游团人数已知的情况下最少须要运送几趟

思路：

求出发点到终点全部路其中最小值最大的那一条路。

求发可能有多种。最短路的松弛方式改掉是一种。最小生成树的解法也是一种（ps。prime和dijs就是这样子类似的）

#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#define inf 0x3f3f3f3f

using namespace std;

int n,m,q,mmap[110][110];

void floyd() {

    for(int k=0; k<n; k++)

        for(int i=0; i<n; i++)

            for(int j=0; j<n; j++)

                mmap[i][j]=max(mmap[i][j],min(mmap[i][k],mmap[k][j]));

}

int main() {

    int i,j,u,v,w,k=1;

    while(~scanf("%d%d",&n,&m)) {

        if(!n&&!m)break;

        for(i=0; i<n; i++) {

            for(j=0; j<n; j++)

                mmap[i][j]=0;

        }

        for(i=0; i<m; i++) {

            scanf("%d%d%d",&u,&v,&w);

            mmap[u-1][v-1]=mmap[v-1][u-1]=w;

        }

        floyd();

        scanf("%d%d%d",&u,&v,&w);

        int ans=0,num=mmap[u-1][v-1]-1;

        ans=ceil((double)w/num);

        printf("Scenario #%d\n",k++);

        printf("Minimum Number of Trips = %d\n\n",ans);

    }

    return 0;

}

The Tourist Guide

Input: standard input

Output: standard output

Mr. G. works as a tourist guide. His current assignment is to take some tourists from one city to another. Some two-way roads connect the cities. For each pair of neighboring cities there is a bus service that runs only between those two cities and uses
the road that directly connects them. Each bus service has a limit on the maximum number of passengers it can carry. Mr. G. has a map showing the cities and the roads connecting them. He also has the information regarding each bus service. He understands that
it may not always be possible for him to take all the tourists to the destination city in a single trip. For example, consider the following road map of 7 cities. The edges connecting the cities represent the roads and the number written on each edge indicates
the passenger limit of the bus service that runs on that road.

Now, if he wants to take 99 tourists from city 1 to city 7, he will require at least 5 trips, since he has to ride the bus with each group, and the route he should take is : 1 - 2 - 4 - 7.

But, Mr. G. finds it difficult to find the best route all by himself so that he may be able to take all the tourists to the destination city in minimum number of trips. So, he seeks your help.

Input

The input will contain one or more test cases. The first line of each test case will contain two integers: N (N<= 100) and R representing respectively the number of cities and the number of road segments. Then R lines will follow
each containing three integers: C₁, C₂ andP. C₁ and C₂ are
the city numbers and P (P> 1) is the limit on the maximum number of passengers to be carried by the bus service between the two cities. City numbers are positive integers ranging from 1 to N. The (R + 1)-th line will contain three
integers: S, D andT representing respectively the starting city, the destination city and the number of tourists to be guided.

The input will end with two zeroes for N and R.

Output

For each test case in the input first output the scenario number. Then output the minimum number of trips required for this case on a separate line. Print a blank line after the output of each test case.

Sample Input

7 10

1 2 30

1 3 15

1 4 10

2 4 25

2 5 60

3 4 40

3 6 20

4 7 35

5 7 20

6 7 30

1 7 99

0 0

Sample Output

Scenario #1

Minimum Number of Trips = 5