给个关注吧
```cpp
#include<bits/stdc++.h>
using namespace std;
const long long Mod=pow(2,31);//题里说了取模,防止过大
long long a[100];
int n;
int f(int x){//记忆化搜索,可节省时间,防止TLE
if(x>n) return (a[n-1]+a[n-2])%Mod;
a[x]=(a[x-1]+a[x-2])%Mod;
return f(x+1)%Mod;
}
int main() {
int x=0; //x在主函数里没有赋值,是随机值; 主函数外不赋值则为零
cin>>n;
a[1]=a[2]=1;//赋值
long long k=f(3)%Mod;
cout<<k<<"=";
for(int i=2;i<=k;i++){
while(k%i==0){
x++;
if(x==1){
cout<<i;
}
else{
cout<<"*"<<i;
}
k/=i;
}
}
return 0;
}
//48
//512559680=2*2*2*2*2*2*5*1601749
```
不懂可问
by zhaowenhe001 @ 2024-08-19 15:28:47
@[mathrormy](/user/1029718)
by zhaowenhe001 @ 2024-08-19 15:30:48