Pagini recente » Cod sursa (job #908434) | Cod sursa (job #199676) | Cod sursa (job #1983148) | Cod sursa (job #257986) | Cod sursa (job #1065026)
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("patrate2.in");
ofstream g("patrate2.out");
int Fact[100005],Power2[100005];
int N;
void mulLess(int A[], int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 10)
A[i] = (t += A[i] * B) % 10;
A[0] = i - 1;
}
void mulLarge(int A[], int B[])
{
int i, j, t, C[100005];
memset(C, 0, sizeof(C));
for (i = 1; i <= A[0]; i++)
{
for (t=0, j=1; j <= B[0] || t; j++, t/=10)
C[i+j-1]=(t+=C[i+j-1]+A[i]*B[j])%10;
if (i + j - 2 > C[0]) C[0] = i + j - 2;
}
memcpy(A, C, sizeof(C));
}
void Solve()
{
int i;
Fact[0]=Fact[1]=1;
for(i=2;i<=N;i++)
mulLess(Fact,i);
Power2[0]=Power2[1]=1;
for(i=1;i<=N*N;i++)
mulLess(Power2,2);
mulLarge(Fact,Power2);
for(i=Fact[0];i>=1;i--)
g<<Fact[i];
}
int main()
{
f>>N;
Solve();
return 0;
}