Cod sursa(job #2529989)
| Utilizator | Data | 24 ianuarie 2020 11:31:31 | |
|---|---|---|---|
| Problema | Indep | Scor | 25 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.63 kb |
#include <fstream>
#include <algorithm>
using namespace std;
ifstream cin("indep.in");
ofstream cout("indep.out");
int cmmdc(int a, int b)
{
int c;
while (b)
{
c = a % b;
a = b;
b = c;
}
return a;
}
int n;
long long v[505], d[1005];
int main()
{
cin >> n;
for(int i = 1; i <= n; i++)
cin >> v[i];
// for(int i = 1; i <= n; i++)
//d[i] = 1;
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= 1000; j++)
{
d[cmmdc(v[i], j)] += d[j];
}
d[v[i]]++;
}
cout << d[1];
return 0;
}
