x1001000

創社初衷
介紹新奇/有趣/實用的
網路應用/知識/技術
(進而對網路程式開發產生興趣)

9/12

• 技客? 駭客? 馬克小子的 wget ...
• Coding on koding.com
• Linux 才是王道

x1001000

x1001000

x1001000

x1001000

x1001000

MAX = 1001000
is_prime = [False,False]+[True]*(MAX-1)
primes = []
now = 2
while True:
    primes.append(now)
    for i in range(now*2, MAX+1, now):
        is_prime[i] = False
    now += 1
    try:

x1001000

MAX = 65535
is_prime = [False,False]+[True]*(MAX-1)
primes = []
now = 2
while True:
    primes.append(now)
    for i in range(now*2, MAX+1, now):
        is_prime[i] = False
    now += 1
    try:

x1001000

MAX = 1000000
is_prime = [False,False]+[True]*(MAX-1)
primes = []
now = 2
while True:
    primes.append(now)
    for i in range(now*2, MAX+1, now):
        is_prime[i] = False
    now += 1
    try:

x1001000

MAX = 1000000
is_prime = [False,False]+[True]*(MAX-1)
primes = []
now = 2
while True:
    primes.append(now)
    for i in range(now*2, MAX+1, now):
        is_prime[i] = False
    now += 1
    try:

x1001000

Fib = [0, 1] + [0 for i in range(29)]         #存到第30項
def fib(n):                                   #因為第31項超過1000000
    if n > 1:                                 #預先算看看可以得知
        x = fib(n-1) if Fib[n-1]==0 else Fib[n-1]
        y = fib(n-2) if Fib[n-2]==0 else Fib[n-2]
        Fib[n] = x+y
    return Fib[n]
fib(30)                             #算fib(30)使Fib[2]到Fib[30]由預設的0更新為算出來的費氏數
t = int(input())
for i in range(t):                            #for迴圈，令i從0到t-1，縮排執行t次