Pagini recente » Cod sursa (job #1090385) | Cod sursa (job #1105758) | Cod sursa (job #2816273) | Cod sursa (job #1629611) | Cod sursa (job #1016254)
#include <iostream>
#include <fstream>
using namespace std;
int A[3600], N;
void mult( int x )
{
int T = 0;
for ( int i = 1; i <= A[0]; ++i )
{
A[i] = ( A[i] * x + T);
T = A[i] / 10;
A[i] %= 10;
}
while ( T )
{
A[ ++A[0] ] = T % 10;
T /= 10;
}
}
int main()
{
ifstream f("patrate2.in");
ofstream g("patrate2.out");
f >> N;
A[0] = A[1] = 1;
for ( int i = N * N; i >= 1; i-- ) mult( 2 );
for ( int i = N; i >= 2; i-- ) mult( i );
for ( int i = A[0]; i ; i-- )
{
g << A[i];
}
g << "\n";
f.close();
return 0;
}