Pagini recente » Cod sursa (job #2649068) | Cod sursa (job #2044879) | simulare-cartita-19b | Cod sursa (job #1581692) | Cod sursa (job #154546)
Cod sursa(job #154546)
#include <stdio.h>
#include <string.h>
#include <math.h>
void mul(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 mul(int A[], int B[])
{
int i, j, t, C[10000];
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));
}
int main(){
int v[10001],n,i,w[10001],x,z,y;
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
scanf("%d",&n);
v[0]=w[0]=1;
v[1]=w[1]=1;
x=n*n/30;
z=pow(2,30);
y=n*n%30;
for(i=1;i<=x;i++)
mul(v,z);
for(i=1;i<=y;i++)
mul(v,2);
for(i=2;i<=n;i++)
mul(w,i);
mul(v,w);
for(i=v[0];i>=1;i--)
printf("%d",v[i]);
return 0;
fclose(stdout);
}