Pagini recente » Cod sursa (job #1964732) | Cod sursa (job #2780020) | Istoria paginii runda/3333333333/clasament | Cod sursa (job #2795003) | Cod sursa (job #2952220)
#include <fstream>
using namespace std;
ifstream fin("indep.in");
ofstream fout("indep.out");
int n, v[505], cnt, x[505];
int gcd(int a, int b) {
while(b != 0) {
int r = a % b;
a = b;
b = r;
}
return a;
}
bool valid(int k) {
if(k == 1) {
return false;
}
int cmmdc = gcd(v[x[1]], v[x[2]]);
for(int i = 3; i <= k; i++) {
cmmdc = gcd(cmmdc, v[x[k]]);
}
return (cmmdc == 1);
}
void back(int k) {
for(int i = x[k - 1] + 1; i <= n; i++) {
x[k] = i;
if(valid(k)) {
cnt++;
}
if(k < n) {
back(k + 1);
}
}
}
int main() {
fin >> n;
for(int i = 1; i <= n; i++) {
fin >> v[i];
}
back(1);
fout << cnt;
return 0;
}