Хабру — 14 лет 
#pragma omp parallel for
for (i = 0; i < n; i++) {
__m128d sum = _mm_setzero_pd();
int j;
for (j = 0; j < n; j += 2) {
__m128d b = _mm_set_pd(v[j],v[j+1]);
__m128d a = _mm_set_pd(A(i,j), A(i,j+1));
sum = _mm_add_pd(sum, _mm_div_pd(b, a));
}
out[i] = sum[0] + sum[1];
}
}
Two sets are equal if and only if every element of each set is contained in the other (each is a subset of the other). A set is less than another set if and only if the first set is a proper subset of the second set (is a subset, but is not equal). A set is greater than another set if and only if the first set is a proper superset of the second set (is a superset, but is not equal).
If multiple items are minimal, the function returns the first one encountered.
def duren(a):
lo, hi = 1 if a else 0, a
while lo + 1 < hi:
mid = (lo + hi) // 2
if mid * mid > a:
hi = mid
else:
lo = mid
print(lo)
duren(123456789 ** 2)