蓝桥杯之切割、XYZ

4.切割 - 蓝桥云课 (lanqiao.cn)https://www.lanqiao.cn/problems/17096/learning/?page=1&first_category_id=1&difficulty=20&tags=2023,%E5%9B%BD%E8%B5%9B求两数的最小公因数

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N=0;

set<int> s;

int main()
{
  int w,h;
  cin>>w>>h;

  for(int i=1;i<=w/i;i++)
  {
    if(w%i==0)
    {
      if(h%i==0&&i!=1)
      s.insert(i);
      if(h%(w/i)==0&&w/i!=1)
      s.insert(w/i);
    }
  }

  if(s.size()==0)
  cout<<0;
  else
  cout<<(LL)w/(*s.begin())*h/(*s.begin());

  return 0;
}

5.XYZ - 蓝桥云课 (lanqiao.cn)https://www.lanqiao.cn/problems/17097/learning/?page=1&first_category_id=1&difficulty=20&tags=2023,%E5%9B%BD%E8%B5%9B单纯找规律

#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N=0;

int main()
{
  int n;
  cin>>n;

  for(int i=0;i<n;i++)
  {
    int l,r;
    scanf("%d%d",&l,&r);

    if(2ll*l>r)
    cout<<0<<endl;
    else
    {
      LL s=r-2ll*l+1;
      cout<<s*(s+1)/2<<endl;
    }

  }
  
  return 0;
}