zoukankan      html  css  js  c++  java
  • 洛谷p1009

    骗分教程,大佬误入

    题目描述

    用高精度计算出S=1!+2!+3!+…+n! (n≤50)

    其中“!”表示阶乘,例如:5!=5×4×3×2×1。

    输入格式

    一个正整数N

    输出格式

    一个正整数S,表示计算结果。

    输入输出样例

    输入 #1
    3
    
    输出 #1
    9
    这道题是很久之前做的,现在用来水博客。
    其实吧,这道题本意是用高精,一开始我没有注意到,总是过不了,后来看了题解才知道没用高精。
    这是我的代码。
    #include<iostream>
    using namespace std;
    string a[60]={"0","1","3","9","33","153","873","5913","46233","409113","4037913","43954713","522956313","6749977113","93928268313","1401602636313","22324392524313","378011820620313","6780385526348313","128425485935180313","2561327494111820313","53652269665821260313","1177652997443428940313","27029669736328405580313","647478071469567844940313","16158688114800553828940313","419450149241406189412940313","11308319599659758350180940313","316196664211373618851684940313","9157958657951075573395300940313","274410818470142134209703780940313","8497249472648064951935266660940313","271628086406341595119153278820940313","8954945705218228090637347680100940313","304187744744822368938255957323620940313","10637335711130967298604907294846820940313","382630662501032184766604355445682020940313","14146383753727377231082583937026584420940313","537169001220328488991089808037100875620940313","20935051082417771847631371547939998232420940313","836850334330315506193242641144055892504420940313","34289376947494122614363304694584807557656420940313","1439295494700374021157505910939096377494040420940313","61854558558074209658512637979453093884758552420940313","2720126133346522977702138448994068984204397080420940313","122342346998826717539665299944651784048588130840420940313","5624964506810915667389970728744906677010239883800420940313","264248206017979096310354325882356886646207872272920420940313","12678163798554051767172643373255731925167694226950680420940313","620960027832821612639424806694551108812720525606160920420940313","31035053229546199656252032972759319953190362094566672920420940313"};
    int main()
    {
        int n;
        cin>>n;
        cout<<a[n];
    }

    不要惊讶,我只是那时不会高精,就用了最暴力的玩法(滑稽),如果考试不会可以这样骗分。

    接下来是正经代码。

    算了还是不写了实在是太恶心了(滑稽)

    如果想看高精的写一下评论,我看情况再修改,谢谢(只是懒)

  • 相关阅读:
    UVa 1354 天平难题 (枚举二叉树)
    广西邀请赛总结
    UVa 12118 检查员的难题 (dfs判连通, 构造欧拉通路)
    UVA
    Uva 127 "Accordian" Patience (模拟)
    UVA 10539 Almost Prime Numbers( 素数因子)
    HDU 1272 小希的迷宫(并查集)
    HDU 1213 How Many Tables (并查集)
    POJ 2236 Wireless Network(并查集)
    HDU 1233 还是畅通工程 ( Kruskal或Prim)
  • 原文地址:https://www.cnblogs.com/lizhengde/p/12931959.html
Copyright © 2011-2022 走看看