ProjectEuler 388 Distinct Lines - 拼圖
By Callum
at 2012-06-09T21:30
at 2012-06-09T21:30
Table of Contents
388. Distinct Lines
http://projecteuler.net/problem=388
想想所有的整數點 (a,b,c),且 0 ≦ a,b,c ≦ N
從原點 O(0,0,0) 開始,畫出所有通往其他整數點的直線
使 D(N) 為所有不同的直線的數量
已知 D(1000000) = 831909254469114121
請求出 D(10^10),將答案給出此數的前9位與後9位(共18位數)
--
http://projecteuler.net/problem=388
想想所有的整數點 (a,b,c),且 0 ≦ a,b,c ≦ N
從原點 O(0,0,0) 開始,畫出所有通往其他整數點的直線
使 D(N) 為所有不同的直線的數量
已知 D(1000000) = 831909254469114121
請求出 D(10^10),將答案給出此數的前9位與後9位(共18位數)
--
Tags:
拼圖
All Comments
By Rae
at 2012-06-12T23:26
at 2012-06-12T23:26
By Sarah
at 2012-06-17T15:52
at 2012-06-17T15:52
By Xanthe
at 2012-06-20T14:42
at 2012-06-20T14:42
By Enid
at 2012-06-24T03:01
at 2012-06-24T03:01
By Andrew
at 2012-06-24T21:36
at 2012-06-24T21:36
By Belly
at 2012-06-26T10:55
at 2012-06-26T10:55
Related Posts
兩題無窮
By Lauren
at 2012-06-08T00:38
at 2012-06-08T00:38
拼好的拼圖 放進框??
By Margaret
at 2012-06-07T13:39
at 2012-06-07T13:39
兩題無窮
By Delia
at 2012-06-07T12:15
at 2012-06-07T12:15
雷諾瓦
By Kama
at 2012-06-07T04:00
at 2012-06-07T04:00
兩題
By Carolina Franco
at 2012-06-06T19:30
at 2012-06-06T19:30