|
|
|
|
|
|
|
|
|
|
var fact = function (x) {
return x(x); }(function (x) { return function (y) { return function (f) { return function (n) { return function (p) { return function (t) { return function (e) { return p(t)(e); } }; }(function (n) { return n(function (x) { return function (x) { return function (y) { return y; }; }; })(function (x) { return function (y) { return x; }; }); }(n))(function (n) { return function (f) { return function (x) { return f(n(f)(x)); }; }; }(function (f) { return function (x) { return x; }; }))(function (x) { return function (n) { return function (m) { return function (f) { return n(m(f)); }; }; }(n)(f(function (n) { return function (s) { return function (z) { return function (p) { return p(function (x) { return function (y) { return y; }; }); }(n(function (p) { return function (a) { return function (b) { return function (t) { return t(a)(b); }; }; }(s(function (p) { return p(function (x) { return function (y) { return x; }; }); }(p)))(function (p) { return p(function (x) { return function (y) { return x; }; }); }(p)); })(function (a) { return function (b) { return function (t) { return t(a)(b); }; }; }(z)(z))); }; }; }(n)))(x); }); }; }(x(x))(y); }; }); |
|
|
|
|
|
|
static const __m256 bv = [](void) -> __m256
{ float temp[]{ b, b, b, b, b, b, b, b }; return _mm256_load_ps(temp); }(); __m256 thetadt = [&dt](void) -> __m256 { float temp[]{ dt / theta, dt / theta, dt / theta, dt / theta, dt / theta, dt / theta, dt / theta, dt / theta }; return _mm256_load_ps(temp); }(); for (int i = 0; i < count / 8; ++i) { // vs += (vs - (vs * vs * vs) / 3.f - ws - iext - ins) * exprdtv __m256 nv = _mm256_mul_ps(vs[i], _mm256_mul_ps(vs[i], vs[i])); nv = _mm256_sub_ps(vs[i], _mm256_div_ps(nv, div3)); nv = _mm256_sub_ps(nv, ws[i]); nv = _mm256_add_ps(nv, iextv); nv = _mm256_add_ps(nv, ins[i]); nv = _mm256_mul_ps(nv, exprdtv); vs[i] = _mm256_add_ps(vs[i], nv); // ws += (vs - av - ws * bv) * thetadt nv = _mm256_sub_ps(vs[i], av); nv = _mm256_sub_ps(nv, _mm256_mul_ps(ws[i], bv)); ws[i] = _mm256_add_ps(ws[i], _mm256_mul_ps(nv, thetadt)); } for (int i = 0; i < count / 8; ++i) { _mm256_storeu_ps(&neuronsV[i * 8], vs[i]); _mm256_storeu_ps(&neuronsW[i * 8], ws[i]); } } // scalar edition for (int i = 0; i < neuronsV.size() % 8; ++i) { auto off = neuronsV.size() - 1 - i; auto& v = neuronsV[off]; auto& w = neuronsW[off]; auto& in = neuronsIn[off]; v += (v - (v * v * v) / 3.f - w - iext - in) * expr * dt; w += (v - a - w * b) * dt / theta; } std::ranges::fill(neuronsIn, 0.f); |
|
Синтаксис раста -- услада для глаз, всем советую
|
|
|
if (n % i == 0) {
v.push_back(i); // condition to check the // divisor is not the number itself if (n / i != i) { v.push_back(n / i); } } } // return the vector return v; } // Function to check if the number // is abundant or not bool checkAbundant(int n) { vector<int> v; int sum = 0; // find the divisors using function v = factors(n); // sum all the factors for (int i = 0; i < v.size(); i++) { sum += v[i]; |
|
блять как же я люблю плюсы, я ебал
|
