Re: 以前的題目..(二)

[Favonia (sdfmskdlfksmdflkskdfmsl)]

第一題我找到一個超快的方法
程式碼也寫完了, 編譯也過了
不過有點長就是了, 給大家看一些就好

#include <iostream>

using namespace std;

char A[200][101][80] =

{{"1"}, {"1", "2"}, {"1", "3"}, {"1", "4", "6"}, {"1", "5", "10"}, {"1", "6",
    "15", "20"}, {"1", "7", "21", "35"}, {"1", "8", "28", "56", "70"}, {"1",
    "9", "36", "84", "126"}, {"1", "10", "45", "120", "210", "252"}, {"1",
    "11", "55", "165", "330", "462"}, {"1", "12", "66", "220", "495", "792",

(略...)

    "70599911978029526674935359171112323931480758582326335158400",
    "77218653725969794800710549093404104300057079699419429079500",
    "82791133891761429477050485625917802548514807100408460044000",
    "87015171335218645266695918566015649617316582972878279434000",
    "89651994709013149668717007007410063242083752153874590932000",
    "90548514656103281165404177077484163874504589675413336841320"}};

int main () {
        while (cin) {
                int m,n;
                cin >> n >> m;
                if (m>n/2) m=n-m;
                cout << A[n-1][m] << endl;
        }
}

----

速度真是快得驚人呢！！！

--
※ 發信站: 批踢踢實業坊(ptt.cc) 
◆ From: 203.64.26.1
→ biconnect:你有本領就把略的地方貼完呀@@"~~真服了你
→ Favonia:e給你一份好了
→ biconnect:不用了謝謝...@@"~~
→ ZenKou:ha......give you a "m"
→ Favonia:我本來要寄，結果到2500行就掛掉了
→ biconnect:你不要真的寄給我啦..!!!!!
→ timrau:這樣code應該會太大吧？
→ Favonia:中區的能力競賽的競賽規則不知為何...
→ Favonia:Table[StringJoin["\"",ToString[n!/m!/(n
→ Favonia:m)!],"\""],{n,1,200},{m,0,n/2}]
→ babysilkwarm:了不起..
→ dh3014:很多比賽也是有規定compile time的…