50,854
社区成员
![](https://csdnimg.cn/release/cmsfe/public/img/topic.427195d5.png)
![](https://csdnimg.cn/release/cmsfe/public/img/me.40a70ab0.png)
![](https://csdnimg.cn/release/cmsfe/public/img/task.87b52881.png)
![](https://csdnimg.cn/release/cmsfe/public/img/share-circle.3e0b7822.png)
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1e3+10;
int n,m;
int f[N][N];
int gcd(int a,int b)
{
return b==0?a:gcd(b,a%b);
}
int main()
{
cin>>n>>m;
for(int i=1; i<=n; i++) cin>>f[i][i];
for(int i=n-1; i>=1; i--)
for(int j=i+1; j<=n; j++)
f[i][j]=gcd(f[i][i],f[i+1][j]);
while (m -- )
{
int l,r;
cin>>l>>r;
cout<<f[l][r]<<endl;
}
return 0;
}