Reformat all code.

Major change is indentation is two spaces only now. This is more
industry standard, and helps keeping the files small, in case that
matters :p

Author: wkoder

.idea/codeStyles/codeStyleConfig.xml

@@ -1,86 +1,86 @@
-import java.util.*;
+import java.util.Arrays;
 
 public class BIT {
-	
-	int N;
-	int[] tree;
-	
-	public BIT(int size) {
-		N = 1;
-		while (N < size)
-			N <<= 1;
-		tree = new int[N+1];
-	}
-	
-	void update(int idx, int val){
-		while (idx <= N) {
-			tree[idx] += val;
-			idx += (idx & -idx);
-		}
-	}
-	
-	int getData(int idx) {
-		int sum = tree[idx];
-		if (idx > 0) {
-			int z = idx - (idx & -idx);
-			idx--;
-			while (idx != z) {
-				sum -= tree[idx]; 
-				idx -= (idx & -idx);
-			}
-		}
-		return sum;
-	}
-	
-	void scale(int c) {
-		for (int i = 1 ; i <= N ; i++)
-			tree[i] = tree[i] / c;
-	}
-	
-	int find(int cumFre) {
-		int idx = 0, bitMask = N, tIdx;
-		while ((bitMask != 0) && (idx < N)) {
-			tIdx = idx + bitMask;
-			if (cumFre == tree[tIdx])
-				return tIdx;
-			else if (cumFre > tree[tIdx]){ 
-				idx = tIdx; 
-				cumFre -= tree[tIdx]; 
-			}
-			bitMask >>= 1;
-		}
-		if (cumFre != 0)
-			return -1;
-		else
-			return idx;
-	}
-	
-	int findGreatest(int cumFre) {
-		int idx = 0, bitMask = N, tIdx;
-		while ((bitMask != 0) && (idx < N)){
-			tIdx = idx + bitMask;
-			if (cumFre >= tree[tIdx]){ 
-				idx = tIdx;
-				cumFre -= tree[tIdx];
-			}
-			bitMask >>= 1;
-		}
-		if (cumFre != 0)
-			return -1;
-		else
-			return idx;
-	}
-	
-	int get(int idx) {
-		int sum = 0;
-		while (idx > 0){
-			sum += tree[idx];
-			idx -= (idx & -idx);
-		}
-		return sum;
-	}
-	
-	void clear() {
-		Arrays.fill(tree, 0);
-	}
+
+  int N;
+  int[] tree;
+
+  public BIT(int size) {
+    N = 1;
+    while (N < size)
+      N <<= 1;
+    tree = new int[N + 1];
+  }
+
+  void update(int idx, int val) {
+    while (idx <= N) {
+      tree[idx] += val;
+      idx += (idx & -idx);
+    }
+  }
+
+  int getData(int idx) {
+    int sum = tree[idx];
+    if (idx > 0) {
+      int z = idx - (idx & -idx);
+      idx--;
+      while (idx != z) {
+        sum -= tree[idx];
+        idx -= (idx & -idx);
+      }
+    }
+    return sum;
+  }
+
+  void scale(int c) {
+    for (int i = 1; i <= N; i++)
+      tree[i] = tree[i] / c;
+  }
+
+  int find(int cumFre) {
+    int idx = 0, bitMask = N, tIdx;
+    while ((bitMask != 0) && (idx < N)) {
+      tIdx = idx + bitMask;
+      if (cumFre == tree[tIdx])
+        return tIdx;
+      else if (cumFre > tree[tIdx]) {
+        idx = tIdx;
+        cumFre -= tree[tIdx];
+      }
+      bitMask >>= 1;
+    }
+    if (cumFre != 0)
+      return -1;
+    else
+      return idx;
+  }
+
+  int findGreatest(int cumFre) {
+    int idx = 0, bitMask = N, tIdx;
+    while ((bitMask != 0) && (idx < N)) {
+      tIdx = idx + bitMask;
+      if (cumFre >= tree[tIdx]) {
+        idx = tIdx;
+        cumFre -= tree[tIdx];
+      }
+      bitMask >>= 1;
+    }
+    if (cumFre != 0)
+      return -1;
+    else
+      return idx;
+  }
+
+  int get(int idx) {
+    int sum = 0;
+    while (idx > 0) {
+      sum += tree[idx];
+      idx -= (idx & -idx);
+    }
+    return sum;
+  }
+
+  void clear() {
+    Arrays.fill(tree, 0);
+  }
 }

lib/BIT.java

@@ -1,32 +1,32 @@
-import java.util.*;
+import java.util.Arrays;
 
 public class BIT_2D {
-	
-	int maxX, maxY;
-	int[][] tree;
-	
-	public BIT_2D(int sizeX, int sizeY) {
-		maxX = 1;
-		while ((maxX <<= 1) < sizeX) ;
-		maxY = 1;
-		while ((maxY <<= 1) < sizeY) ;
-		tree = new int[maxX+1][maxY+1];
-	}
-	
-	void update(int x, int y, int val) {
-		int y1;
-		while (x <= maxX) {
-			y1 = y;
-			while (y1 <= maxY) {
-				tree[x][y1] += val;
-				y1 += (y1 & -y1);
-			}
-			x += (x & -x);
-		}
-	}
-	
-	void clear() {
-		for (int i = 0; i < maxX; i++)
-			Arrays.fill(tree[i], 0);
-	}
+
+  int maxX, maxY;
+  int[][] tree;
+
+  public BIT_2D(int sizeX, int sizeY) {
+    maxX = 1;
+    while ((maxX <<= 1) < sizeX) ;
+    maxY = 1;
+    while ((maxY <<= 1) < sizeY) ;
+    tree = new int[maxX + 1][maxY + 1];
+  }
+
+  void update(int x, int y, int val) {
+    int y1;
+    while (x <= maxX) {
+      y1 = y;
+      while (y1 <= maxY) {
+        tree[x][y1] += val;
+        y1 += (y1 & -y1);
+      }
+      x += (x & -x);
+    }
+  }
+
+  void clear() {
+    for (int i = 0; i < maxX; i++)
+      Arrays.fill(tree[i], 0);
+  }
 }