Cod sursa(job #585074)
| Utilizator |  Matei Vlad thelas |
Data | 27 aprilie 2011 22:09:41 |
|---|---|---|---|
| Problema | Factorial | Scor | 5 |
| Compilator | cpp | Status | done |
| Runda | Arhiva de probleme | Marime | 0.34 kb |
#include<cstdio>
#include<fstream>
using namespace std;
int main()
{int n,p,i,r,a,k;
ifstream f("fact.in");
ofstream g("fact.out");
f>>p;
n=0;
do
{
r=0;
k=0;
++n;
for(i=1;i<=n;++i)
{if (i%2==0)
k++;
if (i%5==0)
r++;}}
while((k!=p)&&(r!=p));
if ((k==p)||(r==p))
g<<n<<"\n";
else
g<<-1<<"\n";
f.close();
g.close();}