zoukankan      html  css  js  c++  java
  • CodeForces 492A Vanya and Cubes

    A. Vanya and Cubes
    time limit per test
    1 second
    memory limit per test
    256 megabytes
    input
    standard input
    output
    standard output

    Vanya got n cubes. He decided to build a pyramid from them. Vanya wants to build the pyramid as follows: the top level of the pyramid must consist of 1 cube, the second level must consist of 1 + 2 = 3 cubes, the third level must have 1 + 2 + 3 = 6 cubes, and so on. Thus, the i-th level of the pyramid must have 1 + 2 + ... + (i - 1) + i cubes.

    Vanya wants to know what is the maximum height of the pyramid that he can make using the given cubes.

    Input

    The first line contains integer n (1 ≤ n ≤ 104) — the number of cubes given to Vanya.

    Output

    Print the maximum possible height of the pyramid in the single line.

    Sample test(s)
    input
    1
    output
    1
    input
    25
    output
    4
    Note

    Illustration to the second sample:

    水题、

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    using namespace std;
    typedef long long ll;
    typedef pair<int,int> pii;
    const int INF = 1e9;
    const double eps = 1e-6;
    int cas = 1;
    
    
    int main()
    {
        #ifdef LOCAL
    //    freopen("case.txt","r",stdin);
        #endif
        int n,ans,sum,sum2;
        while(cin>>n)
        {
            ans = sum = sum2 = 0;
            while(true)
            {
                if(sum2 > n) break;
                ans ++ ;
                sum += ans;
                sum2 += sum;
            }
            cout << ans-1 << endl;
        }
        return 0;
    }
  • 相关阅读:
    Codeblocks的常用Debug快捷键
    大整数乘法(POJ2389)
    简单深搜
    Windows安装时的几个命令(摘录)
    模拟栈的回溯,完全二叉树搜索,(ZOJ1004)
    生理周期,POJ(1006)
    next_permutation,POJ(1256)
    计算次数,POJ(1207)
    模拟,找次品硬币,Counterfeit Dollar(POJ 1013)
    深搜(DFS),Image Perimeters
  • 原文地址:https://www.cnblogs.com/someblue/p/4136428.html
Copyright © 2011-2022 走看看