Pagini recente » Cod sursa (job #995992) | Cod sursa (job #1225637) | Cod sursa (job #1352485) | Cod sursa (job #3261639) | Cod sursa (job #995705)
Cod sursa(job #995705)
#include <iostream>
#include <fstream>
using namespace std;
#define modulo 999017
int factorial( int n )
{
int s = 1;
for ( int i = 2; i <= n; ++i )
s = ( s * i ) % modulo;
return s;
}
int Fibonacci( int n )
{
int a = 0;
int b = 1;
int c = 1;
for ( int i = 3; i <= n; ++i )
{
c = ( a + b ) % modulo;
a = b;
b = c;
}
return c;
}
int N;
int main()
{
ifstream f("sortari2.in");
ofstream g("sortari2.out");
f >> N;
g << ( factorial( N ) - Fibonacci( 2 * N ) + modulo ) % modulo << "\n";
f.close();
g.close();
return 0;
}