Pagini recente » Cod sursa (job #1122617) | Cod sursa (job #950) | Cod sursa (job #403448) | Cod sursa (job #2509744) | Cod sursa (job #2610625)
#include <bits/stdc++.h>
using namespace std;
ifstream in("indep.in");
ofstream out("indep.out");
int n,a[501];
long long sum;
int cmmdc(int a,int b)
{
int rest;
while(b)
{
rest=a%b;
a=b;
b=rest;
}
return a;
}
int main()
{
in>>n;
for(int i=1;i<=n;i++)
in>>a[i];
for(int i=1;i<=n;i++)
{
int last=i;
if(a[i]==1)
sum++;
for(int j=i+1;j<=n;j++)
if( cmmdc(a[i],a[j])==1 )
{
sum+=pow(2,n-last-1);
last=j;
}
}
out<<sum;
return 0;
}