UVA 10079 Pizza Cutting
2013-01-28 21:10
232 查看
大意略。
思路:切豆腐,3刀八块,关键是如何去切。f
-f[n-1] = n,f[0] = 1;
思路:切豆腐,3刀八块,关键是如何去切。f
-f[n-1] = n,f[0] = 1;
#include <iostream> #include <cstdlib> #include <cstdio> #include <cstring> #include <cstdio> #include <cmath> using namespace std; typedef long long LL; LL n; int main() { while(~scanf("%lld", &n)) { if(n < 0) break; printf("%lld\n", (n*n+n)/2+1); } return 0; }
相关文章推荐
- UVA 10079 Pizza Cutting
- UVA, 10079 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【水题】
- 10079 - Pizza Cutting
- UVA - 10079 Pizza Cutting (直线划分平面问题,公式解决)
- uva 10079 - Pizza Cutting
- UVA 10079 Pizza Cutting(数论)
- UVa 10079 - Pizza Cutting
- 数学专项counting:UVa 10079
- UVA10079 - Pizza Cutting(数论)
- UVA 10079 Pizze Cutting
- uva 10079 - Pizza Cutting
- Uva 10079 - Pizza Cutting 解题报告(递推)
- UVa 10079 Pizza Cutting (water ver.)
- UVa 644 - Immediate Decodability