modify code

Author: algorithmzuo

src/class095/Code06_FibonacciNimGame.java

@@ -21,39 +21,70 @@
 
 public class Code06_FibonacciNimGame {
 
-	public static long n, a, b, c, ans;
+	public static long MAXN = 1000000000000000L;
+
+	public static int MAXM = 101;
+
+	public static long[] f = new long[MAXM];
+
+	public static int size;
+
+	public static void build() {
+		f[0] = 1;
+		f[1] = 2;
+		size = 1;
+		while (f[size] <= MAXN) {
+			f[size + 1] = f[size] + f[size - 1];
+			size++;
+		}
+	}
 
 	public static void main(String[] args) throws IOException {
 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 		StreamTokenizer in = new StreamTokenizer(br);
 		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
-		in.nextToken();
-		n = (long) in.nval;
-		ans = -1;
+		build();
+		while (in.nextToken() != StreamTokenizer.TT_EOF) {
+			out.println(compute((long) in.nval));
+		}
+		out.flush();
+		out.close();
+		br.close();
+	}
+
+	public static long compute(long n) {
+		long ans = -1, find;
 		while (n != 1 && n != 2) {
-			a = 1;
-			b = 2;
-			c = 3;
-			while (c < n) {
-				a = b;
-				b = c;
-				c = a + b;
-			}
-			if (n == c) {
-				ans = c;
+			find = bs(n);
+			if (n == find) {
+				ans = find;
 				break;
 			} else {
-				n -= b;
+				n -= find;
 			}
 		}
 		if (ans != -1) {
-			out.println(ans);
+			return ans;
 		} else {
-			out.println(n);
+			return n;
 		}
-		out.flush();
-		out.close();
-		br.close();
+	}
+
+	public static long bs(long n) {
+		int l = 0;
+		int r = size;
+		int m;
+		long ans = -1;
+		while (l <= r) {
+			m = (l + r) / 2;
+			if (f[m] <= n) {
+				ans = f[m];
+				l = m + 1;
+			} else {
+				r = m - 1;
+			}
+		}
+		return ans;
 	}
 
 }

src/class095/Code07_WythoffGame.java

@@ -23,27 +23,32 @@ public class Code07_WythoffGame {
 
 	public static double split = (Math.sqrt(5.0) + 1.0) / 2.0;
 
-	public static int a, b, min, max, diff;
+	public static int a, b;
 
 	public static void main(String[] args) throws IOException {
 		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
 		StreamTokenizer in = new StreamTokenizer(br);
 		PrintWriter out = new PrintWriter(new OutputStreamWriter(System.out));
-		in.nextToken();
-		a = (int) in.nval;
-		in.nextToken();
-		b = (int) in.nval;
-		min = Math.min(a, b);
-		max = Math.max(a, b);
-		diff = max - min;
-		if (min == (int) (split * diff)) {
-			out.println(0);
-		} else {
-			out.println(1);
+		while (in.nextToken() != StreamTokenizer.TT_EOF) {
+			a = (int) in.nval;
+			in.nextToken();
+			b = (int) in.nval;
+			out.println(compute());
 		}
 		out.flush();
 		out.close();
 		br.close();
 	}
 
+	public static int compute() {
+		int min = Math.min(a, b);
+		int max = Math.max(a, b);
+		int diff = max - min;
+		if (min == (int) (split * diff)) {
+			return 0;
+		} else {
+			return 1;
+		}
+	}
+
 }