%%%orz大佬
by Chloris @ 2018-07-18 14:50:30
@[Chloristendika](/space/show?uid=76527) wr大佬啊Orz（反正女孩子跪了也没事
by tocek_shiki @ 2018-07-18 14:56:44
@[fff团666](/space/show?uid=49562)
@[fff团666](/space/show?uid=49562) 刚写的您看看（你怎么认识我的..）
```cpp
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <stack>
#include <vector>
#include <cctype>
#include <queue>
#include <deque>
#include <cmath>
#include <map>
#define INF (0x3f3f3f3fd)
#define max(a,b) ((a)>(b)?(a):(b))
#define min(a,b) ((a)<(b)?(a):(b))
#define REP(i, x, y) for(int i = (int)x; i <= (int)y; i ++)
#define FOR(i, x, y) for(int i = (int)x; i < (int)y; i ++)
#define PER(i, x, y) for(int i = (int)x; i >= (int)y; i --)
using namespace std;
int main(){
int k, l;
scanf("%d %d", &k, &l);
if(l == 1) return printf("YES \n 0\n"), 0;
int tmp = 1;
for(int i = 1; tmp <= l; i++){
tmp *= k;
if(tmp == l) return printf("YES \n %d\n", i - 1), 0;
if(l % tmp != 0) return printf("NO \n"), 0;
}
return printf("NO \n"), 0;
return 0;
}
```
顺便学到了您return这么神奇的写法
by Chloris @ 2018-07-18 14:59:12
@[Chloristendika](/space/show?uid=76527) from iWApD3
by tocek_shiki @ 2018-07-18 15:01:09
@[Chloristendika](/space/show?uid=76527) 还有这个return也是别人教我的啊（雾
by tocek_shiki @ 2018-07-18 15:01:55
@[fff团666](/space/show?uid=49562) 抱歉刚刚手滑at了您两次，~~那您别听她胡说八道~~
by Chloris @ 2018-07-18 15:02:24
@[Chloristendika](/space/show?uid=76527) l=1为什么输出0？不该输出-1吗？
by tocek_shiki @ 2018-07-18 15:03:22
@[Chloristendika](/space/show?uid=76527) 某个~~逗比~~的故事
好吧我不知道（雾
by tocek_shiki @ 2018-07-18 15:03:52
@[fff团666](/space/show?uid=49562) 那就是数据太水啦
I am true vegetable
by Chloris @ 2018-07-18 15:04:51
@[fff团666](/space/show?uid=49562) 什么DB啊。。。。
by Chloris @ 2018-07-18 15:05:16