Pagini recente » Cod sursa (job #2944784) | Cod sursa (job #183425) | Cod sursa (job #2287118) | Istoria paginii runda/simulare_oji_2023_clasa_9_16_martie/clasament | Cod sursa (job #2549845)
#include <iostream>
#include <fstream>
#include <string.h>
#define PMAX (1<<30)
#define KMAX 1000005
using namespace std;
ifstream fin("fact.in");
ofstream fout("fact.out");
int nr,numar[KMAX],n;
int main()
{
fin>>n;
numar[1]=1;
int k=1,x=2;
while(nr<n)
{
int temp=0,aux,ok=1;
nr=0;
for(int i=1;i<=k;i++)
{
aux=numar[i]*x+temp;
temp=aux/10;
numar[i]=aux%10;
if(!numar[i] && ok)
{
nr++;
}
else ok=0;
}
if(temp)
numar[++k]=temp;
x++;
}
fout<<x-1;
return 0;
}