OJ Board

The value you looking for is called "Minimum cut". Search google for these word "minimum cut flow" . There's heap of !
Cheers

Hi, good to hear about geometry problems too. but for the first prob, that solution doesn't guarante the minimum number of circles
Cheers

oh my godness , thanks !

This is not the problem of the algorithm but computation, all you have to do is to do calculating with big numbers ( up to 200 digits).
Find the lastgest Fibo number f smaller than n and do the same problem with n-f.
Good luck

Here is what I got the error RESTRICTED FUNCTION, can anyone tell me the reason?

[cpp]
#include <iostream.h>
#include <stdlib.h>
#include <vector>
#include <string.h>

enum{
infinity = 100000
};

int m,n;
int a[101][101];
int start, end, n_passenger;

int min(int a, int b){
return (a<b)?a:b ...

Thanks, I'm a newbie to problems here, so never thought it would be that tricky
Thanks alot

In the sample input, each trip can take upto 25 passengers, to it needs only 4 trips to take 99 to the destination, but the sample answer is 5, am I misunderstanding?
Thanks