Cod sursa(job #348290)
| Utilizator | Data | 15 septembrie 2009 10:17:26 | |
|---|---|---|---|
| Problema | GFact | Scor | 20 |
| Compilator | cpp | Status | done |
| Runda | Papiu Contest #1 | Marime | 0.52 kb |
#include <algorithm>
using namespace std;
#define lld long long int
lld p, q;
void solve() {
lld i, nr, aux;
scanf( "%lld%lld", &p, &q );
nr = p;
for( i = 2; i <= q; ++ i )
nr *= p;
aux = 1;
for( i = 1; ; ++ i ) {
aux *= i;
if( aux % nr == 0 ) {
printf( "%lld", i );
return;
}
}
}
int main() {
freopen( "gfact.in", "r", stdin );
freopen( "gfact.out", "w", stdout );
solve();
return 0;
}
