Pagini recente » Cod sursa (job #1369710) | Cod sursa (job #2044601) | Cod sursa (job #1116367) | Sandbox (cutiuţa cu năsip) | Cod sursa (job #797230)
Cod sursa(job #797230)
#include<fstream>
#include<cstdio>
using namespace std;
int n,sol[10000]; //sol=N!*(2^(N*N))
inline void Inmulteste(int A[],int B)
{
int i,t=0;
for(i=1;i<=A[0] || t;i++,t/=10000)
A[i]=(t+=A[i]*B)%10000;
A[0]=i-1;
}
inline int NrCif(int x)
{
if(x==0)
return 1;
int rez=0;
while(x)
{
x/=10;
rez++;
}
return rez;
}
int main()
{
ifstream fin("patrate2.in");
fin>>n;
fin.close();
int i,j,nr;
sol[0]=sol[1]=1;
for(i=2;i<=n;i++)
Inmulteste(sol,i);
n=n*n;
for(i=1;i<=n;i++)
Inmulteste(sol,2);
freopen("patrate2.out","w",stdout);
printf("%d",sol[sol[0]]);
for(i=sol[0]-1;i>0;i--)
{
nr=NrCif(sol[i]);
for(j=nr+1;j<=4;j++)
printf("0");
printf("%d",sol[i]);
}
printf("\n");
return 0;
}