[蓝桥杯2019初赛]矩形切割
#include <iostream>
using namespace std;
long long n,a[100001];
long long min=999999999,max=-1;
long dis;
int main() {
long long sum=0;
int n=2019,m=324;
while(n!=m){
if(n<m){
int temp=m;
m=n;
n=temp;
}
n=n-m;
sum++;
}
cout<<sum+1;
return 0;
}
答案是21