Pagini recente » Cod sursa (job #1111914) | Borderou de evaluare (job #2656585) | Cod sursa (job #2719671) | Atasamentele paginii Clasament simulare_1_oji_prep | Cod sursa (job #2288736)
#include <iostream>
#include <fstream>
using namespace std;
int main()
{
ifstream fin("fact.in");
ofstream fout("fact.out");
int p, n = 1, k, np = 0, nn = 0;
cin >> p;
for (int i = 1; i <= p; i++)
n *= i;
k = n;
while (k != 0)
{
nn++;
k /= 10;
}
while (p != 0)
{
np++;
p /= 10;
}
if (nn == np) cout << n;
else cout << -1;
system("pause");
return 0;
}