static void run(){int limit = 1000000;int count =0;int M = 1;for(M = 1;;M++){
//            当 a<= b <= c 最小路径就是 (a+b)*(a+b) + c*c 开根号for(int a = 1;a<= M ;a++){for(int b =a ;b<= M;b++){int c = M ;int path = (a+b)*(a+b) + c*c;int tmp = (int)Math.sqrt(path);if(tmp*tmp == path){count ++;}}}if(count> limit){System.out.println(M);break;}}}

package Level3;public class PE086{static void run(){int limit = 1000000;int count =0;int M = 1;for(M = 1;;M++){
//            当 a<= b <= c 最小路径就是 (a+b)*(a+b) + c*c 开根号for(int a = 1;a<= M ;a++){for(int b =a ;b<= M;b++){int c = M ;int path = (a+b)*(a+b) + c*c;int tmp = (int)Math.sqrt(path);if(tmp*tmp == path){count ++;}}}if(count> limit){System.out.println(M);break;}}}static void run2() {int limit = 1000000;int c = 1;int count = 0;while(count < limit){c++;for(int ab = 2;ab<= 2*c;ab++){int path = ab*ab + c*c;int tmp = (int)Math.sqrt(path);if(tmp*tmp== path){count += (ab>=c)?1+(c-(ab+1)/2):ab/2;}}
//            if(c ==100)
//                System.out.println(count);
        }System.out.println(c);}public static void main(String[] args){long t0 = System.currentTimeMillis();run2();long t1 = System.currentTimeMillis();long t = t1 - t0;System.out.println("running time="+t/1000+"s"+t%1000+"ms");}
}

1818
running time=0s39ms

# coding=gbk
import time as time t0 = time.time()
print 3**2
print int(8**0.5)
def run():limit = 1000000count = 0M = 1while count < limit:for a in range(1,M+1):for b in range(a,M+1):c = M path = (a+b)**2 + c**2tmp = int((path)**0.5)if tmp**2 == path:count +=1M += 1print M-1 # 1818
# running time= 1062.27400017 s
run()
t1 = time.time()
print "running time=",(t1-t0),"s"