#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
const int N=1e7+2;
int n,k,z;
int q=1e7;
int a[N];
int main(){

	cin.sync_with_stdio(false);
	ios::sync_with_stdio(0);
	cin.tie(0);cout.tie(0);
	cin>>n;
	for(int i=1;i<=n;i++){
		cin>>a[i];
		if(q>a[i]){
			q=a[i];
		}
	}
	for(int i=1;i<=q;i++){
		for(int j=1;j<=n;j++){
			if(a[j]%i!=0){
				continue;
			}
			if(j==n){
				z++;
			}
		}	
	}
	cout<<z;
//	cout<<12; 只输出12都过俩点


	return 0;
}

0 comments

No comments so far...

Information

ID
204
Time
1000ms
Memory
256MiB
Difficulty
9
Tags
# Submissions
187
Accepted
20
Uploaded By