zoukankan      html  css  js  c++  java
  • hdu 5640 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(1≤n,m≤10000) . 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(T≤1000), the number of the testcases.
    
    For each testcase, the first line and the only line contains two positive numbers n,m(1≤n,m≤10000).
    Output
    For each testcase, print a single number as the answer.
    Sample Input
    2
    2 3
    2 5
     
    Sample Output
    3 
    4
    hint:
     
    For the first testcase you can divide the into one cake of $2	imes2$ , 2 cakes of $1	imes 1$
    Source
     

    模拟,过程类似求gcd,每次减去最小的边即可。

     1 #pragma comment(linker, "/STACK:1024000000,1024000000")
     2 #include<iostream>
     3 #include<cstdio>
     4 #include<cstring>
     5 #include<cmath>
     6 #include<math.h>
     7 #include<algorithm>
     8 #include<queue>
     9 #include<set>
    10 #include<bitset>
    11 #include<map>
    12 #include<vector>
    13 #include<stdlib.h>
    14 #include <stack>
    15 using namespace std;
    16 #define PI acos(-1.0)
    17 #define max(a,b) (a) > (b) ? (a) : (b)
    18 #define min(a,b) (a) < (b) ? (a) : (b)
    19 #define ll long long
    20 #define eps 1e-10
    21 #define MOD 1000000007
    22 #define N 1000000
    23 #define inf 1e12
    24 int n,m;
    25 int main()
    26 {
    27    int t;
    28    scanf("%d",&t);
    29    while(t--){
    30       scanf("%d%d",&n,&m);
    31       int ans=0;
    32       while(n!=m){
    33          ans++;
    34          if(n>m) n-=m;
    35          else m-=n;
    36       }
    37       printf("%d
    ",ans+1);
    38 
    39    }
    40     return 0;
    41 }
    View Code
  • 相关阅读:
    codevs 1202 求和
    codevs 1201 最小数和最大数
    nyist 240 小明的调查统计(二)
    nyist28大数阶乘
    nyist 626 intersection set
    【】小技巧】CSS文字两端对齐
    Vue.js项目模板搭建
    25个最基本的JavaScript面试问题及答案
    java抽象类与接口的区别及用法
    JQuery事件手册
  • 原文地址:https://www.cnblogs.com/UniqueColor/p/5285502.html
Copyright © 2011-2022 走看看