nyOJ基礎題：另一種階乘問題 如1!!+2!!+3!!

標籤：blog   ar   io   sp   for   on   div   問題   log   

#include<stdio.h>int jCheng[21];//as you likevoid generateSpecialJCheng(int input){    //!!階乘存入第k個位置    for(int k = 1; k <= input; ++k){        int summary = 1;        for(int s = 1; s <= k; s += 2){            summary *= s;        }        jCheng[k] = summary;    }}int main(){    generateSpecialJCheng(20);    int loop_rounds;    while(~scanf("%d", &loop_rounds)){        while(loop_rounds--){            int t;            unsigned long long total = 0;            scanf("%d", &t);            for(int i = 1; i <= t; i++){                total += jCheng[i];            }            printf("%I64u\n", total);        }    }    return 0;}/*範例輸入235範例輸出523*/

 

nyOJ基礎題：另一種階乘問題 如1!!+2!!+3!!