uva10970- Big Chocolate
来源:互联网 发布:网络市场调研的含义 编辑:程序博客网 时间:2024/06/05 16:00
题意:
m*n格的巧克力,沿着线切,一刀只能切一块,问至少需要几刀才能切成m*n块
思路:
先按m切或先按n切都可。
代码如下:
#include <iostream>#include <cstdio>#include <cstring>#include <cmath>using namespace std;int main() { int n, m; while (~scanf("%d%d", &n, &m)) { int ans = (n - 1) + n*(m - 1); printf("%d\n", ans); }}
0 0
- Uva10970 Big Chocolate
- UVA10970 Big Chocolate
- uva10970- Big Chocolate
- UVa10970 Big Chocolate
- UVa10970-思维||记忆化-Big Chocolate
- Big Chocolate
- Big Chocolate
- UVa 10970 - Big Chocolate
- uva 10970 Big Chocolate
- UVA 10970 - Big Chocolate
- uva 10970 - Big Chocolate
- 10970 - Big Chocolate
- Uva-10970-Big Chocolate
- UVA 10970 Big Chocolate
- 10970 - Big Chocolate
- UVA 10970 Big Chocolate
- UVa 10970 - Big Chocolate
- UVA 10970 Big Chocolate
- ld script 命令摘录
- 代理模式
- 从头认识Spring-2.3 注解装配-@autowired(1)-通过属性域注入
- redis练习手册<五>Redis 命令
- Count the Colors (ZOJ_1610) 线段树 + 线段统计
- uva10970- Big Chocolate
- 菜单
- uva10340 -All in All
- H5的拖曳效果示例
- RDO Stack Exception: UnboundLocalError: local variable 'logFile' referenced before assignment
- 全网优秀IT博客导航
- Shiro教程
- POJ 2536 Gopher II(二分图最大匹配)
- RxJava中的常用操作符