Pagini recente » Cod sursa (job #992362) | Cod sursa (job #2426187) | Cod sursa (job #2728398) | Cod sursa (job #895169) | Cod sursa (job #2315565)
#include <bits/stdc++.h>
using namespace std;
ifstream in("indep.in");
ofstream out("indep.out");
long long dp[505][1005],v[505],Max;
int main()
{
int n;
in >> n;
for (int i = 1; i<=n; i++)
{
in >> v[i];
Max = max(Max,v[i]);
}
dp[1][v[1]] = 1;
for (int i = 2; i<=n; i++)
{
for (int j = 1; j<=Max; j++)
{
dp[i][__gcd(v[i],1LL*j)]+=dp[i-1][j];
dp[i][j]+=dp[i-1][j];
}
dp[i][v[i]]++;
}
out << dp[n][1];
}