Pagini recente » Cod sursa (job #1591708) | Cod sursa (job #2932665) | Cod sursa (job #2836835) | Cod sursa (job #1919652) | Cod sursa (job #1756441)
#include <cstdio>
#include <algorithm>
#define INF 2140000000
#define MOD 100000000
using namespace std;
int N,v[4000]={1,1},temp,lenght,x;
void Multiply(int A[],int n)
{
temp=0;
for(int i=1;i<=A[0];i++)
{
A[i]=temp+A[i]*n;
temp=A[i]/10;
A[i]%=10;
if(i==A[0]&&temp>0)
A[0]++;
}
}
void Print()
{
for(int i=v[0];i>0;i--)
printf("%d",v[i]);
}
int main()
{
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
scanf("%d",&N);
for(int i=1;i<=N*N;i++)
Multiply(v,2);
for(int i=2;i<=N;i++)
Multiply(v,i);
Print();
return 0;
}