UVa 10970
2016-06-16 17:07
204 查看
问题描述:把一个m*n的长方形切成mn个1*1的方块,最少需要切几刀(不能用同一刀同时去切已经分成两块的长方形),问最少需要切的刀数?
#include <cstdio>
using namespace std;
int n,m;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
printf("%d\n",n*m-1);
}
return 0;
}
#include <cstdio>
using namespace std;
int n,m;
int main()
{
while(scanf("%d%d",&n,&m)!=EOF)
{
printf("%d\n",n*m-1);
}
return 0;
}
相关文章推荐
- 1.10055 - Hashmat the brave warrior
- 2.10071 - Back to High School Physics
- 3.458 - The Decoder
- 4.694 - The Collatz Sequence
- 6.494 - Kindergarten Counting Game
- 7.490 - Rotating Sentences
- 8.414 - Machined Surfaces
- 9.488 - Triangle Wave
- A.457 - Linear Cellular Automata
- B.489 - Hangman Judge
- C.445 - Marvelous Mazes
- 1.10494 - If We Were a Child Again
- 2.424 - Integer Inquiry
- 3.10250 - The Other Two Trees
- 5.465 - Overflow
- 6.113 - Power of Cryptography
- 7.10161 - Ant on a Chessboard
- 8.621 - Secret Research
- 9.401 - Palindromes
- A.537 - Artificial Intelligence?