Pagini recente » Cod sursa (job #1878881) | Cod sursa (job #2772726) | Borderou de evaluare (job #2013896) | Cod sursa (job #39271) | Cod sursa (job #540357)
Cod sursa(job #540357)
#include <fstream>
using namespace std;
const int N=10005;
int A[N],n,i,b;
ifstream in("patrate2.in");
ofstream out("patrate2.out");
void mul(int B)
{
int i, t = 0;
for (i = 1; i <= A[0] || t; i++, t /= 100000)
A[i] = (t += A[i] * B) % 100000;
A[0] = i - 1;
}
void work()
{
in>>n;
A[0]=1; A[1]=1;
for(i=1;i<=n*n;++i)
mul(2);
for(i=1;i<=n;++i)
mul(i);
for(i=A[0];i>=1;--i)
out<<A[i];
}
int main()
{
work();
return 0;
}