uva 10079 - Pizza Cutting
2013-05-22 18:21
405 查看
pizza切n刀,最多切成几块。公式(n*(n+1))/2+1。
#include<iostream> using namespace std; int main() { long long n; while(cin>>n&&n>=0) cout<<(n+1)*n/2+1<<endl; return 0; }
相关文章推荐
- UVA10079 Pizza Cutting【水题】
- UVA - 10079 Pizza Cutting (直线划分平面问题,公式解决)
- uva 10079 - Pizza Cutting
- UVa 10079 - Pizza Cutting
- Uva 10079 - Pizza Cutting 解题报告(递推)
- UVA 10079 Pizza Cutting(数论)
- UVA10079 - Pizza Cutting(数论)
- UVa 10079 Pizza Cutting (water ver.)
- UVA 10079 Pizza Cutting
- UVA 11008--Antimatter Ray Clearcutting+状态压缩记忆化搜索
- UVa 12626 - I ❤ Pizza
- UVA 10079 Pizza Cutting
- uva uva 565 - Pizza Anyone?
- Uva-1628 Pizza Delivery(机智DP)
- uva 12326 & hdu 4092 - Yummy Triangular Pizza(哈希+打表)
- uva 11008 Antimatter Ray Clearcutting
- UVA - 11008 Antimatter Ray Clearcutting
- Uva 11008 - Antimatter Ray Clearcutting 状态压缩
- UVa 565 - Pizza Anyone?
- uva 11008 Antimatter Ray Clearcutting(DFS + 记忆化搜索 + 状态压缩)