CF1203C.Common Divisors
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
You are given an array a consisting of n integers.
Your task is to say the number of such positive integers x such that x 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 a will be [2,4,6,2,10] , then 1 and 2 divide each number from the array (so the answer for this test is 2 ).
输入格式
The first line of the input contains one integer n ( 1≤n≤4⋅105 ) — the number of elements in a .
The second line of the input contains n integers a1,a2,…,an ( 1≤ai≤1012 ), where ai is the i -th element of a .
输出格式
Print one integer — the number of such positive integers x such that x 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