Pagini recente » Cod sursa (job #1990092) | Cod sursa (job #378427) | Cod sursa (job #1057131) | Cod sursa (job #2048570) | Cod sursa (job #1117084)
#include <iostream>
#include <fstream>
#include<stdio.h>
using namespace std;
int fact(int n)
{
unsigned long int rez=1;
int i;
if(n==0) return 1;
for(i=2;i<=n;i++)
rez=rez*i;
return rez;
}
int main ()
{
ifstream f("gfact.in");
ofstream g("gfact.out");
int m,n,i,p,q,stop=1,a=1;
f>>p; f>>q;
for(i=1;i<=q;i++) a=a*p;
while((stop==1)&&(i<=25))
{
if(fact(i)%a==0) {stop=0; g<<i;}
i++;
}
if(stop==1) g<<"Nu am gasit solutie";
return 0;
}