1:开long long
2:求余,%2^31。
by siyue @ 2022-09-30 13:30:58
```cpp
#include<iostream>
using namespace std;
int main(){
long long f[1001],n,sum;
f[1] = 1;
f[2] = 1;
cin>>n;
for(int i = 3;i <= n;i++){
f[i] = f[i - 1] + f[i - 2];//f[i]=(f[i-1]+f[i-2])%pow(2,31);
}
sum = f[n];
cout<<f[n]<<"=";
for(int i = 2;i <= sum;i++){
if(sum % i == 0){
cout<<i;
sum /= i;
if(sum != 1){
cout<<"*";
}
i = 1;
}
}
return 0;
}
```
by siyue @ 2022-09-30 13:33:35
就我看不到代码吗。。。
by AC_CSP @ 2022-09-30 13:33:45
我是在提交记录找的。
by siyue @ 2022-09-30 13:35:26
@siyue大佬,为啥变66分了
by wangzhengzhe1 @ 2022-09-30 13:38:03
分解质因数写的有问题
by EastSnowLotus @ 2022-09-30 13:44:38
你分解质因数写挂了,一个数的质因数中同一个数可能会出现2次以上,请使用while修改
by CH_mengxiang @ 2022-09-30 14:05:40