Pagini recente » Cod sursa (job #1433959) | Cod sursa (job #1600273) | Cod sursa (job #249777) | Cod sursa (job #1550507) | Cod sursa (job #1555795)
#include <fstream>
#include <iostream>
using namespace std;
constexpr int mod = 999017;
void fast_mod(int& x){
if(x >= mod){
x -= mod; } }
int fibo(const int n){
int b = 1;
for(int i = 0, a = 0, c = 1; i < n; a=b, b=c, c=a+b, fast_mod(c), ++i);
return b; }
int factorial(const int n){
long long rez = 1;
for(long long i = 2; i <= n; rez *= i, rez %= mod, ++i);
return rez; }
int main(){
ifstream f("sortari2.in");
ofstream g("sortari2.out");
int n;
f >> n;
g << ((factorial(n) - fibo(n+2) + mod)%mod);
return 0; }