Pagini recente » Cod sursa (job #1738575) | Rating Philip Dumitru (PhilipDumitru) | Cod sursa (job #727140) | Cod sursa (job #3164534) | Cod sursa (job #3273360)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("patrate2.in");
ofstream g("patrate2.out");
const int NMAX = 10000;
int n, A[NMAX + 1];
void produs(int A[], int x)
{
int T = 0;
for(int i = 1; i <= A[0]; i++)
{
T += A[i] * x;
A[i] = T % 10;
T /= 10;
}
while(T != 0)
{
A[++A[0]] = T % 10;
T /= 10;
}
}
int main()
{
f >> n;
A[0] = 1;
A[1] = 1;
for(int i = 1; i <= n; i++)
produs(A, i);
for(int i = 1; i <= n * n; i++)
produs(A, 2);
for(int i = A[0]; i >= 1; i--)
g << A[i];
f.close();
g.close();
}