题目大意:请你求出第$n$个斐波那契数列的数$mod 2^{31}$之后的值.并把它分解质因数. 题解:乱搞 卡点:1.忘记取模 C++ Code: #include<cstdio> #include<cmath> using namespace std; long long n,f[50]={1,1,1,0}; int main(){ scanf("%lld",&n); for (int i=3;i<=n;i++)f[i]=(f[i-1]+f[i
using System; using System.Collections.Generic; using System.Linq; using System.Text; using System.Threading.Tasks; namespace 斐波那契数列求和 { class Program { static void Main(string[] args) { Console.WriteLine()); Console.WriteLine()); Console.WriteLine()