水木清华77
- 浏览: 36913 次
- 性别:
- 来自: 杭州
-
最新评论
文章列表
package com.shui.mu.yao.io.algorithm;
/**
*
* @author shuimuqinghua77 @date 2012-12-02
*
*/
public class Problem16 {
public static void main(String[] args) throws Exception {
byte[] seed=new byte[]{2};/**如果是{1,0,2,4}*/
seed=getDigit(seed);/**那么转化后得到{4,2,0,1}便于乘法*/
byte[] ...
package com.yao.Algorithms;
import java.util.HashMap;
import java.util.Map;
/**
*
* @author shuimuqinghua77 @date 2011-11-29
*
*/
public class Problem15 {
private static Map<String, Node> seed = new HashMap<String, Node>();
private static int SIZE = 20;
private static ...
package com.shui.mu.yao.io.algorithm;
public class Problem14 {
public static void main(String[] args) {
long starttime = System.currentTimeMillis();
int start = 640000;/**10：123456789往上翻20再翻40..->640000--1280000*/
int end = 1000000;
int[] seed = new int[end];
int max = 0;
...
package yao.taobao.jj;
public class Problem13 {
public static void main(String[] args) {
long start = System.currentTimeMillis();
String str = "37107287533902102798797998220837590246510135740250"
+ "46376937677490009712648124896970078050417018260538"
+ "7 ...
package com.yao.Algorithms;
import java.util.Arrays;
public class Problem13 {
public static void main(String[] args) {
String str = "37107287533902102798797998220837590246510135740250"
+ "46376937677490009712648124896970078050417018260538"
+ "7432498619 ...
jboss启用2个应用的话。有页面的应用的war包直接放在deploy目录下，另外一个应用（只提供HSF服务的）在jboss-service.xml指定路径。
2个应用的关键日志都打印在只提供HSF服务的那个应用指定的目录里面。
package com.shui.mu.yao.io.algorithm;
import java.util.ArrayList;
import java.util.List;
public class Problem12 {
public static void main(String[] args) {
long start = System.currentTimeMillis();
int x = 500;
int count = 1;
while ((x /= 2) != 0) {
count++;
}
List<I ...
package com.yao.Algorithms;
import java.util.ArrayList;
import java.util.List;
/**
*
* @author shuimuqinghua77 @date 2011-11-6
*
*/
/**
* In the 2020 grid below, four numbers along a diagonal line have been marked
* in red.
*
* 08 02 22 97 38 15 00 40 00 75 04 05 07 78 52 12 ...
package com.shui.mu.yao.io.algorithm;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
*
* @author shuimuqinghua77 @date 2011-11-3下午07:44:42
*/
/**
* The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17. Find the sum of all the
* primes below two mil ...
package com.shui.mu.yao.io.algorithm;
import java.util.Arrays;
/**
*
* @author shuimuqinghua77 @date 2011-11-3下午03:31:30
*/
/**
* A Pythagorean triplet is a set of three natural numbers, a b c, for which, a2
* + b2 = c2 For example, 32 + 42 = 9 + 16 = 25 = 52. There exists exactly o ...
package com.shui.mu.yao.io.algorithm;
/**
*
Find the greatest product of five consecutive digits in the 1000-digit number.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
85861560789112949495459501737958331952853208805511
1254069874715 ...
package com.shui.mu.yao.io.algorithm;
import java.util.ArrayList;
import java.util.Arrays;
import java.util.List;
/**
*
* @author shuimuqinghua77 @date 2011-11-3上午10:56:33
*
*/
/**
* By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see
* that the 6th prime ...
package com.yao.app.euler;
public class Euler2 {
public static void main(String[] args) {
int limit = 4000000;
int result = 0;
int sum = 0;
int n = 1;
while (result < limit) {
result = f(n);
if (result % 2 == 0)
sum += result;
n++;
}
System.out.println( ...
package com.yao.app;
public class Euler1 {
public static void main(String[] args) {
int len = 1000;
int[] arr = new int[len];
int sum = 0;
for (int i = 0; i < len; i++) {
if (i % 3 == 0) {
arr[i] = i;
sum += i;
continue;
} else if (i % 5 == 0) {
arr[i] ...
问题：提示错误：IDLE's subprocess didn't make connection.Either IDLE can;t
start a subprocess or personal firewall software is blocking
the connection
That usually means that your firewall is blocking IDLE, so
enable it in your firewall. If that doesnt work, do this to fix
it (with some disavantages): ...