奋斗冰棍

文章
2
资源
0
加入时间
3年0月9天

GCD HDU - 5726 线段树+数学

Give you a sequence ofN(N≤100,000)N(N≤100,000)integers :a1,...,an(0<ai≤1000,000,000)a1,...,an(0<ai≤1000,000,000). There areQ(Q≤100,000)Q(Q≤100,000)queries. For each queryl,rl,ryou have to...