zoukankan      html  css  js  c++  java
  • Codeforces Round #339 (Div. 2) A. Link/Cut Tree 水题

    A. Link/Cut Tree

    题目连接:

    http://www.codeforces.com/contest/614/problem/A

    Description

    Programmer Rostislav got seriously interested in the Link/Cut Tree data structure, which is based on Splay trees. Specifically, he is now studying the expose procedure.

    Unfortunately, Rostislav is unable to understand the definition of this procedure, so he decided to ask programmer Serezha to help him. Serezha agreed to help if Rostislav solves a simple task (and if he doesn't, then why would he need Splay trees anyway?)

    Given integers l, r and k, you need to print all powers of number k within range from l to r inclusive. However, Rostislav doesn't want to spent time doing this, as he got interested in playing a network game called Agar with Gleb. Help him!

    Input

    The first line of the input contains three space-separated integers l, r and k (1 ≤ l ≤ r ≤ 1018, 2 ≤ k ≤ 109).

    Output

    Print all powers of number k, that lie within range from l to r in the increasing order. If there are no such numbers, print "-1" (without the quotes).

    Sample Input

    1 10 2

    Sample Output

    1 2 4 8

    Hint

    题意

    给你l,r,k

    让你输出k在[l,r]里面的幂

    题解:

    很水的题,但是会爆long long

    所以在乘的时候注意一下,或者用python就好了

    代码

    #include<bits/stdc++.h>
    using namespace std;
    
    vector<long long> T;
    int main()
    {
        long long l,r,k;
        cin>>l>>r>>k;
        int flag = 0;
        long long tmp = 1;
        while(tmp<=r)
        {
            if(tmp>=l)
            {
                T.push_back(tmp);
                flag = 1;
            }
            if(r*1.0/tmp*1.0<k)
                break;
            tmp*=k;
        }
        if(!flag)cout<<"-1"<<endl;
        else
        {
            for(int i=0;i<T.size();i++)
                cout<<T[i]<<" ";
            cout<<endl;
        }
    }
  • 相关阅读:
    视频像素点级的标注
    unet
    Emmet缩写语法
    Nginx漏洞利用与安全加固
    算法时间复杂度
    动态规划dp
    数据结构Java实现04---树及其相关操作
    关于递归
    Java正则表达式
    Java String相关
  • 原文地址:https://www.cnblogs.com/qscqesze/p/5134304.html
Copyright © 2011-2022 走看看