kuronekonano的博客

Given a number N, you are asked to count the number of integers between A and B inclusive which are relatively prime to N. Two integers are said to be co-prime or relatively prime if they have no co...

XXX is puzzled with the question below: 1, 2, 3, …, n (1<=n<=400000) are placed in a line. There are m (1<=m<=1000) operations of two kinds. Operation 1: among the x-th number to the y...

给出数列，给出区间，查询区间内值之积是否能整除给出的数字X。那么即查询数字X的质因数个数是否符合区间内所有值的质因数个数。一旦每个质因数个数都大于X的质因数个数，即可以整除X。首先预处理出序列中所有数的质因数。然后哈希记录每个质因数都在哪些位置的数值上出现了。如，质数2是位置1，3，4，5的值的质因数。并且，如果一个位置上的值出现了多次同一个质因数，也就是说如数值8在位置3，那么8内有...