来源: 互联网  发布时间: 2014-02-18

厕所拣到手机应该怎么办
下午某个同事手机丢在厕所在Q群里面被挂失误认领，有人打趣：“xx你的手机没开录像模式吧？”，突然醒悟到有没有可能出现这种极为猥琐的偷。拍手段，把开启录像功能的手机“丢失”在厕所中，然后被好心人领回，太邪恶了。你也许认为录像模式很容易辨认，但是手机上编个录像功能的程序，不显示录像界面，甚至伪装一个正常的界面并不困难，所以如果你在厕所不太合适的位置拣到一部手机，就要多加警惕了。

    

    来源: 互联网  发布时间: 2014-02-18

BSP 二叉树再次讨论

 

 节点：

int plane

 

 

Plane index.

int[2] children Children indices. Negative numbers are leaf indices: -(leaf+1). int[3] mins Integer bounding box min coord. int[3] maxs Integer bounding box max coord.

 

 叶子：

int cluster Visdata cluster index. int area Areaportal area. int[3] mins Integer bounding box min coord. int[3] maxs Integer bounding box max coord. int leafface First leafface for leaf. int n_leaffaces Number of leaffaces for leaf. int leafbrush First leafbrush for leaf. int n_leafbrushes Number of leafbrushes for leaf.

更多信息，参考http://www.mralligator.com/q3/#Nodes

http://www.mralligator.com/q3/

C:\Documents and Settings\Administrator\My Documents\Downloads\RenderingQuake3Maps.mht

    

    来源: 互联网  发布时间: 2014-02-18

杨辉三角的例子

package test.numble;

//杨辉三角
import java.util.Scanner;

class TestYangHuiSanJiao {
	public static void main(String[] args) {

		Scanner s = new Scanner(System.in);
		System.out.print("需要输出的行数:\n");
		int line = s.nextInt();
		for (int i = 1; i <= line; i++){// 行
		
			// 控制行首的空格数量
			for (int e = 1; e <= (line - i); e++) {
				System.out.print("  ");
			}
			for (int j = 1; j <= i; j++){// 每行的各个数值
			
				int num = 1;
				for (int k = 2; k <= j; k++) {
					num = num * (i - k + 1) / (k - 1);
				}
				// 控制数值之间空格数量 保持队形
				if (num / 1000 >= 1){
					System.out.print(num + " ");
				}else if (num / 100 >= 1){
					System.out.print(num + "  ");
				}else if (num / 10 >= 1){
					System.out.print(num + "   ");
				}else{
					System.out.print(num + "    ");
				}
			}
			System.out.println();
		}
	}
}