Uva-1646-edge Case (law)

Test instructions: N (3 <= n <= 10000) nodes form a circle to find the number of matches (that is, a set of edges without a common point).

Find the law for the nature of Fibonacci, because the number is too large to use the large number of java.

ImportJava.math.BigInteger;ImportJava.util.Scanner; Public classmain{ Public Static intMAXN = 10000 + 10;  Public StaticBigInteger []c =NewBIGINTEGER[MAXN];  Public Static voidinit () {c[3] =NewBigInteger ("4"); c[4] =NewBigInteger ("7");  for(inti = 5; i < MAXN; ++i) c[i]= C[i-1].add (c[i-2]); }     Public Static voidMain (String []args) {init (); Scanner SC=NewScanner (system.in);  while(Sc.hasnextint ()) {intn =Sc.nextint ();        System.out.println (C[n]); }    }}

Uva-1646-edge Case (law)