zoukankan      html  css  js  c++  java
  • HDU 5640 King's Cake

    King's Cake

    Problem Description
    It is the king's birthday before the military parade . The ministers prepared a rectangle cake of size n×m(1n,m10000) . The king plans to cut the cake himself. But he has a strange habit of cutting cakes. Each time, he will cut the rectangle cake into two pieces, one of which should be a square cake.. Since he loves squares , he will cut the biggest square cake. He will continue to do that until all the pieces are square. Now can you tell him how many pieces he can get when he finishes.
     
    Input
    The first line contains a number T(T1000), the number of the testcases.
    For each testcase, the first line and the only line contains two positive numbers n,m(1n,m10000).
     
    Output
    For each testcase, print a single number as the answer.
     
    Sample Input
    2
    2 3
    2 5
     
    Sample Output
    3
    4
     
    Recommend
    wange2014
    题目大意:阅兵式前一天,是国王的生日,大臣们为他准备了一个 n *m(1<=n, m<=10000)的蛋糕。他准备切蛋糕,但他切蛋糕有奇奇怪怪的癖好,他每次只切一刀,切下一个正方形蛋糕。请问它最多能切出多少个正方形蛋糕?
    思路:看图
     
    #include <iostream>
    #include <cstdio>
    using namespace std;
    int t;
    int f(int m, int n)
    {
            if(m<n) return (f(n,m));
            t += m/n;
            if(m%n==0) return 0;
            f(n,m%n);
    }
    int main()
    {
            int m, n, T;
            scanf("%d", &T);
            while(T--)
            {
            scanf("%d%d", &m, &n);
            t=0;
            f(m, n);
            printf("%d
    ", t);
            }
            return 0;
    }
  • 相关阅读:
    奔跑的绵羊js
    13.差分
    12.子矩阵的和
    11.前缀和
    10.高精度除法
    9.高精度乘法
    8.高精度减法
    7.高精度加法
    6.数的三次方根
    5.数的范围
  • 原文地址:https://www.cnblogs.com/Noevon/p/5425955.html
Copyright © 2011-2022 走看看