TLE 94求调

[阚宇阳 (䜗.)]

#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>
#include <charconv>
#include <filesystem>
using namespace std;
void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

const int MAXN = 35660;
int a[MAXN];

void mul(int num[], int x)
{
    int c = 0;
    for (int i = 0; i < MAXN; ++i)
    {
        int temp = num[i] * x + c;
        num[i] = temp % 10;
        c = temp / 10;
    }
}

void print()
{
    int i;
    for (i = MAXN - 1; i >= 0; --i)
    {
        if (a[i] != 0)
        {
            break;
        }
    }
    for (; i >= 0; --i)
    {
        cout << a[i];
    }
    cout << endl;
}

int main()
{
    fast();
    int n;
    cin >> n;

    memset(a, 0, sizeof(a));
    a[0] = 1;

    for (int i = 1; i <= n; ++i)
    {
        mul(a, i);
    }

    print();

    return 0;
}

[阚宇阳 (䜗.)]

@栗子酱 @Erin @Syxqwq

[杨思越 (灵珠敖丙)]

把memset去掉,没用

[杨思越 (灵珠敖丙)]

把i=1改成i=2

[杨思越 (灵珠敖丙)]

疯狂剪枝就对了

[肖恩]

%%%include大神

[杨思越 (灵珠敖丙)]

点赞姐在线!!!

[余素因 (魔丸哪吒)]

呃，哥你要不考虑一下万能头？

[肖恩]

诶不是这样写能被卡掉？

[杨思越 (灵珠敖丙)]

大概是最大的数据炸了

[阚宇阳 (䜗.)]

#include <cstdio>
#include <cstring>
#include <cassert>
#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdalign>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cuchar>
#include <cwchar>
#include <cwctype>
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <vector>
#include <atomic>
#include <chrono>
#include <codecvt>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
#include <shared_mutex>
#include <charconv>
#include <filesystem>
using namespace std;
void fast()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

const int MAXN = 35660;
int a[MAXN];

void mul(int x)
{
    int c = 0;
    for (int i = 0; i < MAXN; ++i)
    {
        int temp = a[i] * x + c;
        a[i] = temp % 10;
        c = temp / 10;
    }
}

void print()
{
    int i;
    for (i = MAXN - 1; i >= 0; --i)
    {
        if (a[i] != 0)
        {
            break;
        }
    }
    for (; i >= 0; --i)
    {
        cout << a[i];
    }
    cout << endl;
}

int main()
{
    fast();
    int n;
    cin >> n;
    a[0] = 1;

    for (int i = 2; i <= n; ++i)
    {
        mul(i);
    }

    print();

    return 0;
}

优化了也不行

[点赞姐 (点赞姐[赞])]

实时更新答案长度？

[李政烨]

万能头宣传片

[肖恩]

可以尝试写高精乘高精，分别计算1到n/10，n/10到2n/10，最后到n（分成十块算答案再把答案乘起来），也可以分成根号n块，直接分块

[杨思越 (灵珠敖丙)]

捉(((

[肖恩]

@阚宇阳 可以尝试写高精乘高精，分别计算1到n/10，n/10到2n/10，最后到n（分成十块算答案再把答案乘起来），也可以分成根号n块，直接分块

[阚宇阳 (䜗.)]

@肖恩

可以尝试写高精乘高精，分别计算1到n/10

试试吧

[肖恩]

@阚宇阳 `#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
void fast()
{
ios::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
}

const int MAXN = 35660;
int a[MAXN];

void mul(int num, int x)
{
int c = 0;
for (int i = 0; i < MAXN; ++i)
{
int temp = num[i] * x + c;
num[i] = temp % 10;
c = temp / 10;
}
}

void print()
{
int i;
for (i = MAXN - 1; i >= 0; --i)
{
if (a[i] != 0)
{
break;
}
}
for (; i >= 0; --i)
{
cout << a[i];
}
cout << endl;
}

int main()
{
fast();
int n;
cin >> n;
// n=10000;

a[0] = 1;

for (int i = 1; i <= n; ++i)
{
    mul(a, i);
}

print();

return 0;

}
帮你调过了

[CZF2919 (陈泽樊)]

AC 代码?

[肖恩]

%%% c++大佬