hdu 5726 gcd rmq 求相同gcd的区间数量
Give you a sequence of N(N≤100,000) integers : a1,…,an(0#include <bits/stdc++.h>using namespace std;typedef long long ll;int n;int gd[100100][18];map<int,long long> mp;int gcd(int a,int b){ r
