---

以下是我的程式碼

我先把所有結果都存在陣列裡，可是為什麼還不能達到0ms呢?!

可以麻煩0ms的大大們分享一下嗎??

#include<iostream>
using namespace std;

int main()
{
   char length[46][11]={"1","1","2","3","5","8","13","21","34","55","89","144",
                                    "233","377","610","987","1597","2584","4181","6765",
                                    "10946","17711","28657","46368","75025","121393","196418",
                                    "317811","514229","832040","1346269","2178309","3524578",
                                    "5702887","9227465","14930352","24157817","39088169","63245986",
                                    "102334155","165580141","267914296","433494437","701408733",

                                    "1134903170","1836311903"};

   int n;
 
   while(cin >> n)
      cout << length[n] << endl;
   return 0;
}

 

---

0 ms 其實只是運氣....無聊的話可以一直傳.....懶惰的話用程式幫你傳.....只是這樣你可能會被當作惡意攻擊伺服器.....其實題目AC就好~~時間和別人差沒多少其實還好~~只是差了很多那就可以專研如何讓速度更快？甚至請教那些人為什麼寫的那麼快。 

---

喔喔!!原來如此。

感謝^_^...

p.s:

你上面說的用程式來幫助你上傳是指??

方便的話可以透露嗎??或是計站內的mail告訴我