49pts TLE 求助

P2626 斐波那契数列(升级版)

```cpp #include<bits/stdc++.h> using namespace std; int main() { int a;cin>>a; long long ans[50],mod=2147483648; vector<int> primes; ans[0]=1,ans[1]=1; for(int i=2;i<a;i++) ans[i]=(ans[i-1]+ans[i-2])%mod; string anss="",stri; if (ans[a-1]==1) { cout<<"1=1"; return 0; } anss+=to_string(ans[a-1])+"="; for(int i=2;i*i<=ans[a-1];i++) { stri=to_string(i); while(ans[a-1]%i==0) { ans[a-1]/=i; anss+=stri+"*"; } } if (ans[a-1]!=1) { anss+=to_string(ans[a-1]); cout<<anss; } else { } } ```
by Fish_redflying @ 2024-03-31 21:55:30


@[wangzc2012](/user/1221613)
by Fish_redflying @ 2024-03-31 21:55:39


@[fishredflying](/user/1029122) / ̄ ̄ ̄ ̄ ̄ ̄ ̄ ̄ ̄ |  所以我到底错在哪了呀 \ ̄ ̄∨ ̄ ̄ ̄ ̄ ̄ ̄   ∧_∧  ( ・∀・)   (  つつヾ   | | |   (__)_)
by wangzc2012 @ 2024-03-31 23:30:00


|