Pagini recente » Cod sursa (job #1703559) | Cod sursa (job #1298616) | Cod sursa (job #2843425) | Cod sursa (job #3267328) | Cod sursa (job #1104118)
#include <fstream>
#include <cstring>
using namespace std;
ifstream is("patrate2.in");
ofstream os("patrate2.out");
int S[1001];
int S2[1001];
int S3[1001];
void Multiply(int A[],int B);
void Multiply2(int A[], int B[]);
int main()
{
int n;
is >> n;
S[0] = 1;
S[1] = 1;
for ( int i = 1; i <= n; ++i )
Multiply(S,i);
memcpy(S2,S,sizeof(S));
Multiply2(S,S2);
S3[0] = 1;
S3[1] = 2;
for ( int i = 2; i <= n*n-1; ++i )
Multiply(S3,2);
Multiply2(S3,S);
for ( int i = S3[0]; i >= 1; --i )
os << S3[i];
return 0;
}
void Multiply(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 Multiply2(int A[], int B[])
{
int q = A[0];
int i, j, t, C[1001];
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));
}