Pagini recente » Profil green | Borderou de evaluare (job #367054) | Cod sursa (job #2058844) | Cod sursa (job #150943) | Cod sursa (job #2079217)
#include <iostream>
#include <fstream>
using namespace std;
ifstream fin("indep.in");
ofstream fout("indep.out");
int euclid(int a, int b)
{
while(b)
{
int r=a%b;
a=b;
b=r;
}
return a;
}
int main()
{
int n, v[510], S[510], sum=0;
fin >> n;
for(int i=1;i<=n;i++)
{
fin >> v[i];
S[i]=1;
}
for(int i=2;i<=n;i++)
for(int j=1;j<i;j++)
if(euclid(v[i],v[j])==1)
++S[i];
for(int i=1;i<=n;i++)
sum+=S[i];
fout << sum;
return 0;
}