蓝桥杯——矩形切割

#include<iostream>
using namespace std;
int main(){
    int a=2019,b=324;
    int res=0;
    while(a!=b){
        if(a-b>b){
            a-=b;
            res++;
        }else{
            int t=a;
            a=b;
            b=t-b;
            res++;
        }
    }
    cout<<res+1<<endl;
    return 0;
}