Pagini recente » Cod sursa (job #1795751) | Cod sursa (job #205460) | Cod sursa (job #1314229) | Cod sursa (job #1966098) | Cod sursa (job #2299891)
#include <iostream>
#include <fstream>
using namespace std;
ifstream f("fsb.in");
ofstream g("fsb.out");
int n,n2[10000005],t;
int main()
{
f >> n;
n2[1]=1;
n2[0]=1;
for (int i=1;i<=n;i++) {
for (int k=1;k<=n2[0];k++) {
n2[k]*=i;
n2[k]+=t;
t=n2[k]/10;
n2[k]%=10;
}
while (t!=0) {
n2[n2[0]+1]+=t;
t=n2[n2[0]+1]/10;
n2[0]++;
}
}
for (int i=1;i<=n*n;i++) {
for (int k=1;k<=n2[0];k++) {
n2[k]*=2;
n2[k]+=t;
t=n2[k]/10;
n2[k]%=10;
}
while (t!=0) {
n2[n2[0]+1]+=t;
t=n2[n2[0]+1]/10;
n2[0]++;
}
}
g << n2[0]<<'\n';
for (int k=n2[0];k>=1;k--) {
g << n2[k];
}
return 0;
}