Pagini recente » infocompetition | Cod sursa (job #1272813) | Cod sursa (job #516543) | Cod sursa (job #81884) | Cod sursa (job #1723997)
#include<cstdio>
#define MAXDIGITS 100000
using namespace std;
int answer[MAXDIGITS];
void Multiply(int v[MAXDIGITS],int k){
int i,c=0;
for(i=1;i<=v[0]||c>0;i++){
v[i]=v[i]*k+c;
c=v[i]/10;
v[i]%=10;
}
v[0]=i-1;
}
int main(){
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
int n,i;
scanf("%d",&n);
answer[0]=answer[1]=1;
for(i=1;i<=n;i++)
Multiply(answer,i);
for(i=1;i<=n*n;i++)
Multiply(answer,2);
for(i=answer[0];i>=1;i--)
printf("%d",answer[i]);
return 0;
}