Home > Back-end >  To solve the
To solve the

Time:11-02

CodePudding user response:

 # include 

Int main ()
{
Int F [1000000]={1, 1};
Int n, I, m;
The scanf (" % d ", & amp; n);
For (I=2; I & lt; n; I++)
{
[I]=F (F [I - 1) + F [2] I -) % 998244353;
Printf (" % d \ n ", F [I]);
}
M=F [I - 1] % 998244353;
Printf (" % d ", m);


return 0;
}

CodePudding user response:

Thank you, I was too food, ha ha ha ha ha ha ha ha ha ha ha ha ha ha ha
  • Related