Pagini recente » Cod sursa (job #1157047) | Rating Puitel Teodora (Teo_P_02) | Cod sursa (job #175898) | Cod sursa (job #1245489) | Cod sursa (job #1245334)
#include<bits/stdc++.h>
using namespace std;
ifstream fin("indep.in");
ofstream fout("indep.out");
const int NMAX=505;
const int XMAX=1005;
int n,a[NMAX];
long long sol,dp[XMAX],dpaux[XMAX];
inline int gcd(int x,int y)
{
if (y==0) return x;
else return gcd(y,x%y);
}
int main()
{
int i,j,rez;
fin>>n;
for (i=1;i<=n;i++) fin>>a[i];
dp[a[1]]=1;
if (a[1]==1) sol=1;
for (i=2;i<=n;i++)
{
for (j=1;j<=1000;j++) dpaux[j]=0;
for (j=1;j<=1000;j++)
{
rez=gcd(a[i],j);
dpaux[rez]+=dp[j];
if (rez==1) sol+=dp[j];
}
for (j=1;j<=1000;j++) dp[j]+=dpaux[j];
dp[a[i]]++;
}
fout<<sol<<"\n";
return 0;
}