zoukankan      html  css  js  c++  java
  • Pangu Separates Heaven and Earth(签到题)(The 2019 Asia Nanchang First Round Online Programming Contest)

    Long long ago, the sky and the earth were not separated, and the universe was chaotic. There was a giant named Pangu who slept for eighteen thousand years in this chaos.

    One day, Pangu woke up suddenly. When he saw the darkness around him, he took up his axe and slammed into the darkness in front of him. Just listen to a loud noise, chaotic things gradually separated. Light and clear things rise slowly and become heaven; heavy and turbid things fall slowly and become earth.

    After the separation of heaven and earth, Pangu feared that they would still be together. He put his head on the heaven and pedaled the earth with his feet. Every day, Pangu rose by a tenth, and the longer Pangu grew, the higher Pangu grew. In this way, I do not know how many years, the sky and the earth gradually formed, Pangu also fell tired.Pangu's body changed dramatically after his fall. His breath became the wind of the seasons and the floating clouds; his voice turned into a rumbling thunder. His eyes became the sun and the moon; his limbs became the east, west, South and North four poles of the earth; his skin became the vast land; his blood became the running rivers; his sweat became the rain that moistened all things...

    Input

    The first line has a positive integer T (1 le T le 10)T(1T10), which indicates that there are TT cases of test data.

    Each case of test data input takes up one line and is a positive integer N (1 le N le 100000000)N(1N100000000).

    Output

    Each case of test data output takes up one line, which is an integer.

    When input is 11, output Pangu sleeping years, that is: 1800018000

    When input is others, output zero, that is: 00

    样例输入

    2
    1
    2

    样例输出

    18000
    0
    #include <iostream>
    
    using namespace std;
    
    int main()
    {
        long long n,t;
        cin>>t;
        while(t--)
        {
            cin>>n;
            if(n==1)
                cout<<18000<<endl;
            else
                cout<<0<<endl;
        }
        return 0;
    }
    所遇皆星河
  • 相关阅读:
    hdu4135(容斥原理求质数,队列实现)
    poj2559(单调栈)
    poj2796(单调栈)
    icpc2018焦作Transport Ship(背包思想)
    icpc2018焦作Mathematical Curse(动态规划)
    2018icpc徐州OnlineA Hard to prepare
    icpc2018徐州OnlineG-Trace(线段树)
    hdu3499(分层图最短路 or 反向建图)
    MINE
    数论(Mathmatics)总结[1]
  • 原文地址:https://www.cnblogs.com/Shallow-dream/p/11488462.html
Copyright © 2011-2022 走看看