# CF114A Cifera

• 253通过
• 753提交
• 题目来源
• 评测方式 RemoteJudge
• 标签 枚举,暴力 模拟 进制
• 难度 入门难度
• 时空限制 2000ms / 256MB
• 提示：收藏到任务计划后，可在首页查看。

## 题意翻译

给出两个数 $k$ , $l$ 如果 $l$ = $k$ ^ $n$ ( $n$ 为正整数),则在第一行输出YES，并在第二行输出 $n$ -1 否则输出NO

感谢@RioBlu提供翻译

## 题目描述

When Petya went to school, he got interested in large numbers and what they were called in ancient times. For instance, he learned that the Russian word "tma" (which now means "too much to be counted") used to stand for a thousand and "tma tmyschaya" (which literally means "the tma of tmas") used to stand for a million.

Petya wanted to modernize the words we use for numbers and invented a word petricium that represents number $k$ . Moreover, petricium la petricium stands for number $k^{2}$ , petricium la petricium la petricium stands for $k^{3}$ and so on. All numbers of this form are called petriciumus cifera, and the number's importance is the number of articles la in its title.

Petya's invention brought on a challenge that needed to be solved quickly: does some number $l$ belong to the set petriciumus cifera? As Petya is a very busy schoolboy he needs to automate the process, he asked you to solve it.

## 输入输出格式

输入格式：

The first input line contains integer number $k$ , the second line contains integer number $l$ ( $2<=k,l<=2^{31}-1$ ).

输出格式：

You should print in the first line of the output "YES", if the number belongs to the set petriciumus cifera and otherwise print "NO". If the number belongs to the set, then print on the seconds line the only number — the importance of number $l$ .

## 输入输出样例

输入样例#1： 复制
5
25

输出样例#1： 复制
YES
1

输入样例#2： 复制
3
8

输出样例#2： 复制
NO

提示
标程仅供做题后或实在无思路时参考。
请自觉、自律地使用该功能并请对自己的学习负责。
如果发现恶意抄袭标程，将按照I类违反进行处理。