Pagini recente » Cod sursa (job #1575116) | Cod sursa (job #2780376) | Borderou de evaluare (job #1481036) | Cod sursa (job #825117) | Cod sursa (job #2295918)
#include <bits/stdc++.h>
#define N 501
#define ll long long
#define f first
#define s second
using namespace std;
ifstream in("indep.in");
ofstream out("indep.out");
int a[N*2+1];
int gcd(int a,int b){
if(!a || !b)
return a+b;
if(a>b)
return gcd(a%b,b);
return gcd(a,b%a);
}
int main(){
int i,n,x;
in>>n;
while(n--){
cin>>x;
for(i=1; i<=N*2; ++i)
if(a[i])
a[gcd(x,i)]+=a[i];
++a[x];
}
out<<a[1];
return 0;
}