Cod sursa(job #2396469)
Utilizator | Data | 3 aprilie 2019 15:30:47 | |
---|---|---|---|
Problema | GFact | Scor | 0 |
Compilator | cpp-64 | Status | done |
Runda | Arhiva de probleme | Marime | 0.26 kb |
#include <iostream>
using namespace std;
long long fact[]={1,2,6,24,120,720,5040,4030,362880,3628800,39916800,479001600};
int i,p,q;
int main()
{cin>>p>>q;
for(i=0;i<=11;i++)
{
if(fact[i]%p==0)
{cout<<i+1;
break;
}
}
return 0;
}