Pagini recente » Cod sursa (job #127693) | Cod sursa (job #1172439) | Cod sursa (job #2854428) | Cod sursa (job #1462355) | Cod sursa (job #1348445)
#include <fstream>
using namespace std;
ifstream fin ("indep.in");
ofstream fout ("indep.out");
const int N = 505, Nr = 1005;
int d[N][Nr], n;
int gcd(int a, int b) {
if (!b)
return a;
else
return gcd(b, a % b);
}
int main() {
fin >> n;
for (int x, i = 1; i <= n; ++i) {
fin >> x;
for (int j = 1; j <= Nr; ++j) {
d[i][gcd(x, j)] += d[i-1][j];
d[i][j] += d[i-1][j];
}
d[i][x]++;
}
fout << d[n][1];
}