Cod sursa(job #1293251)
| Utilizator | Data | 15 decembrie 2014 17:08:44 | |
|---|---|---|---|
| Problema | Patrate2 | Scor | 70 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.48 kb |
#include<cstdio>
#include<algorithm>
using namespace std;
int n,i,j,m,v[1005];
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;
}
int main()
{
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
scanf("%d",&n); v[0]=1; v[1]=1;
for (i=1;i<=n;i++)
mul(v,i);
for (i=1;i<=n*n;i++) mul(v,2);
for (i=v[0];i>=1;i--) printf("%d",v[i]);
return 0;
}
