Pagini recente » Istoria paginii runda/oji_bv_2022/clasament | Cod sursa (job #2441748) | Cod sursa (job #1204417) | Cod sursa (job #2752718) | Cod sursa (job #396740)
Cod sursa(job #396740)
#include<stdio.h>
short N,v[10000];
void inmu(int x,int l[])
{
for(int i=1;i<=l[0];++i)
{
l[i]=l[i]*x;
}
for(int i=1;i<=l[0];++i)
{
if(l[i]>9)
{
l[i+1]+=l[i]/10;
l[i]=l[i]%10;
if(i+1>l[0])
l[0]=i+1;
}
}
return;
}
int main()
{
freopen("patrate2.in","r",stdin);
freopen("patrate2.out","w",stdout);
scanf("%d",&N);
v[1]=1;
v[0]=1;
for(int i=1;i<=N*N;++i)
{
inmu(2,v);
}
for(int i=1;i<=N;++i)
{
inmu(i,v);
}
for(int i=v[0];i>=1;--i)
printf("%d",v[i]);
}