492A - Vanya and Cubes
2015-05-25 11:30
274 查看
#include <cmath> #include <cstdio> #include <cstdlib> #include <cstring> #include <iostream> #include <string> #include <vector> #include <queue> #include <algorithm> using namespace std; int arr[201], sum[201]; int main() { arr[0] = 0; for(int i = 1; i < 201; ++i) { arr[i] = arr[i-1]+i; } sum[0] = 0; for(int i = 1; i < 201; ++i) { sum[i] = sum[i-1] + arr[i]; } int n; int id = 0; cin >> n; while(n >= sum[id]) id++; cout << id - 1 << endl; return 0; }
相关文章推荐
- 492A - Vanya and Cubes
- codeforces——492A——Vanya and Cubes
- Codeforces 492A - Vanya and Cubes (求和公式)
- Codeforces 492A. Vanya and Cubes 水
- Codeforces Round #280 (Div. 2)A. Vanya and Cubes(简单计算)
- Codeforces Round #280 (Div. 2) A. Vanya and Cubes 水题
- Vanya and Cubes
- A. Vanya and Cubes
- A - Vanya and Cubes
- Codeforces Vanya and Cubes
- C. Vanya and Scales(Codeforces Round #308 (Div. 2))
- Codeforces Round #308 (Div. 2) A. Vanya and Table
- Codeforces Round #308 (Div. 2) C. Vanya and Scales dfs
- A. Vanya and Table
- Codeforces Round #308 (Div. 2) D. Vanya and Triangles
- Codeforces Round #308 (Div. 2) B. Vanya and Books
- CF 280B. Vanya and Lanterns(div2)
- codeforces 680D D. Bear and Tower of Cubes(dfs+贪心)
- cf #308 D. Vanya and Triangles (几何)
- Codeforces Round #395(Div. 2)B. Timofey and cubes【模拟】