n!.jsp

网络随行秘书系统,access数据库

<%@page language="java" contentType="text/html;charset=GB2312"%>
<%@page import="java.util.*,java.util.Random,java.util.StringTokenizer ,java.text.*,oa.main.DealString,javax.swing.tree.DefaultMutableTreeNode,java.util.Hashtable"%>
<%
int[] n = {1,2,3,4,5,6,7,8,9,10,11,12,13,14,15,16};
boolean b = false;
int r = 0;
while(!b)
{
	//Math m = new Math();
	//java.util.Random i1 = new java.util.Random();
	int i2 = (int)(java.lang.Math.random()*9);
	int i1 = (int)(java.lang.Math.random()*9);
	int i21 = (int)(java.lang.Math.random()*9);
	int i11 = (int)(java.lang.Math.random()*9);
	int i22 = (int)(java.lang.Math.random()*9);
	int i12 = (int)(java.lang.Math.random()*9);
	int a = 0;
	a = n[i1];
	n[i1] = n[i2];
	n[i2] = a;
	a = n[i11];
	n[i11] = n[i21];
	n[i21] = a;
	a = n[i12];
	n[i12] = n[i22];
	n[i22] = a;
	r++;
	if(r%10000==0)
	{
		out.println("==="+r);
	}
	boolean c = false;
	for(int z1=0;z1<4;z1++)
	{		
		if(n[z1*4]+n[z1*4+1]+n[z1*4+2]+n[z1*4+3]!=34)
		{
			c = true;
			continue;
		}
		else if(n[z1]+n[4+z1]+n[8+z1]+n[12+z1]!=34)
		{
			c = true;
			continue;
		}
	}
	if(c)
		continue;
	if(n[0]+n[5]+n[10]+n[15]!=34)
	{
		continue;
	}
	else if(n[3]+n[6]+n[9]+n[12]!=34)
	{
		continue;
	}
	else
	{
		for(int i = 0;i<16;i++)
		{
			out.print("  "+n[i]);
			if((i+1)%4==0)
				out.println("");
		}
		b = true;
	}
}

%>