Cod sursa(job #2465740)
| Utilizator | Data | 30 septembrie 2019 19:10:31 | |
|---|---|---|---|
| Problema | Indep | Scor | 0 |
| Compilator | cpp-64 | Status | done |
| Runda | Arhiva de probleme | Marime | 0.59 kb |
#include <bits/stdc++.h>
#define ll long long
using namespace std;
ifstream f("indep.in");
ofstream g("indep.out");
ll pd[550], n, v[550];
ll cmmdc(ll a, ll b)
{
ll r;
while(b)
{
r = a % b;
a = b;
b = r;
}
return a;
}
int main()
{
f >> n;
for(int i = 1; i <= n; ++i)
{
f >> v[i];
pd[i] = 1;
}
for(int i = 1; i <= n; ++i)
for(int j = 1; j <= i - 1; ++j)
if(cmmdc(i,j) == 1)
pd[i] += pd[j];
g << pd[n];
f.close();
g.close();
return 0;
}
