Pagini recente » Diferente pentru problema/dijkstra intre reviziile 3 si 4 | Cod sursa (job #1997562) | Cod sursa (job #513808) | Cod sursa (job #3277934) | Cod sursa (job #2293312)
#include <stdio.h>
int auri(int a, int b){
//cate puteri de b uri st in a
int n = 0;
while(a>=b)
n+=(a/=b);
return n;
}
int main(){
freopen("gfact.in", "r", stdin);
freopen("gfact.out", "w", stdout);
int p, q;
scanf("%d" , &p);
scanf("%d", &q);
int pas = (1<<30), r = 0;
while(pas!=0){
if(auri(r+1+pas, p) == q)
r+=pas;
pas/=2;
}
printf("%d", r);
}