UVA - 10970 Big Chocolate
来源:互联网 发布:python统计字符串个数 编辑:程序博客网 时间:2024/05/17 02:27
题目大意:给出 M*N 的巧克力,切成 1*1,问需要切几刀,分开的不能一起切。
解题思路:水,找规律
#include<iostream> #include<cstdio>#include<cstring>#include<cstdlib>#include<cmath>using namespace std;int main() { int M, N; while(scanf("%d%d", &M, &N) != EOF) { printf("%d\n", M * N - 1); }return 0;}
0 0
- UVa 10970 - Big Chocolate
- uva 10970 Big Chocolate
- UVA 10970 - Big Chocolate
- uva 10970 - Big Chocolate
- Uva-10970-Big Chocolate
- UVA 10970 Big Chocolate
- UVA 10970 Big Chocolate
- UVa 10970 - Big Chocolate
- UVA 10970 Big Chocolate
- uva 10970 Big Chocolate
- Uva - 10970 - Big Chocolate
- uva 10970 - Big Chocolate
- uva 10970 Big Chocolate
- UVa 10970 - Big Chocolate
- UVA 10970 Big Chocolate
- uva 10970 Big Chocolate
- UVa 10970 - Big Chocolate
- UVA 10970 Big Chocolate
- POJ2109 高精度(含大数开方)+二分
- LLVM与Clang的概述及关系
- 揭示java序列化算法
- UVA - 10719 Quotient Polynomial
- 字串
- UVA - 10970 Big Chocolate
- hdoj 1715 (+基础练习一) 大菲波数 【大数 + 斐波那契】
- poj 2288Islands and Bridges
- UVA - 10177 (2/3/4)-D Sqr/Rects/Cubes/Boxes?
- 如何等到嵌套的block执行完后再执行其他代码?
- 创业计划书学习笔记一——创意的形成与初筛
- XIB文件上UIScrollView的约束
- [网络流]poj1698 Alice's chance
- HDU1551