直接枚举有多少个K相×,
#include <iostream>
using namespace std;
int main() {
long long k, l, a,b=0;
cin >> k >> l;
for(a=k;a<l;a*=k,b++);
if(a==l)
cout<<"YES"<<endl<<b<<endl;
else
cout<<"NO"<<endl;;
return 0;
}
直接枚举有多少个K相×,
#include <iostream>
using namespace std;
int main() {
long long k, l, a,b=0;
cin >> k >> l;
for(a=k;a<l;a*=k,b++);
if(a==l)
cout<<"YES"<<endl<<b<<endl;
else
cout<<"NO"<<endl;;
return 0;
}