求助 只对了一般半 求大佬看看哪有问题

P1009 [NOIP1998 普及组] 阶乘之和

oooczk @ 2022-09-15 19:21:22

#define  _CRT_SECURE_NO_WARNINGS
#include<stdio.h>
int chengjie(int x)
{
    int i;
    int j = 1;
    for (i = 1; i <= x; i++)
    {
        j *= i;
    }
    return j;
 }

int main()
{
    int S=0;
    int n;

    scanf("%d", &n);
    for (; n >= 1; n--)
    {
        S+=chengjie(n);
    }
    printf("%d\n", S);
    return 0;
}

by _SkyDream_ @ 2022-09-15 19:22:45

读题...高精


by _SkyDream_ @ 2022-09-15 19:23:14

【其他说明】

注,《深入浅出基础篇》中使用本题作为例题,但是其数据范围只有 n \le 20n≤20,使用书中的代码无法通过本题。

如果希望通过本题,请继续学习第八章高精度的知识。


by _SkyDream_ @ 2022-09-15 19:23:54

你至少得开个ull才能多模两份吧


by Ricky2008 @ 2022-09-15 20:03:25

实在不行就这样吧

#include<bits/stdc++.h>
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];
}

|