HBC237534[JSOI2015]字符串树,可持久化trie树,可持久化数据结构GCD题解

题库丰富多样，涵盖各个领域，全网最全C++题库，让您在练习中不断成长！

Bob is interested in GCDs . Formally, for some positive integers , we denote gcdgcd gcd as the greatest positive integer ddd, such that d∣aid|a_id∣ai for each 1≤i≤k1leq ileq k1≤i≤k. Bob has chosen an interval [l,r][l,r][l,r]. He is going to choose kkk distinct integers from the interval and compute their GCD. There are many integers that can be the final answer, and Bob is curious in the number of such integers. Please write a program to tell him the answer.

Bob is interested in GCDs (Greatest Common Divisors). Formally, for some positive integers (a1,...,ak)(a_1,...,a_k)(a1​,...,ak​), we denote gcd⁡(a1,...,ak)gcd (a_1,...,a_k)gcd(a1​,...,ak​) as the greatest positive integer ddd, such that d∣aid|a_id∣ai​ for each 1≤i≤k1leq ileq k1≤i≤k. Bob has chosen an interval [l,r][l,r][l,r]. He is going to choose kkk distinct integers from the interval and compute their GCD. There are many integers that can be the final answer, and Bob is curious in the number of such integers. Please write a program to tell him the answer.

不断学习，不断挑战，才能在编程领域中脱颖而出！全网最全C++题库，助您成为编程高手！

标签： HBC237534[JSOI2015]字符串树 可持久化trie树 可持久化数据结构GCD题解