CF1203C.Common Divisors

普及/提高-

通过率:0%

AC君温馨提醒

该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。

题目描述

You are given an array aa consisting of nn integers.

Your task is to say the number of such positive integers xx such that xx divides each number from the array. In other words, you have to find the number of common divisors of all elements in the array.

For example, if the array aa will be [2,4,6,2,10][2, 4, 6, 2, 10] , then 11 and 22 divide each number from the array (so the answer for this test is 22 ).

输入格式

The first line of the input contains one integer nn ( 1n41051 \le n \le 4 \cdot 10^5 ) — the number of elements in aa .

The second line of the input contains nn integers a1,a2,,ana_1, a_2, \dots, a_n ( 1ai10121 \le a_i \le 10^{12} ), where aia_i is the ii -th element of aa .

输出格式

Print one integer — the number of such positive integers xx such that xx divides each number from the given array (in other words, the answer is the number of common divisors of all elements in the array).

输入输出样例

  • 输入#1

    5
    1 2 3 4 5
    

    输出#1

    1
    
  • 输入#2

    6
    6 90 12 18 30 18
    

    输出#2

    4
    
首页