Pagini recente » Cod sursa (job #2456086) | Cod sursa (job #307151) | Istoria paginii runda/monthly-2014-runda-9/clasament | Cod sursa (job #1804687) | Cod sursa (job #2878358)
#include <fstream>
using namespace std;
ifstream in("patrate2.in");
ofstream out("patrate2.out");
int a[20001];
void inmultire(int A[], int B)
{
int T = 0;
for(int i = 1; i <= A[0]; i++)
{
T += A[i] * B;
A[i] = T % 10;
T /= 10;
}
while(T > 0)
{
A[++A[0]] = T % 10;
T /= 10;
}
}
int main(){
int n;
in >> n;
a[0] = 1;
a[1] = 1;
for(int i = 1; i <= n * n; i++)
inmultire(a, 2);
for(int i = 2; i <= n; i++)
inmultire(a, i);
for(int i = a[0]; i >= 1; i--)
out << a[i];
return 0;
}