Pagini recente » Cod sursa (job #2686455) | Cod sursa (job #3166603)
#include <fstream>
#define N 501
std::ifstream fin("indep.in");
std::ofstream fout("indep.out");
int n, arr[N]; long long int dp[N][N];
int cmmdc(int a, int b){
if(b == 0)
return a;
return cmmdc(b, a % b);
}
int main(){
fin >> n;
int mx = -1;
for(int i = 1; i <= n; i++){
fin >> arr[i];
dp[i][arr[i]] = 1;
mx = std::max(arr[i], mx);
}
for(int i = 2; i <= n; i++)
for(int k = 1; k < i; k++)
for(int g = 1; g <= mx; g++)
dp[i][cmmdc(g, arr[i])] += dp[k][g];
long long int sum = 0;
for(int i = 1; i <= n; i++){
sum += dp[i][1];
}
fout << sum;
}