CodeforcesRound#280(Div.2)A_html/css

來(lái)源：懂視網(wǎng) 責(zé)編：小采時(shí)間：2020-11-27 15:58:58

CodeforcesRound#280(Div.2)A_html/css

CodeforcesRound#280(Div.2)A_html/css_WEB-ITnose:題目： 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 d

推薦度：

點(diǎn)擊下載本文 文檔為doc格式

導(dǎo)讀CodeforcesRound#280(Div.2)A_html/css_WEB-ITnose:題目： 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 d

題目：

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

output

input

output

Note

Illustration to the second sample:

沒(méi)啥好說(shuō)的。模擬一下就可以了，還wa一發(fā)不應(yīng)該..

#include #include #include #include #include #include #include #include #include #include #include #include #include using namespace std;#define MIN(a, b) ((a) < (b) ? (a) : (b))#define MAX(a, b) ((a) > (b) ? (a) : (b))#define F(i, n) for(int (i)=0;(i)<(n);++(i))#define REP(i, s, t) for(int (i)=(s);(i)<=(t);++(i))#define UREP(i, s, t) for(int (i)=(s);(i)>=(t);--(i))#define REPOK(i, s, t, o) for(int (i)=(s);(i)<=(t) && (o);++(i))#define MEM0(addr) memset((addr), 0, sizeof((addr)))#define PI 3.141592653579323846233832795#define HALF_PI 1.57079632679466192313216916398#define MAXN 100000#define MAXM 10000#define MOD 1000000007typedef long long LL;const double maxdouble = numeric_limits::max();const double eps = 1e-10;const int INF = 0x7FFFFFFF;int main(){ int n; cin >> n; int ans = 0; int base = 1; while (n >= base) { ++ans; n -= base; base += ans+1; } cout << ans; return 0;}

聲明：本網(wǎng)頁(yè)內(nèi)容旨在傳播知識(shí)，若有侵權(quán)等問(wèn)題請(qǐng)及時(shí)與本網(wǎng)聯(lián)系，我們將在第一時(shí)間刪除處理。TEL:177 7030 7066 E-MAIL:11247931@qq.com

CodeforcesRound#280(Div.2)A_html/css

推薦度：

點(diǎn)擊下載本文 文檔為doc格式

標(biāo)簽： (a 2) codeforcesround#

熱門焦點(diǎn)

国产99久久精品_欧美日本韩国一区二区_激情小说综合网_欧美一级二级视频_午夜av电影_日本久久精品视频

CodeforcesRound#280(Div.2)A_html/css

CodeforcesRound#280(Div.2)A_html/css

題目：

CodeforcesRound#280(Div.2)A_html/css

最新推薦

猜你喜歡

熱門推薦