<?xml version="1.0" encoding="utf-8" ?><rss version="2.0"><channel><title><![CDATA[独立之人格，自由之思想]]></title><description><![CDATA[]]></description><link>https://blog.youkuaiyun.com/iteye_14843</link><language>zh-cn</language><generator>https://blog.youkuaiyun.com/</generator><copyright><![CDATA[Copyright &copy; iteye_14843]]></copyright><item><title><![CDATA[用clojure解决euler problem 12]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82370419</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82370419</guid><author>iteye_14843</author><pubDate>Fri, 13 Jul 2012 21:00:00 +0800</pubDate><description><![CDATA[问题描述：

The sequence of triangle numbers is generated by adding the natural numbers. So the 7thtriangle number would be 1 + 2 + 3 + 4 + 5 + 6 + 7 = 28. The first ten terms would be:

1, 3, 6, 10, 1...]]></description><category></category></item><item><title><![CDATA[用clojure解决 euler problem 11]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82369454</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82369454</guid><author>iteye_14843</author><pubDate>Thu, 12 Jul 2012 10:16:00 +0800</pubDate><description><![CDATA[问题描述：

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 50 77 91 08
49 49 99 40 17 81 18 57 60 87 17 40 98 43 6...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 10]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82368104</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82368104</guid><author>iteye_14843</author><pubDate>Mon, 09 Jul 2012 21:01:00 +0800</pubDate><description><![CDATA[问题描述：

The sum of the primes below 10 is 2 + 3 + 5 + 7 = 17.
Find the sum of all the primes below two million.
解决方案：

(ns euler-problem-10.core
  (:use [clojure.contrib.math]))

(defn prime?
  [n...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 9]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367565</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367565</guid><author>iteye_14843</author><pubDate>Sun, 08 Jul 2012 22:25:00 +0800</pubDate><description><![CDATA[问题描述：

A Pythagorean triplet is a set of three natural numbers,abc,
 for which,

a2+b2=c2

For example, 32+ 42= 9 + 16 = 25 = 52.
There exists exactly one Pythagorean triplet for whicha+b+c=
 ...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 8]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367542</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367542</guid><author>iteye_14843</author><pubDate>Sun, 08 Jul 2012 21:06:00 +0800</pubDate><description><![CDATA[问题描述：

Find the greatest product of five consecutive digits in the 1000-digit number.
73167176531330624919225119674426574742355349194934
96983520312774506326239578318016984801869478851843
8586156...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 7]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367526</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367526</guid><author>iteye_14843</author><pubDate>Sun, 08 Jul 2012 20:39:00 +0800</pubDate><description><![CDATA[问题描述：

By listing the first six prime numbers: 2, 3, 5, 7, 11, and 13, we can see that the 6th prime is 13.
What is the 10 001st prime number?
解决方案：

(ns euler-problem-7.core
  (:use [clojure.con...]]></description><category></category></item><item><title><![CDATA[用clojure解决 euler problem 6]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367406</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367406</guid><author>iteye_14843</author><pubDate>Sun, 08 Jul 2012 13:37:00 +0800</pubDate><description><![CDATA[问题描述：

The sum of the squares of the first ten natural numbers is,

12+ 22+ ... + 102= 385
The square of the sum of the first ten natural numbers is,

(1 + 2 + ... + 10)2= 552= 3025
Hence the ...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 5]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367349</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367349</guid><author>iteye_14843</author><pubDate>Sun, 08 Jul 2012 10:43:00 +0800</pubDate><description><![CDATA[问题描述：

2520 is the smallest number that can be divided by each of the numbers from 1 to 10 without any remainder.
What is the smallest positive number that isevenly
 divisibleby all of the numbers...]]></description><category></category></item><item><title><![CDATA[用clojure解决 euler problem 4]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82367211</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82367211</guid><author>iteye_14843</author><pubDate>Sat, 07 Jul 2012 21:12:00 +0800</pubDate><description><![CDATA[
问题描述：

A palindromic number reads the same both ways. The largest palindrome made from the product of two 2-digit numbers is
9009 = 9199.
Find the largest palindrome made from the product of two...]]></description><category></category></item><item><title><![CDATA[用clojure解决euler problem 3]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82366941</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82366941</guid><author>iteye_14843</author><pubDate>Fri, 06 Jul 2012 20:47:00 +0800</pubDate><description><![CDATA[问题描述：

The prime factors of 13195 are 5, 7, 13 and 29.
What is the largest prime factor of the number 600851475143 ?

(ns euler-problem-3.core)
(defn largest-prime-factor
  [number]
  (loop
      ...]]></description><category></category></item><item><title><![CDATA[用clojure解决 euler problem 2]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82366727</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82366727</guid><author>iteye_14843</author><pubDate>Fri, 06 Jul 2012 12:47:00 +0800</pubDate><description><![CDATA[问题描述:

Each new term in the Fibonacci sequence is generated by adding the previous two terms. By starting with 1 and 2, the first 10 terms will be:

1, 2, 3, 5, 8, 13, 21, 34, 55, 89, ...
By cons...]]></description><category></category></item><item><title><![CDATA[用clojure解决 euler problem 1]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82365950</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82365950</guid><author>iteye_14843</author><pubDate>Thu, 05 Jul 2012 22:10:00 +0800</pubDate><description><![CDATA[问题描述：
If we list all the natural numbers below 10 that are multiples of 3 or 5, we get 3, 5, 6 and 9. The sum of these multiples is 23.
Find the sum of all the multiples of 3 or 5 below 1000.
解决方案1...]]></description><category></category></item><item><title><![CDATA[sicp练习 1.22]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82069667</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82069667</guid><author>iteye_14843</author><pubDate>Fri, 27 May 2011 22:33:51 +0800</pubDate><description><![CDATA[

(define (square x)
  (* x x))

(define (smallest-divisor n)
  (find-divisor n 2))

(define (find-divisor n test-divisor)
  (cond ((&amp;gt; (square test-divisor) n) n)
        ((divides? test-d...]]></description><category></category></item><item><title><![CDATA[sicp练习1.21用smallest-divisor寻找最小因子]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82067718</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82067718</guid><author>iteye_14843</author><pubDate>Sun, 22 May 2011 14:36:43 +0800</pubDate><description><![CDATA[

(define (square x)
  (* x x))

(define (smallest-divisor n)
  (find-divisor n 2))

(define (find-divisor n test-divisor)
  (cond ((&amp;gt; (square test-divisor) n) n)
        ((divides? test-d...]]></description><category></category></item><item><title><![CDATA[sicp练习1.20 gcd过程 应用序 正则序 remainder次数 ]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82065681</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82065681</guid><author>iteye_14843</author><pubDate>Tue, 17 May 2011 09:41:04 +0800</pubDate><description><![CDATA[



(define (gcd a b remainder-count)
  (if(= b 0)
     (begin (display &quot;\nremainder count: &quot;)
            (display remainder-count)
            (display &quot;\n gcd result:&quot;)
            (display ...]]></description><category></category></item><item><title><![CDATA[sicp练习1.18 基于加法、加倍和折半运算求两个整数之乘积]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82064774</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82064774</guid><author>iteye_14843</author><pubDate>Fri, 13 May 2011 23:32:27 +0800</pubDate><description><![CDATA[

;double的功能是2*n
(define (double n)
  (+ n n))

(double 5)

;havle-iter函数的功能是通过迭代获得n的一半的值,guess是初始猜测值
(define (havle-iter guess n)
  (cond ((not (integer? n)) (display &quot;error: 原因havle函数的参数是整数...]]></description><category></category></item><item><title><![CDATA[sicp练习1.17 只有加减法 实现快速求幂]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82064737</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82064737</guid><author>iteye_14843</author><pubDate>Fri, 13 May 2011 20:37:52 +0800</pubDate><description><![CDATA[

;double的功能是2*n
(define (double n)
  (+ n n))

(double 5)

;*函数的功能是a乘以b
(define (* a b)
  (if (= b 0)
      0
      (+ a (* a (- b 1)))))

(* 3 4)

;havle-iter函数的功能是通过迭代获得n的一半的值,guess是...]]></description><category></category></item><item><title><![CDATA[快速求幂 sicp练习1.16]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82064576</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82064576</guid><author>iteye_14843</author><pubDate>Fri, 13 May 2011 13:02:14 +0800</pubDate><description><![CDATA[

(define (even? n)
  (= (remainder n 2) 0))

(define (fast-expt-iter result b n)
  (cond ((= n 0) 1)
        ((= n 1) (* result b))
        ((even? n) (fast-expt-iter result (* b b) (/ n 2)))...]]></description><category></category></item><item><title><![CDATA[sicp练习1.12 帕斯卡三角（杨辉三角）]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/82064468</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/82064468</guid><author>iteye_14843</author><pubDate>Fri, 13 May 2011 08:21:54 +0800</pubDate><description><![CDATA[	杨辉三角以前在学习c语言时候，用循环很容易实现。由于刚刚接触函数式语言，递归和迭代方式实现循环还没深入我心。下意思的想用链表来实现，但发现自己对scheme的链表操作太不熟悉，总会出现这样那样子的无法自我解释的问题。最后参考了@dennis_zane的pascal实现，dennis_zane是把杨辉三角左对齐，然后根据坐标之间的关系实现：(pascal x y) ，其中x，y为坐标，(pasca...]]></description><category></category></item><item><title><![CDATA[java动态代理机制原理]]></title><link>https://blog.youkuaiyun.com/iteye_14843/article/details/81770533</link><guid>https://blog.youkuaiyun.com/iteye_14843/article/details/81770533</guid><author>iteye_14843</author><pubDate>Tue, 13 Oct 2009 11:37:00 +0800</pubDate><description><![CDATA[Proxy的public static Object newProxyInstance(ClassLoader loader,Class&amp;lt;?&amp;gt;[] interfaces,InvocationHandler h)，
首先通过getProxyClass 创建一个新的Class 对象，//（Class cl = getProxyClass(loader, interfaces);）
ge...]]></description><category></category></item></channel></rss>