zoukankan      html  css  js  c++  java
  • The Bells are Ringing(枚举)

    Description


    Perhaps you all have heard the mythical story about Tower of Hanoi (The details of this story is not required to solve this problem): “There is a tower of Hanoi with 64 disks and three pegs and the preists make one move everyday and the earth will be destroyed when all the pegs have been moved from one peg to the other following the rules of Tower of Hanoi.” In this problem we deal with a similar story – The story of an ancient temple. The ancient temple has three incredibly large bells. At the beginning of time the three bells rang together. Then the three bells never rang together and when they will ring together again the earth will be destroyed. The three bells have cycle length of t1, t2and t3 (Here t1<t2<t3 and all are expressed in miliseconds). By this I mean that the first bell rings at every t1 seconds from the beginning, the second bell rings at every t2second from the beginning and the third bell rings at every t3 second from the beginning. Also note that the difference of the values of t1, t2 and t3 is not that much different so that ordinary people think many time that they are ringing together.

    Given the time difference between destruction of earth and beginning of time you will have to find the values of t1, t2 and t3.

    Input

    The input file contains at most 600 lines of inputs. Each line contains an integer which denotes (in millisecond) the time difference between the beginning of time and the time of the bells ringing together. Input is terminated by a line containing a single zero. All the input numbers will fit in a 64 bit signed integer.

    Output

    For each line of input produce two lines or more of output. The first line contains the serial of output. Each of the next lines contains three integers which denote the values of t1, t2 and t3 respectively. The value of t1, t2 and t3 is such that t1<t2<t3 and 0<t1, t2, t3≤1000000 and |t1-t3|≤25. If you cannot find values of t1, t2, twith such constraints then print the line “Such bells don’t exist” instead. In case there is more than one solution sort the output in ascending order of the value of t1, then (in case of a tie) in the ascending order of the value of t2 and then (still a tie) in ascending order of the value t3. Print a blank line after the output for each test case. Look at the output for sample input for details.

     这道题使用枚举的方法就好,不过值得注意的是数据类型的选取,n有可能是一个非常大的数,所以必须把所有整型换成long long型

    #include"iostream"
    using namespace std;
    const int maxn=1000000;
    long long gcd(long long a,long long b)  //求公共质因数
    {
        return (b==0)?a:gcd(b,a%b);
    }
    
    int main()
    {
        long long n,gonbei1,gonbei2,f=0;
        while(cin>>n&&n)
        {
            int flag=0;
            cout<<"Scenario "<<++f<<":"<<endl;
            for(long long i=1;i<=1000000;i++)
            {
                if(n%i) continue;
                for(long long j=i+1;j<=i+25&&j<=maxn;j++)
                   {
                       if(n%j) continue;
                       gonbei1=(i*j)/gcd(i,j);
                      for(long long k=j+1;k<=i+25&&k<=maxn;k++)
                     {
                        if(n%k) continue;
                        gonbei2=(gonbei1*k)/gcd(gonbei1,k);
                        if(gonbei2==n) {cout<<i<<' '<<j<<' '<<k<<endl;flag=1;}
                     }
                   }
            }
            if(flag==0) cout<<"Such bells don't exist"<<endl;
             cout<<endl;
        }
        return 0;
    }
  • 相关阅读:
    博弈论(SG函数):HNOI 2007 分裂游戏
    博弈论(二分图匹配):NOI 2011 兔兔与蛋蛋游戏
    博弈论(男人八题):POJ 1740 A New Stone Game
    动态规划(树形DP):HDU 5834 Magic boy Bi Luo with his excited tree
    杂项(最小表示法):HZOI 2015 Glass Beads
    如何避免死锁
    死锁的四个必要条件
    线程安全和可重入函数之间的区别和联系
    信号量 sem_undo设置
    linux管道的容量和内部组织方式
  • 原文地址:https://www.cnblogs.com/zsyacm666666/p/4666358.html
Copyright © 2011-2022 走看看