求助

wangyuxuan0515 @ 2022-11-11 17:41:04

#include <iostream>
#include <algorithm>
using namespace std;
long long c(long long n)
{
    if(n<=1) return 1;
    return n*c(n-1);
}
int main()
{
    long long n;
    cin>>n;
    long long a=0;
    for(long long i=1;i<=n;i++){
        a+=c(i);}
    cout<<a;
}

by VitrelosTia @ 2022-11-11 17:42:13

@wangyuxuan0515

如果希望通过本题，请学习高精度的知识。

by wangyuxuan0515 @ 2022-11-11 17:48:36

哦~

by cute_overmind @ 2022-11-11 18:24:13

@VT_SODC3DC3BSLF 不一定，可以像我一样

by cute_overmind @ 2022-11-11 18:25:05

@wangyuxuan0515 可以打表

#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];
}

by wangyuxuan0515 @ 2022-11-12 08:32:26

@Pikacu 感谢大佬，已AC

by hyc12528 @ 2022-11-12 14:01:20

@wangyuxuan0515 你还是真的学学高精吧

by hyc12528 @ 2022-11-12 14:02:33

@wangyuxuan0515 手动打表过题都没用的

by hyc12528 @ 2022-11-12 14:04:06

@wangyuxuan0515 还有这题不是高精你这也很慢

by hyc12528 @ 2022-11-12 14:06:32

@wangyuxuan0515 你爱打表就试试DIVCNT1 - Counting Divisors