Pagini recente » Cod sursa (job #2966002) | Cod sursa (job #1183922) | Cod sursa (job #167297) | Cod sursa (job #307387) | Cod sursa (job #2732659)
#include <bits/stdc++.h>
#define ll long long
#define int ll
using namespace std;
ifstream f("indep.in");
ofstream g("indep.out");
int n,v[505];
int dp[505][1005];
int sum[505][1005];
main()
{
f>>n;
for(int i=1;i<=n;++i)
{
f>>v[i];
dp[i][v[i]]=1;
}
for(int i=1;i<=n;++i)
{
for(int gcd = 1; gcd <=1000; ++gcd)
{ int k = __gcd(gcd,v[i]);
dp[i][k] += sum[i-1][gcd];
}
for(int gcd = 1 ; gcd <= 1000 ; ++gcd )
{
sum[i][gcd] = sum[i-1][gcd]+dp[i][gcd];
}
}
int ans = 0;
for(int i=1;i<=n;++i)
ans+=dp[i][1];
g<<ans<< ' ';
return 0;
}