var t : int
var s : int
var h : int


put "Enter tine length:"
get t
put "Enter tine spacing:"
get s
put "Enter handle lenght:"
get h


for i1 : 1 .. t

    for i2 : 1 .. 3
        put "*" ..

        for i3 : 1 .. s
            put " " ..
        end for

    end for

    put ""

end for

if s = 0 then
else
    for i4 : 1 .. (5 + s * 2) - 2
        put "*" ..
    end for
    put ""
end if

for i5 : 1 .. h
    for i6 : 1 .. s + 1
        put " " ..
    end for
    put "*"
end for

%LARGER AMOUNTS OF PICTURES WILL REQUIRE MORE TIME FOR CALCULATION
var C : int
var z : int
var t2 : int
var d1 : int
var d2 : int

loop

    put "Enter number of pictures"
    get C
    t2 := 65000
    exit when C = 0
    for i1 : 1 .. C
        for i2 : 1 .. C
            z := i1 * i2

            if z = C then
                if (i1 + i2) * 2 <= t2 then
                    t2 := (i1 + i2) * 2
                    d1 := i1
                    d2 := i2

                    exit
                end if
            end if
        end for
    end for
    put "Minimum Perimeter is ", t2, " with the dimensions ", d1, " X ", d2
    put ""
end loop

var sum : int
var loca : int := 1

loop
    put "Enter sum of dice:"
    get sum

    if sum = 0 then
        put "You Quit!"
        quit
    end if
    if loca + sum > 100 then
    else
        loca := loca + sum
    end if
    if loca = 9 then
        loca := 34
    elsif loca = 40 then
        loca := 64
    elsif loca = 67 then
        loca := 86
    elsif loca = 99 then
        loca := 77
    elsif loca = 90 then
        loca := 48
    elsif loca = 54 then
        loca := 19
    end if



    put "You are now on square ", loca
    exit when loca = 100
end loop
put "You Win!"

var picnum : int
var x, y : real
var counter : int := 0
x := 10
y := 1
loop
    put "Enter number of pictures:"
    get picnum
    if picnum = 0 then
        exit
    end if
    counter := 0
    var total : array 1 .. picnum of real
    var integers : array 1 .. picnum of int
    var finished : array 1 .. picnum of real
    var perimeter : array 0 .. picnum of real
    var smallest : real := 999999
    for i : 1 .. picnum
        integers (i) := i
    end for
    for i : 1 .. picnum
        total (i) := picnum / i
        for k : 1 .. picnum
            if total (i) = integers (k) then
            counter := counter + 1
                finished (counter) := total (i)
            end if
        end for
    end for
    for l : 1 .. counter
        perimeter (l) := finished (l) * 2 + finished (counter - l+1) * 2
       if perimeter (l) < smallest then
             smallest := perimeter (l)
             x:= finished (l)
             y:= finished (counter - l+1)
        end if
    end for
    put "Minimum perimeter is ", smallest, " with dimensions ", y, " x ", x
    put " "
end loop

if roll >=2 and roll <=12 then

#include<fstream>
using namespace std;
int C,R,D;
int city[1000][1000];  //city[i][j] - max weight from i to j
int maxw=100000;     // max weight the truck can carry

int min(int a,int b){  //minimum
    if (a<b) return a; else return b;
}

void flow(int dest){   //part of max flow algorithm
     int flow[1000];    //flow[i] the maximum weight from city 0 to city i
     bool visited[1000];  //if visited
     int maxflow,maxloc,i,xyzzy;  //maxflow-highest unused path
                                         // maxflow - the index of highest unused path
     for (i=0;i<C;i++){    //initialize
         flow[i]=0;
         visited[i]=false;
     }
     flow[0]=maxw;


     while (true){
           maxflow=0;
           maxloc=-1;

         for (i=0;i<C;i++){  //find the highest unused path
             if (flow[i]>maxflow && !visited[i]){
                maxflow=flow[i];
                maxloc=i;
             }
         }
         if (maxloc==dest || maxloc==-1) break;  //found, quit
         visited[maxloc]=true;  //visited
         for (i=0;i<C;i++)     
             if (city[maxloc][i]>0){  //update all its neighbours
                xyzzy=min(maxflow,city[maxloc][i]);
                if (flow[i]<xyzzy)
                   flow[i]=xyzzy;
             }
     }

     maxw=min(maxw,flow[dest]);  //find the maximum weight for dest city

}

int main(){
    ifstream fin("truck4.in");
    ofstream fout("truck.out");
    fin>>C>>R>>D;
    int t1,t2,d,i,j;

    //Input
    for (i=0;i<R;i++) {
        fin>>t1>>t2>>d;
        city[--t1][--t2]=d;
        city[t2][t1]=d;
    }

    for (i=0;i<D;i++) {fin>>t1;flow(--t1);}  //check all dest cities
    fout<<maxw<<endl;  //output

    fin.close();
    fout.close();
    return 0;
}

#include<fstream>
using namespace std;
int C,R,D;
int city[1000][1000];
int dest[1000];
int maxw=100000;

int min(int a,int b){
    if (a<b) return a; else return b;
}

void flow(){   //part of max flow algorithm
     int flow[1000];
     bool visited[1000];
     int maxflow,maxloc,i,xyzzy;
     for (i=0;i<C;i++){
         flow[i]=0;
         visited[i]=false;
     }
     flow[0]=maxw;

     while (true){
           maxflow=0;
           maxloc=-1;

         for (i=0;i<C;i++){
             if (flow[i]>maxflow && !visited[i]){
                maxflow=flow[i];
                maxloc=i;
             }
         }
         if (maxloc==-1) break;
         visited[maxloc]=true;
         for (i=0;i<C;i++)
             if (city[maxloc][i]>0){
                xyzzy=min(maxflow,city[maxloc][i]);
                if (flow[i]<xyzzy)
                   flow[i]=xyzzy;
             }
     }
//     cout<<maxw<<endl;
     for (i=0;i<D;i++)
         maxw=min(maxw,flow[dest[i]]);

}

int main(){
    ifstream fin("truck.in");
    ofstream fout("truck.out");
    fin>>C>>R>>D;
    int t1,t2,d,i,j;

    //Input
    for (i=0;i<R;i++) {
        fin>>t1>>t2>>d;
        city[--t1][--t2]=d;
        city[t2][t1]=d;
    }
    for (i=0;i<D;i++) {fin>>dest[i];dest[i]--;}
    flow();
    fout<<maxw<<endl;
    cout<<maxw<<endl;
    fin.close();
    fout.close();
    return 0;
}