hdu1399Starship Hakodate-maru
来源:互联网 发布:uiautomator2.0源码 编辑:程序博客网 时间:2024/06/04 17:51
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1399
这道题普通的双层循环15MS
代码:
#include <cstdio>int a[200];int b[200];int n;int ans ;int a_len,b_len;void init(){ for(int i = 0; i < 54; ++i) a[i] = i * i * i; for(int i = 0; i <= 95; ++i) b[i] = i * (i + 1) * (i + 2) / 6;}int main(){ init(); while(~scanf("%d",&n) && n) { ans = 0; for(int i = 0; i <= 53; ++i) if(n < a[i]) { a_len = i - 1; break; } else if(i == 53 && a[i] < n) a_len = 53; for(int i = 0; i <= 95; ++i) { if(n < b[i]) { b_len = i - 1; break; } else if(i == 95 && b[i] < n) b_len = 95; } for(int i = a_len;i >= 0;--i) { for(int j = b_len;j >= 0;--j) { if(a[i] + b[j] <= n && a[i] + b[j] > ans) ans = a[i] + b[j]; } } printf("%d\n",ans); } return 0;}
0 0
- hdu1399Starship Hakodate-maru
- HDU 1399 Starship Hakodate-maru
- hdu 1399 Starship Hakodate-maru
- HDU 1399 Starship Hakodate-maru
- hdu 1399 Starship Hakodate-maru
- HDU/HDOJ 1399 Starship Hakodate-maru Asia 2001, Hakodate (Japan)
- poj 1406 Starship Hakodate-maru 暴力枚举
- HDU--杭电--1399--Starship Hakodate-maru--二分简化
- hdu 1399 Starship Hakodate-maru (爆搜- -也能算枚举)
- hdu 1399 Starship Hakodate-maru (暴力搜索)
- Hakodate shopping advice
- Hakodate traveling guidebook
- It's time to travel to Hakodate
- hive--分区
- Lightoj 1062 Crossed Ladders (二分)
- Kafka设计解析(二)- Kafka High Availability (上)
- word2007转换成pdf格式在线怎么转
- 线程的生命周期
- hdu1399Starship Hakodate-maru
- 怎么使用stm32写IAP的bootloader和APP
- Kafka设计解析(三)- Kafka High Availability (下)
- OJDBC版本区别 [ojdbc14.jar,ojdbc5.jar和ojdbc6.jar的区别]
- go and vim-go
- IDEA下web项目的搭建
- Spring方法注入
- UVa - 12096 The SetStack Computer(STL容器综合,强推!)
- 杭电 2034