Pagini recente » Cod sursa (job #2852254) | Cod sursa (job #1073609) | Cod sursa (job #137184) | Cod sursa (job #1789084) | Cod sursa (job #2081384)
#include <bits/stdc++.h>
#define MOD 999017
int main(){
FILE*fi,*fo;
fi = fopen("sortari2.in","r");
fo = fopen("sortari2.out","w");
int n;
fscanf(fi,"%d", &n);
long long f1, f2, f3;
if(2 * n - 1 == 1 || 2 * n - 1 == 2)
f3 = 1;
else{
f1 = 1;
f2 = 1;
for(int i = 3; i <= 2 * n - 1; i++){
f3 = (f1 + f2) % MOD;
f1 = f2;
f2 = f3;
}
}
long long fact = 1;
while(n > 0){
fact = (fact * n) % MOD;
n--;
}
long long sol = (fact - f3) % MOD;
if(sol < 0) sol += MOD;
fprintf(fo,"%lld", sol);
fclose(fi);
fclose(fo);
return 0;
}