Pagini recente » Cod sursa (job #2592095) | Cod sursa (job #2146258) | Cod sursa (job #374416) | Cod sursa (job #1911468) | Cod sursa (job #2655831)
#include <fstream>
using namespace std;
ifstream f ( "indep.in" );
ofstream g ( "indep.out" );
const int N = 501;
int v[N];
bool cmmdc ( int x, int y ){
while ( y != 0 ){
int r = x % y;
x = y;
y = r;
}
return x == 1;
}
int main()
{ int n, i, j;
long long ans = 0;
f >> n;
for ( i = 1; i <= n; i++ )
f >> v[i];
for ( i = 1; i <= n; i++ )
for ( j = i + 1; j <= n; j++ )
if ( cmmdc ( v[i], v[j] ) == 1 )
ans += ( 1 << ( n - j ) );
g << ans;
return 0;
}