Cod sursa(job #1434741)
| Utilizator | Data | 11 mai 2015 11:52:34 | |
|---|---|---|---|
| Problema | Factorial | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.56 kb |
#include <fstream>
using namespace std;
long long P;
ifstream f("fact.in");
ofstream g("fact.out");
unsigned nz (unsigned n)
{
if (n == 1) return 0;
if (n > 5 && n < 10) return 1;
if (n % 10 == 0) return 2*(n/10);
if (n % 10 >= 1 && n % 10 < 5) return n/10 + (n/10-1);
if (n % 10 >= 5 && n % 10 < 9) return 2*(n/10);
return 0;
}
int main()
{
long long i;
bool ok = false;
f>>P;
f.close();
i=P+1;
while(!ok)
{
if (nz(i) == P) ok = true;
else i++;
}
g<<i;
g.close();
}
