zoukankan      html  css  js  c++  java
  • 2015 HUAS Provincial Select Contest #1~D

    Mohammad has recently visited Switzerland. As he loves his friends very much, he decided to buy some chocolate for them, but as this fine chocolate is very expensive (You know Mohammad is a little BIT stingy!), he could only afford buying one chocolate, albeit a very big one (part of it can be seen in figure 1) for all of them as a souvenir. Now, he wants to give each of his friends exactly one part of this chocolate and as he believes all human beings are equal (!), he wants to split it into equal parts.

    The chocolate is an M × N rectangle constructed from M × N unit-sized squares. You can assume that Mohammad has also M × N friends waiting to receive their piece of chocolate.

    To split the chocolate, Mohammad can cut it in vertical or horizontal direction (through the lines that separate the squares). Then, he should do the same with each part separately until he reaches M × N unit size pieces of chocolate. Unfortunately, because he is a little lazy, he wants to use the minimum number of cuts required to accomplish this task.

    Your goal is to tell him the minimum number of cuts needed to split all of the chocolate squares apart.

    Input

    The input consists of several test cases. In each line of input, there are two integers 1 ≤ M ≤ 300, the number of rows in the chocolate and 1 ≤ N ≤ 300, the number of columns in the chocolate. The input should be processed until end of file is encountered.

    Output

    For each line of input, your program should produce one line of output containing an integer indicating the minimum number of cuts needed to split the entire chocolate into unit size pieces.

    Sample Input

    2 2

    1 1

    1 5

    Sample Output

    3

    0

    4

    解题思路:其实这个题目只要看下它举出的例子就大概可以猜出来了,就是将输入的两个数相乘减去1即可。

    程序代码:

    #include <stdio.h>
    int main()
    {
     int m,n;
     while(scanf("%d%d",&m,&n)!=EOF)
     {
      int t=m*n-1;
      printf("%d ",t);
     }
     return 0;
    }

  • 相关阅读:
    XSS
    XSS练习小游戏
    CTF中常见的编码
    BugkuCTF
    A、B、C、D和E类IP地址
    JDK和JRE的区别及配置
    SQL注入漏洞测试(HTTP头注入)
    MS17-010远程溢出漏洞(CVE-2017-0143)拿权限
    SQL注入——布尔型盲注注入攻击——手工注入篇——SQL手工注入漏洞测试(MySQL数据库)
    mysql增删改查
  • 原文地址:https://www.cnblogs.com/chenchunhui/p/4678648.html
Copyright © 2011-2022 走看看