开long long试试
by renzhanwen @ 2024-08-17 21:01:09
@[QAQ_liu](/user/1032871) 好像题解第一篇
by __crz_qaq__ @ 2024-08-17 21:01:52
十年OI一场空，不开longlong见祖宗
by zhizhi_fengxi @ 2024-08-17 21:02:12
好像没有mod 2^31
by zhizhi_fengxi @ 2024-08-17 21:06:38
```cpp
#include<bits/stdc++.h>
using namespace std;
long long n,a[100],i=2;
int main()
{
cin>>n;
a[1]=a[2]=1;
for(int i=3;i<=n;i++)
a[i]=(a[i-1]+a[i-2])%2147483648;
cout<<a[n]<<"=";
while(a[n]!=1)
{
while(a[n]%i==0)
{
a[n]/=i;
cout<<i;
if(a[n]!=1)
cout<<"*";
}
i++;
}
return 0;
}
by renzhanwen @ 2024-08-17 21:07:53
@[QAQ_liu](/user/1032871)
by renzhanwen @ 2024-08-17 21:09:26
@[__crz_qaq__](/user/1037614) 确实有点
by ChasonWang @ 2024-08-19 13:58:49