zoukankan      html  css  js  c++  java
  • Codeforces 114A-Cifera(暴力)

    A. Cifera
    time limit per test
    2 seconds
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    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 k2petricium la petricium la petricium stands for k3 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.

    Input

    The first input line contains integer number k, the second line contains integer number l (2 ≤ k, l ≤ 231 - 1).

    Output

    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.

    Sample test(s)
    input
    5
    25
    
    output
    YES
    1
    
    input
    3
    8
    
    output
    NO
    Div2 A题。。

    没什么好说的。

    非常水

    题意: 给k l,问l是否等于 k^n  (n=1,2,3.....)注意:不要用pow()函数。。会有精度损失的
    #include <iostream>
    #include <algorithm>
    #include <cstdio>
    #include <cstring>
    #include <vector>
    #include <queue>
    #include <set>
    #include <cmath>
    #include <stack>
    #define ll long long
    using namespace std;
    const int INF=0x3f3f3f3f;
    int l,k;
    ll my_pow(int a,int n)
    {
    	ll ans=1;
    	for(int i=1;i<=n;i++)
    		ans*=a;
    	return ans;
    }
    void solve()
    {
    	if(k==l)
    	{
    		puts("YES");
    		puts("0");
    		return ;
    	}
    	int t=1,flag=0;
    	while(1)
    	{
    		if(l==my_pow(k,t+1))
    		{
    			flag=1;
    			break;
    		}
    		else if(l<my_pow(k,t+1))
    		{
    			break;
    		}
    		t++;
    	}
    	if(flag)
    	{
    		puts("YES");
    		printf("%d
    ",t);
    	}
    	else
    	puts("NO");
    }
    int main()
    {
    
        while(~scanf("%d%d",&k,&l))
    		solve();
    	return 0;
    }
    
    
  • 相关阅读:
    MySQL系列(四)--数据库结构优化、范式化与反范式化
    Java数据结构和算法(二)--队列
    Java数据结构和算法(一)--栈
    MySQL系列(三)--MySQL存储引擎
    Java集合(六)--ArrayList、LinkedList和Vector对比
    Java集合(五)--LinkedList源码解读
    Java集合(四)--基于JDK1.8的ArrayList源码解读
    P1048 采药(洛谷,动态规划递推,01背包原题)
    P1091 合唱队形题解(洛谷,动态规划LIS,单调队列)
    语法摔过的坑(用来给自己看的,粗糙,勿点)
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5349692.html
Copyright © 2011-2022 走看看