Данный отчёт сгенерирован 10.02.2023 18:21:31 UTC.
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
HTML версия (этот сайт) сгенерирован 10.02.2023 18:21:38 UTC.
Коммит: [bfeb65b9] add automatic zip creation 10.02.2023 18:21:31
Задача: Непарні доданки Фібоначчі
10.02.2023 18:21:31
Описание: Визначте функцію f(n), яка повертає суму непарних членів ряду Фібоначчі,
які за розміром не перевищують числа n.
Наприклад, f(4) = 1 + 1 + 3 = 5 (число 2 парне, тож у суму не увійшло).
10.02.2023 18:21:31
Решений: 141
10.02.2023 18:21:31
Непарні доданки Фібоначчі
10.02.2023 18:21:31
function f(n){
let result = 1;
let number = 0;
let number2 = 1;
let number3 = number + number2
if (n == 0){
return 0
}
while(number3<=n){
if (number3%2!=0){
console.log(number3)
result += number3
}
number = number2
number2 = number3
number3 = number + number2
}
return result
}
function f(n)
{
let i1 = 0
let i2 = 1
let s = 0
let t
while(i2 <= n)
{
if(i2 % 2 != 0) s = s + i2;
t = i2
i2 = i2 + i1
i1 = t
}
return(s)
}
function f(n){
let temp = 0, num1 = 0, num2 = 1, res = 1;
while(num2 <= n)
{
temp = num1;
num1 = num2;
num2 += temp;
if(num2 % 2 == 1 && num2 <= n)
res += num2;
}
return res;
}
function f(n)
{
let a = 1;
let b = 1;
let c = 1;
while(b <= n) {
if(b % 2 == 1)
c = c + b;
let d = a + b;
a = b
b = d;
}
return c;
}
function f(n)
{
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++)
{
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f ( n ) {
let i = 1;
let a = 0;
let b = 1;
let c = b + a;
while ( c <= n ) {
if ( ( c % 2 ) != 0 ) {
i += c;
}
a = b;
b = c;
c = a + b;
}
return ( i )
}
function f(n)
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
function f(n)
{
let i;
let sum = 2;
let a = 1;
let b = 1;
for (i = 1; i <= n;)
{
let c = (a + b);
b = a;
a = c;
i = a;
if (a%2!=0&i<=n)
sum=sum+a;
}
return sum;
}
function f(n)
{
let a = 0;
let b = 1;
let c = 0;
let sum = 0;
while (b <= n)
{
if (b % 2 != 0)
{
sum += b;
}
c = b;
b += a;
a = c;
}
return sum;
}
function f(n){
let sum = 0;
let n1 = 1;
let n2 = 1;
let n3 = 0;
for(let i = 0; i <= n; i++){
if(n1 % 2 != 0 & n1 < n){
sum += n1;
}
n3 = n1 + n2;
n1 = n2;
n2 = n3;
}
return sum;
}
function f(n) {
let sum = 0;
let prev = 0, next = 1;
while(next <= n){
let temp = next;
next = prev + next;
prev = temp;
if(prev % 2 == 1) sum += prev;
}
return sum;
}
function f(n){
let a = 0
let b = 1
let t
let sum=0
while (n>=b){
t=a
a=b
b=t+a
if (a%2){
sum+=a
}
}
return sum
}
function f(n){
let t = 0, q = 0, sum = 0;
for(let fib = 1; fib <= n; q = fib, fib += t, t = q){
if(fib%2!=0){
sum += fib;
}
}
return sum;
}
function f(n){
let fib = [0, 1, 1];
let sum = 1;
for(let i = 2; fib[0]+fib[1]<=n;i++){
fib[2] = fib[0]+fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2]%2){
sum+=fib[2];
}
}
return sum;
}
function f(n) {
let prev=0
let prevcur=1
let cur=1
let sum=0
while(cur<=n) {
if (cur%2!=0) sum+=cur
prevcur=cur
cur+=prev
prev=prevcur
}
return sum
}
function f(n)
{
let sum = 2;
let fib = [1, 1];
for(let i = 2; i <= n; i++){
fib[i] = fib[i -2] + fib[i -1];
fib.push(fib[i])
if((fib[i] % 2 !== 0) && (fib[i] <= n)){
sum += fib[i];
}
}
return sum;
}
function f(n)
{
let sum = 0;
let prev = 0;
let next = 1;
for(let i = 0; next <= n; i++){
if (next % 2 != 0)
sum += next;
let temp = next;
next = prev + next;
prev = temp;
}
return sum;
}
function f ( n ) {
let i = 1;
let x = 0;
let y = 1;
let z = y + x;
while ( z <= n ) {
if ( ( z % 2 ) != 0 ) {
i += z;
}
x = y;
y = z;
z = x + y;
}
return ( i )
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for(let i = 1; i<=n; r=i, i+=pre, pre=r){
if(i%2!=0){
sum+=i;
}
}
return sum;
}
function f(n){
let result = 1;
let num = 0;
let num2 = 1;
let num3 = num + num2
if (n == 0){
return
}
while(num3<=n){
if (num3%2!=0){
console.log(num3)
result += num3
}
num = num2
num2 = num3
num3 = num + num2
}
return result
}
function f(n){
let f1 = 1;
let f2 = 1;
let f3 = 2;
let sum = 0;
if( n >= 1){
sum = 2;
}
while(n >= f3){
f1 = f2;
f2 = f3;
f3 = f2 + f1;
if(f3 % 2 != 0 && n >= f3){
sum = sum + f3;
}
}
return sum;
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n) {
let fib = [0, 1, 1]
let result = 0;
while (fib[fib.length - 1] + fib[fib.length - 2] < n) {
fib[fib.length] = fib[fib.length - 1] + fib[fib.length - 2]
}
for (let i = 0; i < fib.length; i++) {
if (fib[i] % 2 !=0) {
result += fib[i]
}
}
return result;
}
function f(n){
let arr = [1,1]
let k = 0
for (let i = 1; arr[i] < n; i++){
k = arr[i] + arr[i - 1]
if (k <= n){
arr.push(k)
} else break
}
let arr1 = []
for (let m = 0; m < arr.length; m++){
if (arr[m] % 2 != 0){
arr1.push(arr[m])
}else continue
}
let sum = 0;
for(let s = 0; s < arr1.length; s++){
sum += arr1[s];
}
return sum
}
const f = (n) => {
let temp, sum = 0, a = 0, b = 1;
while (b < n) {
if (b % 2 && b < n) {
sum += b;
};
temp = a;
a = b;
b += temp;
};
return sum;
}
function f(n)
{
let f1 = 1;
let f2 = 1;
let f3 = 2;
let sum = 0;
if( n >= 1)
{
sum = 2;
}
while(n >= f3)
{
f1 = f2;
f2 = f3;
f3 = f2 + f1;
if(f3 % 2 != 0 && n >= f3)
{
sum = sum + f3;
}
}
return sum;
}
function f(n) {
let n1 = 0;
let n2 = 1;
let answ = 0;
while (n1 + n2 <= n) {
let n3 = n1 + n2;
n1 = n2;
n2 = n3;
answ += n3 % 2 == 1 ? n3 : 0;
}
return answ+1;
}
function f(n){
let sum = 0;
let prev = 0;
let next = 1;
while (next <= n)
{
if (next % 2 !== 0) sum += next;
let temp = next;
next += prev;
prev = temp;
}
return sum;
}
function f(n){
if (n == 1)
return 1;
let sum = 2;
let v1 = v2 = 1;
for(let i = 2; i <= n; i++){
[v1, v2] = [v2, v1+v2];
if (v2 % 2 == 1 && v2 <= n)
sum += v2;
}
return sum;
}
function f ( n ) {
let i = 1;
let a = 0;
let b = 1;
let c = b + a;
while ( c <= n ) {
if ( ( c % 2 ) != 0 ) {
i += c;
}
a = b;
b = c;
c = a + b;
}
return ( i )
}
function f(n) {
let a = 0;
let b = 1;
let sum =0;
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
function f(n){
let a=1;
let b=1;
let c;
let d=2;
for (let i = 3; i <= n; i ++){
c=a+b;
a=b;
b=c;
if (((c%2)!==0) && (c<=n)){
d+=c;
}
}
return d
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let c = [1,1], i = 0, sum = 2;
function f(n){
if (n==1 || n==2){
return 2;
}
while (c[0]< n && c[1]< n){
c[i%2]=c[0]+c[1];
if (c[i%2]%2==1 && c[i%2]<=n){
sum+=c[i%2];
}
i++
}
return sum
}
function f(n){
if(n < 3)
return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a + b;
if(c > n)
break;
a = b;
b = c;
if(c % 2 !== 0)
sum += c;
}
return sum;
}
function f(n)
{
var a = 1
var b = 1
var c
var d = 2
for (var i = 3; i <= n; i ++)
{
c = a + b
a = b
b = c
if (((c % 2)!== 0) && (c <= n))
d += c
}
return d
}
function fib(m)
{
if (m < 3)
return 1;
return fib(m - 1) + fib(m - 2)
}
function f(n)
{
let m = 1;
let sum = 0;
while (fib(m) <= n)
{
if (fib(m) % 2 != 0)
sum += fib(m);
m += 1;
}
return sum;
}
function f(n)
{
let m=[1, 1];
let sum=2;
for (let i = 0; i < (n-2); i++)
{
m.push(m[i] + m[i+1]);
if ((m[i+2] % 2 != 0) && (m[i+2] <= n)) sum+=m[i+2];
}
if (n == 1) sum = 1;
if (n == 0) sum = 0;
return sum;
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
f(1000);
function f(n) {
//1+1+2+3+5+8+13...
let sum = 0;
let m = 1;
let l = 1;
let k = 0;
while(m <= n) {
if(m % 2 !== 0)
sum += m;
m = l + k;
k = l;
l = m;
}
return sum;
}
function f (n)
{
let a = 0; ///////перше значення n
let z = 1; ///////останнє значення н
let sum = 0;
let i = 0; /////змінна осатаннього значення н
while ( z <= n)
{
if ( z % 2 != 0)
{
sum = sum + z;
}
i = z;
z = z + a;
a = i;
}
return sum;
}
function fib (a) {
if (a < 3)
return 1;
return fib(a-1) + fib(a-2);
}
function f(n) {
let b = 1, sum = 0;
let t;
while(fib(b) <= n) {
if (fib(b)%2 != 0)
t = fib(b);
sum += t;
b += 1;
if (fib(b)%2 == 0)
b += 1;
}
return sum;
}
function f(n){
let f = 0;
let s = 0;
let sum = 0;
for(let i = 1; i <= n; s = i, i += f, f = s){
if(i % 2 != 0) {sum += i}
}
return sum;
}
function f (n) {
var k = []
let prev = 0, next = 1;
for(var i = 0; i < n; i++){
let temp = next;
next = prev + next;
prev = temp;
k.push(prev)
}
let o = 0
let r = 0
while (k.length > o){
if (k[o] % 2 != 0 && k[o] <= n){
r += k[o]
}
o++
}
return r;
}
function f(n){
let a = 0;
let r = 0;
let sum = 0;
for(let i = 1; i <= n; r = i, i += a, a = r){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
function f(n)
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
function f(n){
let f1 = 1;
let f2 = 1;
let sum = 2;
for (i = 3; i <= n; i++) {
fl = f1 + f2;
f1 = f2;
f2 = fl;
if(fl % 2 == 1 && fl < n){
sum += fl;
}
}
if(sum )
return sum ;
}
function f(n)
{
let f1 = 1;
let f2 = 0;
let f = 0;
let sum = 0;
while(f <= n)
{
if (f % 2 != 0)
{
sum += f;
}
f = f1 + f2;
f1 = f2;
f2 = f;
}
return sum;
}
function f(n)
{
let sum = 1;
let i = 1;
let k = 0;
let z = 1;
while(k + z <= n)
{
i = k + z;
if(i % 2 != 0)
{
sum += i;
}
k = z;
z = i;
}
return sum;
}
function f(n){
let sum = 0;
let cur = 0;
let prev = 0;
for(let i = 1;i <= n; cur=i, i+=prev,prev=cur){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
function f(n){
let t = 0
let x = 0
let sum = 0
for(let i =1;i<=n;x=i,i+=t,t=x){
if(i%2!=0) {
sum+=i
}
}
return sum
}
function f(n) {
if (n< 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a+b;
if (c>n) break;
a = b;
b = c;
if (c%2 !== 0) sum += c;
}
return sum;
}
function f(num) {
let currentNum = 1;
let sumResult = 1;
let previousNum = 1;
while (currentNum <= num) {
if (currentNum % 2 === 1) sumResult += currentNum;
[currentNum, previousNum] = [previousNum + currentNum, currentNum];
}
return sumResult;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for (let i = 1; i <= n ; r = i, i += pre, pre = r){
if(i % 2 !== 0){
sum += i;
}
}
return sum;
}
function f(n)
{
let fibnum1 = 1;
let fibnum2 = 0;
let fibnum;
let sum = 0;
for (let i = 0; i<=n && fibnum1<=n; i++)
{
if (fibnum1%2 != 0)
{
sum += fibnum1;
}
fibnum = fibnum1+fibnum2;
fibnum2 = fibnum1;
fibnum1=fibnum;
}
return sum;
}
function f(n){
let sum=0;
let vorletzte=0;
let letzte=1;
let now=1;
while(now< n){
if(now%2==1) sum+=now;
now=letzte+vorletzte;
vorletzte=letzte;
letzte=now;
}
return sum;
}
function f(n)
{
let sum = 0
let A = 0
let B = 0
for (let i = 1; i <= n; A=i, i+=B, B=A)
{
if ( i % 2 != 0)
{
sum += i
}
}
return sum
}
function f(n) {
let x = 0;
let y = 1;
let t;
let sum = 0;
while (y < n) {
t = x + y;
x = y;
y = t;
if (x % 2) {
sum += x;
} else {}
}
return sum;
}
function f(n){
let b = 0;
let a = 1;
let sum = 1;
for(let c = a + b;a + b <= n;b=a,a=c){
c = a + b;
if (c % 2 != 0){
sum += c;
}
}
return sum
}
function f(n)
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r)
{
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
function f(n)
{
let sum = 0;
let k = 0, m = 1, next;
while (k <= n)
{
next = k;
k = k + m;
m = next;
if (m % 2 !== 0)
{
sum += m;
}
}
return sum;
}
function f(n){
let temp = 0, num1 = 0, num2 = 1, res = 1;
while(num2 <= n)
{
temp = num1;
num1 = num2;
num2 += temp;
if(num2 % 2 == 1 && num2 <= n)
res += num2;
}
return res;
}
function f(n)
{
let fibEl = 1;
let addEl = 0;
let temp = 0;
let res = 0;
for(let i = 0; fibEl <= n; i++)
{
if (fibEl%2 == 1) res += fibEl;
temp = fibEl;
fibEl += addEl;
addEl = temp;
}
return res;
}
function f(n){
let fib = [0, 1, 1];
let sum = 1;
for(let i = 2; fib[0]+fib[1]<=n;i++){
fib[2] = fib[0]+fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2]%2) {
sum+=fib[2];
}
}
return sum;
}
function f(n){
let sum = 0;
let fib = 0;
let f1 = 1;
let f2 = 0;
while (fib <= n){
if (fib % 2 != 0){
sum += fib;
}
fib = f1 + f2;
f1 = f2;
f2 = fib;
}
return sum;
}
function f(n){
let a = 1
let b = 1
let sum = 1
for (let i = 3; i <= n; i++) {
if(b % 2 != 0 && b < n){
sum += b
}
let c = a + b
a = b
b = c
}
return sum
}
function f(n){
let a=1,b=1,c=0,d=2
while(c< n){
c=a+b
if(c>n){
break
}
if(c%2!=0){
d=d+c
}
a=b
b=c
}
return d;
}
function f(n) {
let m = 1;
let a = 1;
let b = 1;
while(b <= n) {
if(b % 2 == 1) m += b;
let c = a + b;
a = b
b = c;
}
return m;
}
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n){
let fib1 = 1;
let fib2 = 0;
let fib = 0;
let sum = 0;
while(fib <= n){
if(fib % 2 != 0){
sum = sum + fib;}
fib = fib1 + fib2;
fib1 = fib2;
fib2 = fib;
}
return sum;
}
function f(n)
{
let sum = 0;
let a = 0;
let b = 0;
for(let i = 1; i <= n; a = i, i += b, b = a)
{
if(i % 2 != 0)
{
sum += i;
}
}
return sum;
}
function f(n) {
let sum = 0
let prev = 0
let next = 1
while (next <= n) {
let temp = next
next = prev + next
prev = temp
if (prev % 2 != 0) {
sum += prev
}
}
return sum
}
function f(n){
let current = 2, sum = 2, previous1 = 1, previous2 = 1;
while (current <= n){
previous1 = previous2;
previous2 = current;
if(current % 2 !== 0) sum += current;
current = previous1 + previous2;
}
return sum;
}
function f(n){
let sum = 0;
let pre = 0;
let cur = 0;
for(let i = 1; i <= n; cur = i, i += pre, pre = cur){
if(i % 2 !== 0)
sum += i;
}
return sum;
}
function f(n) {
let a = 0;b =1; sum = 0
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
function f(n) {
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
console.log(f(1))
function f(n){
let arr = [1,1]
let k = 0
for (let i = 1; arr[i] < n; i++){
k = arr[i] + arr[i - 1]
if (k <= n){
arr.push(k)
} else break
}
let arr1 = []
for (let m = 0; m < arr.length; m++){
if (arr[m] % 2 != 0){
arr1.push(arr[m])
}else continue
}
let sum = 0;
for(let s = 0; s < arr1.length; s++){
sum += arr1[s];
}
return sum
}
function f(n)
{
let sum = 0;
let before1 = 0;
let before2 = 0;
let now = 1;
while (now <= n)
{
if (now%2 != 0)
sum += now;
before2 = now;
now += before1;
before1 = before2;
}
return sum;
}
function f(n)
{
let m=[1, 1];
let sum=2;
for (let i = 0; i < (n-2); i++)
{
m.push(m[i] + m[i+1]);
if ((m[i+2] % 2 != 0) && (m[i+2] < n)) sum+=m[i+2];
}
if (n == 1) sum = 1;
if (n == 0) sum = 0;
return sum;
}
function f(n) {
let p1 = 1;
let p2 = 0;
let sum = 1;
for (let i = p1 + p2; i < n; i = p1 + p2) {
p2 = p1;
p1 = i;
if (i % 2 != 0) {
sum += i;
}
}
return sum;
}
function f(n){
if (n< 3 ) return n
let a=1;
let b = 1;
let sum=2;
for(i=2; i< n; i++){
let c = (a+b);
a=b;
b=c;
if (c>n) break;
if (c%2!==0){
sum +=c}
}
return sum
}
function f(n)
{
let sum=0;
let n1=1;
let n2=0;
let n3=n1+n2;
while (n3<=n){
if (n3%2!=0)
{
sum+=n3;
}
n1=n2;
n2=n3;
n3=n1+n2;
}
return sum;
}
function f(n){
let a = 0;
let b = 1;
let answ = 0;
while (a + b <= n){
let c = a + b;
a = b;
b = c;
answ += c % 2 == 1 ? c : 0;
}
return answ + 1;
}
function f(n) {
let prev = 0
let curr = 1
let sum = 0
while (curr <= n) {
if (curr % 2 === 1) sum += curr;
[prev, curr] = [curr, curr + prev]
}
return sum
}
function f(n){
let sum = 0;
for(i = 1 ; fib(i)<=n;i++){
if(fib(i)%2!=0)
sum+=fib(i)
}
return sum;
}
function fib(n){
if(n< 3)
return 1;
return fib(n-1)+fib(n-2);
}
function f(n) {
if (n< 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a+b;
if (c>n) break;
a = b;
b = c;
if (c%2 !== 0) sum += c;
}
return sum;
}
function fib(a){
if (a< 3) return 1;
return fib(a-1)+fib(a-2)
}
function f(n){
let sum=0;
let i=1;
while (fib(i)<=n){
if (fib(i)%2==1) sum+=fib(i)
i++
}
return sum;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
function f(n)
{
var a = 1
var b = 1
var c
var d = 2
for (var i = 3; i <= n; i ++)
{
c = a + b
a = b
b = c
if (((c % 2)!== 0) && (c <= n))
d += c
}
return d
}
function f(n)
{
let x = 0;
let y = 1;
let sum =0;
for (let i = 1; i <= n && y <= n; i++)
{
if(y % 2)
{
sum += y;
}
let s = x + y;
x = y;
y = s;
}
return sum;
}
function f(n){
let first_n = 0;
let last_n = 1;
let semi_n = 0;
let sum = 0;
while (last_n<=n) {
if (last_n %2 !=0) {
sum+=last_n;
}
semi_n = last_n;
last_n += first_n;
first_n = semi_n;
}
return sum
}
function f(n)
{
let a = 0;
let b = 0;
let sum = 0;
for (let i = 1;i <= n;b = i, i += a,a = b)
{
if (i % 2 != 0)
{
sum += i;
}
}
return sum;
}
function f(n) {
if (n <= 2) {
return 2;
}
let f1 = 1;
let f2 = 1;
let sum = 2;
while (f1 + f2 <= n) {
let f3 = f1 + f2;
if (f3 % 2 == 1) {
sum += f3;
}
f1 = f2;
f2 = f3;
}
return sum;
}
function f(n){
let a=1,b=1,c=0,d=2
while(c< n){
c=a+b
if(c>n){
break
}
if(c%2!=0){
d=d+c
}
a=b
b=c
}
return d;
}
function f(n) {
let a = 0;
let b = 1;
let sum = 0;
while (b <= n) {
if (b % 2 !== 0) sum += b;
let temp = a;
a = b;
b = temp + b;
}
return sum;
}
let result = f(100);
console.log(result);
function f(n){
let a = 0, c = 0 , b = 1, sum = 1
while(c < n){
if (c%2 !== 0){
sum += c;
}
c = a + b;
a = b;
b = c;
}
return sum;
}
function f(n) {
let i = 1;
let num1 = 0;
let num2 = 1;
let num3 = num2 + num1;
while (num3 <= n) {
if ((num3 % 2) != 0 ) {
i += num3;
}
num1 = num2;
num2 = num3;
num3 = num1 + num2;
}
return (i)
}
function f(n) {
let Fib = 1, a = 0, b = 0, sum = 0;
while (Fib < n) {
if (Fib % 2 != 0)
sum += Fib;
a = Fib;
Fib = a + b;
b = Fib - (Fib - a);
}
return sum;
}
function f(n){
let g = 1;
let i = 0;
let b = 1;
let k = 1;
while (g <= n)
{
g = i + b;
if (g <= n && g % 2 != 0)
{
k = k + g;
}
i = b;
b = g;
}
return k;
}
function f(n) {
let x = 0, y = 1, sum = 0;
while(y < n) {
let a = y+x;
x = y;
y = a;
if(x % 2 != 0)
sum += x;
}
return sum;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){
sum+=i;
}
}
return sum;
}
function f(n) {
if (n <= 0) return [];
if (n === 1 ) return [0];
const array = [0,1];
while (true) {
const sum = array[array.length - 2] + array[array.length - 1];
if (sum >= n) break;
array.push(sum);
}
let b = 0;
for(let i = 0; i < array.length;i++){
if(array[i] % 2 == 1)
b += array[i]
}
return b;
}
console.log(f(5))
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n)
{
let sum = 0
let cur = 0
let prev = 0
for (let i = 1; i <= n; cur=i, i+=prev, prev=cur)
{
if (i % 2 != 0)
{
sum += i
}
}
return sum
}
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n){
let past = 0;
let t = 1;
let res = 0;
for (let i = 1; i <= n; t = i, i += past, past = t) {
if ((i% 2) != 0){
res += i;
}
}
return res;
}
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n) {
let a = 1;
let a1 = 1;
let a2 = 1;
if (n == 1) return 2;
while(a2 <= n) {
if (a2 % 2 != 0) a += a2;
[a1, a2] = [a2, a1+a2];
}
return a;
}
function f(n){
let sum = 2;
let a = 1;
let b = 1;
let c = a + b;
for(let i = 3; i <= n; i++){
c = a + b;
if( c % 2 == 1 && c < n){
sum += c
}
a = b;
b = c;
}
return sum;
}
function f(n)
{
let a = 0;
let b = 1;
let c = 0;
for (let d = 1; d <= n; b = d, d += a, a = b)
{
if ((d % 2) != 0)
{
c += d;
}
}
return c;
}
function f(n){
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
function f(n){
let t = 0, q = 0, sum = 0;
for(let fib = 1; fib <= n; q = fib, fib += t, t = q){
if(fib%2!=0){
sum += fib;
}
}
return sum;
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
let num1 = 0;
let num2 = 1;
let result = 0;
let sum = num1;
while(num2 <= n){
result = num1 + num2;
if(num2 % 2 == 1){
sum = sum + num2;
}
num1 = num2;
num2 = result;
}
return sum;
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n) {
let sum = 1 + 1
let x = 1
let q
let i = 1
while (i<=n) {
q = i
i+= x
x = q
if (i%2 !== 0 && i<=n) {
sum += i
}
}
return sum
}
function f(n){
let a = 0, c = 0 , b = 1, sum = 1;
while(c < n)
{
if (c % 2 !== 0)
sum += c;
c = a + b;
a = b;
b = c;
}
return sum;
}
function f(n){
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n) {
if (n< 3) return n;
let sum =2;
let a =1;
let b=1;
for (let i = 2; i < n; i++) {
let c=a+b;
if (c>n) break;
a=b;
b=c;
if (c%2 !==0) sum +=c;
}
return sum;
}
function f(n){
let n1 = 0, n2 = 1;
let arr = [];
let sum = 0;
arr.push(n1, n2);
do{
let tmp = n1;
n1 = n2;
n2 = tmp + n2;
arr.push(n2);
}while(n2 < n);
for(let i = 0; i < arr.length - 1; i++){
if(arr[i] % 2 != 0){
sum += arr[i];
}
}
return sum;
}
function f(n)
{
let previous = 1, current = 1, sum = 1;
let next;
while (current <= n)
{
if (current % 2 != 0){
sum += current;
}
next = current + previous;
previous = current;
current = next;
}
return (sum);
}
function f(n) {
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
let num1 = 1;
let num2 = 1;
let sum = 2;
let i = 1;
while(num2 <= n){
i = num1 + num2;
num1 = num2;
num2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
function f(n){
let prev = 0;
let next = 1;
let sum = 1;
let number = 0;
for (let i = 0; i < n; i++){
number = prev + next;
if ( number % 2 !== 0 && number < n) {
sum += number;
}
prev = next;
next = number;
}
return sum;
}
function f(n){
let num1 = 0
let num2 = 1
let sum = num2
let num3 = num1 + num2
while (num3 <= n){
num3 = num1 + num2
if (num3 <= n){
if (num3 % 2 != 0) sum = sum + num3
num1 = num2
num2 = num3
}
}
return sum
}
function f (n){
let teraz = 0 ;
let przed = 0 ;
let tu = 1 ;
let int ;
let i = 1 ;
let sum = 0 ;
while (i <= n){
int = tu ;
teraz = tu + przed ;
przed = tu ;
tu = teraz ;
i ++ ;
if (int <= n & int % 2 ==1 ){
sum += int ;
}
}
return sum ;
}
function f(n) {
if (n< 3) return n;
let sum =2;
let a =1;
let b=1;
for (let i = 2; i < n; i++) {
let c=a+b;
if (c>n) break;
a=b;
b=c;
if (c%2 !==0) sum +=c;
}
return sum;
}
function f(n){
let sum = 0;
let i =0;
let f =0;
while(f<=n){
f = fib(i);
if(f%2==1 && f<=n){
sum+=f;
//console.log("-"+f);
}
i++;
}
return sum;
}
function fib(n) {
if(n==0){
return 0;
}
let a = 1;
let b = 1;
for (let i = 3; i <= n; i++) {
let c = a + b;
a = b;
b = c;
}
return b;
}
let i = f(4);
//console.log(i)
console.log(f(1)); // 2
console.log(f(5)); // 10
console.log(f(1000)); // 1785
function f(n){
let pre = 0;
let g = 0;
let sum = 0;
for(let i =1;i<=n;g=i, i+=pre,pre=g){
if(i%2!=0){sum+=i;}
}
return (sum);
}
function f(n){
let first = 0;
let second = 1;
let sum = 0;
//debugger;
while(second<=n){
if(second%2!=0){
sum += second;
}
let tmp = first;
first = second;
second = tmp+second;
}
return(sum);
}
function f(n)
{if (n< 3) return n
let sum = 2
let a = 1
let b = 1
for (let i = 2; i< n; i++)
{let c = a+b
if (c > n) break
a=b
b=c
if (c%2 !== 0) sum += c}
return sum}
function f(n){
if (n == 1)
return 1;
let sum = 2;
let v1 = v2 = 1;
for (let i = 2; i <= n; i++){
[v1, v2] = [v2, v1 + v2];
if (v2 % 2 == 1 && v2 <= n)
sum += v2;
}
return sum;
}
function f(n) {
let a = 0;b =1; sum = 0
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2 != 0)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
function f(n) {
let fib = [0,1]
let sum = 1;
while(fib[0] + fib[1] <= n)
{
fib[2] = fib[0] + fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2] % 2 != 0) {
sum += fib[2];
}
}
return sum;
}
function f(n) {
let prev = 1,
current = 1,
next;
let sum = 0;
while (prev < n) {
if (prev % 2 != 0) sum += prev;
next = prev + current;
prev = current;
current = next;
}
return sum;
}
function f(n){
var a = [1];
var c =1;
var b = 0;
var b =[]
for (var x = 0 ;x< n*2 ;x++){
a.push(c);
c=a[a.length-2]+a[a.length-1];
}
c=0
for (var x=0 ;x< a.length-1 ;x++){
if (a[c]%2!=0){
b.push(a[c])
c=c+1;
}
else{
c=c+1;
}
if (c>n){
break
}
}
c=0
for (x =0 ;x< b.length; x++){
c=c+b[x];
if (b[x+1]>=n){
break;
}
}
return c;
}
function f(n){
let sum = 0;
let cur = 0;
let prev = 0;
for(let i = 1;i <= n; cur=i, i+=prev,prev=cur){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
function f(n) {
if (n < 3)
return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a + b;
if (c > n)
break;
a = b;
b = c;
if (c % 2 !== 0)
sum += c;
}
return sum;
}
let result = 1;
let number = 0;
let number2 = 1;
let number3 = number + number2
if (n == 0){
return 0
}
while(number3<=n){
if (number3%2!=0){
console.log(number3)
result += number3
}
number = number2
number2 = number3
number3 = number + number2
}
return result
}
{
let i1 = 0
let i2 = 1
let s = 0
let t
while(i2 <= n)
{
if(i2 % 2 != 0) s = s + i2;
t = i2
i2 = i2 + i1
i1 = t
}
return(s)
}
let temp = 0, num1 = 0, num2 = 1, res = 1;
while(num2 <= n)
{
temp = num1;
num1 = num2;
num2 += temp;
if(num2 % 2 == 1 && num2 <= n)
res += num2;
}
return res;
}
{
let a = 1;
let b = 1;
let c = 1;
while(b <= n) {
if(b % 2 == 1)
c = c + b;
let d = a + b;
a = b
b = d;
}
return c;
}
{
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++)
{
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
let i = 1;
let a = 0;
let b = 1;
let c = b + a;
while ( c <= n ) {
if ( ( c % 2 ) != 0 ) {
i += c;
}
a = b;
b = c;
c = a + b;
}
return ( i )
}
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
{
let i;
let sum = 2;
let a = 1;
let b = 1;
for (i = 1; i <= n;)
{
let c = (a + b);
b = a;
a = c;
i = a;
if (a%2!=0&i<=n)
sum=sum+a;
}
return sum;
}
{
let a = 0;
let b = 1;
let c = 0;
let sum = 0;
while (b <= n)
{
if (b % 2 != 0)
{
sum += b;
}
c = b;
b += a;
a = c;
}
return sum;
}
let sum = 0;
let n1 = 1;
let n2 = 1;
let n3 = 0;
for(let i = 0; i <= n; i++){
if(n1 % 2 != 0 & n1 < n){
sum += n1;
}
n3 = n1 + n2;
n1 = n2;
n2 = n3;
}
return sum;
}
let sum = 0;
let prev = 0, next = 1;
while(next <= n){
let temp = next;
next = prev + next;
prev = temp;
if(prev % 2 == 1) sum += prev;
}
return sum;
}
let a = 0
let b = 1
let t
let sum=0
while (n>=b){
t=a
a=b
b=t+a
if (a%2){
sum+=a
}
}
return sum
}
let t = 0, q = 0, sum = 0;
for(let fib = 1; fib <= n; q = fib, fib += t, t = q){
if(fib%2!=0){
sum += fib;
}
}
return sum;
}
let fib = [0, 1, 1];
let sum = 1;
for(let i = 2; fib[0]+fib[1]<=n;i++){
fib[2] = fib[0]+fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2]%2){
sum+=fib[2];
}
}
return sum;
}
let prev=0
let prevcur=1
let cur=1
let sum=0
while(cur<=n) {
if (cur%2!=0) sum+=cur
prevcur=cur
cur+=prev
prev=prevcur
}
return sum
}
{
let sum = 2;
let fib = [1, 1];
for(let i = 2; i <= n; i++){
fib[i] = fib[i -2] + fib[i -1];
fib.push(fib[i])
if((fib[i] % 2 !== 0) && (fib[i] <= n)){
sum += fib[i];
}
}
return sum;
}
{
let sum = 0;
let prev = 0;
let next = 1;
for(let i = 0; next <= n; i++){
if (next % 2 != 0)
sum += next;
let temp = next;
next = prev + next;
prev = temp;
}
return sum;
}
let i = 1;
let x = 0;
let y = 1;
let z = y + x;
while ( z <= n ) {
if ( ( z % 2 ) != 0 ) {
i += z;
}
x = y;
y = z;
z = x + y;
}
return ( i )
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let pre = 0;
let r = 0;
let sum = 0;
for(let i = 1; i<=n; r=i, i+=pre, pre=r){
if(i%2!=0){
sum+=i;
}
}
return sum;
}
let result = 1;
let num = 0;
let num2 = 1;
let num3 = num + num2
if (n == 0){
return
}
while(num3<=n){
if (num3%2!=0){
console.log(num3)
result += num3
}
num = num2
num2 = num3
num3 = num + num2
}
return result
}
let f1 = 1;
let f2 = 1;
let f3 = 2;
let sum = 0;
if( n >= 1){
sum = 2;
}
while(n >= f3){
f1 = f2;
f2 = f3;
f3 = f2 + f1;
if(f3 % 2 != 0 && n >= f3){
sum = sum + f3;
}
}
return sum;
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let fib = [0, 1, 1]
let result = 0;
while (fib[fib.length - 1] + fib[fib.length - 2] < n) {
fib[fib.length] = fib[fib.length - 1] + fib[fib.length - 2]
}
for (let i = 0; i < fib.length; i++) {
if (fib[i] % 2 !=0) {
result += fib[i]
}
}
return result;
}
let arr = [1,1]
let k = 0
for (let i = 1; arr[i] < n; i++){
k = arr[i] + arr[i - 1]
if (k <= n){
arr.push(k)
} else break
}
let arr1 = []
for (let m = 0; m < arr.length; m++){
if (arr[m] % 2 != 0){
arr1.push(arr[m])
}else continue
}
let sum = 0;
for(let s = 0; s < arr1.length; s++){
sum += arr1[s];
}
return sum
}
let temp, sum = 0, a = 0, b = 1;
while (b < n) {
if (b % 2 && b < n) {
sum += b;
};
temp = a;
a = b;
b += temp;
};
return sum;
}
{
let f1 = 1;
let f2 = 1;
let f3 = 2;
let sum = 0;
if( n >= 1)
{
sum = 2;
}
while(n >= f3)
{
f1 = f2;
f2 = f3;
f3 = f2 + f1;
if(f3 % 2 != 0 && n >= f3)
{
sum = sum + f3;
}
}
return sum;
}
let n1 = 0;
let n2 = 1;
let answ = 0;
while (n1 + n2 <= n) {
let n3 = n1 + n2;
n1 = n2;
n2 = n3;
answ += n3 % 2 == 1 ? n3 : 0;
}
return answ+1;
}
let sum = 0;
let prev = 0;
let next = 1;
while (next <= n)
{
if (next % 2 !== 0) sum += next;
let temp = next;
next += prev;
prev = temp;
}
return sum;
}
if (n == 1)
return 1;
let sum = 2;
let v1 = v2 = 1;
for(let i = 2; i <= n; i++){
[v1, v2] = [v2, v1+v2];
if (v2 % 2 == 1 && v2 <= n)
sum += v2;
}
return sum;
}
let i = 1;
let a = 0;
let b = 1;
let c = b + a;
while ( c <= n ) {
if ( ( c % 2 ) != 0 ) {
i += c;
}
a = b;
b = c;
c = a + b;
}
return ( i )
}
let a = 0;
let b = 1;
let sum =0;
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
let a=1;
let b=1;
let c;
let d=2;
for (let i = 3; i <= n; i ++){
c=a+b;
a=b;
b=c;
if (((c%2)!==0) && (c<=n)){
d+=c;
}
}
return d
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
function f(n){
if (n==1 || n==2){
return 2;
}
while (c[0]< n && c[1]< n){
c[i%2]=c[0]+c[1];
if (c[i%2]%2==1 && c[i%2]<=n){
sum+=c[i%2];
}
i++
}
return sum
}
if(n < 3)
return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a + b;
if(c > n)
break;
a = b;
b = c;
if(c % 2 !== 0)
sum += c;
}
return sum;
}
{
var a = 1
var b = 1
var c
var d = 2
for (var i = 3; i <= n; i ++)
{
c = a + b
a = b
b = c
if (((c % 2)!== 0) && (c <= n))
d += c
}
return d
}
{
if (m < 3)
return 1;
return fib(m - 1) + fib(m - 2)
}
function f(n)
{
let m = 1;
let sum = 0;
while (fib(m) <= n)
{
if (fib(m) % 2 != 0)
sum += fib(m);
m += 1;
}
return sum;
}
{
let m=[1, 1];
let sum=2;
for (let i = 0; i < (n-2); i++)
{
m.push(m[i] + m[i+1]);
if ((m[i+2] % 2 != 0) && (m[i+2] <= n)) sum+=m[i+2];
}
if (n == 1) sum = 1;
if (n == 0) sum = 0;
return sum;
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
f(1000);
//1+1+2+3+5+8+13...
let sum = 0;
let m = 1;
let l = 1;
let k = 0;
while(m <= n) {
if(m % 2 !== 0)
sum += m;
m = l + k;
k = l;
l = m;
}
return sum;
}
{
let a = 0; ///////перше значення n
let z = 1; ///////останнє значення н
let sum = 0;
let i = 0; /////змінна осатаннього значення н
while ( z <= n)
{
if ( z % 2 != 0)
{
sum = sum + z;
}
i = z;
z = z + a;
a = i;
}
return sum;
}
if (a < 3)
return 1;
return fib(a-1) + fib(a-2);
}
function f(n) {
let b = 1, sum = 0;
let t;
while(fib(b) <= n) {
if (fib(b)%2 != 0)
t = fib(b);
sum += t;
b += 1;
if (fib(b)%2 == 0)
b += 1;
}
return sum;
}
let f = 0;
let s = 0;
let sum = 0;
for(let i = 1; i <= n; s = i, i += f, f = s){
if(i % 2 != 0) {sum += i}
}
return sum;
}
var k = []
let prev = 0, next = 1;
for(var i = 0; i < n; i++){
let temp = next;
next = prev + next;
prev = temp;
k.push(prev)
}
let o = 0
let r = 0
while (k.length > o){
if (k[o] % 2 != 0 && k[o] <= n){
r += k[o]
}
o++
}
return r;
}
let a = 0;
let r = 0;
let sum = 0;
for(let i = 1; i <= n; r = i, i += a, a = r){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
let f1 = 1;
let f2 = 1;
let sum = 2;
for (i = 3; i <= n; i++) {
fl = f1 + f2;
f1 = f2;
f2 = fl;
if(fl % 2 == 1 && fl < n){
sum += fl;
}
}
if(sum )
return sum ;
}
{
let f1 = 1;
let f2 = 0;
let f = 0;
let sum = 0;
while(f <= n)
{
if (f % 2 != 0)
{
sum += f;
}
f = f1 + f2;
f1 = f2;
f2 = f;
}
return sum;
}
{
let sum = 1;
let i = 1;
let k = 0;
let z = 1;
while(k + z <= n)
{
i = k + z;
if(i % 2 != 0)
{
sum += i;
}
k = z;
z = i;
}
return sum;
}
let sum = 0;
let cur = 0;
let prev = 0;
for(let i = 1;i <= n; cur=i, i+=prev,prev=cur){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
let t = 0
let x = 0
let sum = 0
for(let i =1;i<=n;x=i,i+=t,t=x){
if(i%2!=0) {
sum+=i
}
}
return sum
}
if (n< 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a+b;
if (c>n) break;
a = b;
b = c;
if (c%2 !== 0) sum += c;
}
return sum;
}
let currentNum = 1;
let sumResult = 1;
let previousNum = 1;
while (currentNum <= num) {
if (currentNum % 2 === 1) sumResult += currentNum;
[currentNum, previousNum] = [previousNum + currentNum, currentNum];
}
return sumResult;
}
let pre = 0;
let r = 0;
let sum = 0;
for (let i = 1; i <= n ; r = i, i += pre, pre = r){
if(i % 2 !== 0){
sum += i;
}
}
return sum;
}
{
let fibnum1 = 1;
let fibnum2 = 0;
let fibnum;
let sum = 0;
for (let i = 0; i<=n && fibnum1<=n; i++)
{
if (fibnum1%2 != 0)
{
sum += fibnum1;
}
fibnum = fibnum1+fibnum2;
fibnum2 = fibnum1;
fibnum1=fibnum;
}
return sum;
}
let sum=0;
let vorletzte=0;
let letzte=1;
let now=1;
while(now< n){
if(now%2==1) sum+=now;
now=letzte+vorletzte;
vorletzte=letzte;
letzte=now;
}
return sum;
}
{
let sum = 0
let A = 0
let B = 0
for (let i = 1; i <= n; A=i, i+=B, B=A)
{
if ( i % 2 != 0)
{
sum += i
}
}
return sum
}
let x = 0;
let y = 1;
let t;
let sum = 0;
while (y < n) {
t = x + y;
x = y;
y = t;
if (x % 2) {
sum += x;
} else {}
}
return sum;
}
let b = 0;
let a = 1;
let sum = 1;
for(let c = a + b;a + b <= n;b=a,a=c){
c = a + b;
if (c % 2 != 0){
sum += c;
}
}
return sum
}
{
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r)
{
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
{
let sum = 0;
let k = 0, m = 1, next;
while (k <= n)
{
next = k;
k = k + m;
m = next;
if (m % 2 !== 0)
{
sum += m;
}
}
return sum;
}
let temp = 0, num1 = 0, num2 = 1, res = 1;
while(num2 <= n)
{
temp = num1;
num1 = num2;
num2 += temp;
if(num2 % 2 == 1 && num2 <= n)
res += num2;
}
return res;
}
{
let fibEl = 1;
let addEl = 0;
let temp = 0;
let res = 0;
for(let i = 0; fibEl <= n; i++)
{
if (fibEl%2 == 1) res += fibEl;
temp = fibEl;
fibEl += addEl;
addEl = temp;
}
return res;
}
let fib = [0, 1, 1];
let sum = 1;
for(let i = 2; fib[0]+fib[1]<=n;i++){
fib[2] = fib[0]+fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2]%2) {
sum+=fib[2];
}
}
return sum;
}
let sum = 0;
let fib = 0;
let f1 = 1;
let f2 = 0;
while (fib <= n){
if (fib % 2 != 0){
sum += fib;
}
fib = f1 + f2;
f1 = f2;
f2 = fib;
}
return sum;
}
let a = 1
let b = 1
let sum = 1
for (let i = 3; i <= n; i++) {
if(b % 2 != 0 && b < n){
sum += b
}
let c = a + b
a = b
b = c
}
return sum
}
let a=1,b=1,c=0,d=2
while(c< n){
c=a+b
if(c>n){
break
}
if(c%2!=0){
d=d+c
}
a=b
b=c
}
return d;
}
let m = 1;
let a = 1;
let b = 1;
while(b <= n) {
if(b % 2 == 1) m += b;
let c = a + b;
a = b
b = c;
}
return m;
}
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
let fib1 = 1;
let fib2 = 0;
let fib = 0;
let sum = 0;
while(fib <= n){
if(fib % 2 != 0){
sum = sum + fib;}
fib = fib1 + fib2;
fib1 = fib2;
fib2 = fib;
}
return sum;
}
{
let sum = 0;
let a = 0;
let b = 0;
for(let i = 1; i <= n; a = i, i += b, b = a)
{
if(i % 2 != 0)
{
sum += i;
}
}
return sum;
}
let sum = 0
let prev = 0
let next = 1
while (next <= n) {
let temp = next
next = prev + next
prev = temp
if (prev % 2 != 0) {
sum += prev
}
}
return sum
}
let current = 2, sum = 2, previous1 = 1, previous2 = 1;
while (current <= n){
previous1 = previous2;
previous2 = current;
if(current % 2 !== 0) sum += current;
current = previous1 + previous2;
}
return sum;
}
let sum = 0;
let pre = 0;
let cur = 0;
for(let i = 1; i <= n; cur = i, i += pre, pre = cur){
if(i % 2 !== 0)
sum += i;
}
return sum;
}
let a = 0;b =1; sum = 0
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
console.log(f(1))
let arr = [1,1]
let k = 0
for (let i = 1; arr[i] < n; i++){
k = arr[i] + arr[i - 1]
if (k <= n){
arr.push(k)
} else break
}
let arr1 = []
for (let m = 0; m < arr.length; m++){
if (arr[m] % 2 != 0){
arr1.push(arr[m])
}else continue
}
let sum = 0;
for(let s = 0; s < arr1.length; s++){
sum += arr1[s];
}
return sum
}
{
let sum = 0;
let before1 = 0;
let before2 = 0;
let now = 1;
while (now <= n)
{
if (now%2 != 0)
sum += now;
before2 = now;
now += before1;
before1 = before2;
}
return sum;
}
{
let m=[1, 1];
let sum=2;
for (let i = 0; i < (n-2); i++)
{
m.push(m[i] + m[i+1]);
if ((m[i+2] % 2 != 0) && (m[i+2] < n)) sum+=m[i+2];
}
if (n == 1) sum = 1;
if (n == 0) sum = 0;
return sum;
}
let p1 = 1;
let p2 = 0;
let sum = 1;
for (let i = p1 + p2; i < n; i = p1 + p2) {
p2 = p1;
p1 = i;
if (i % 2 != 0) {
sum += i;
}
}
return sum;
}
if (n< 3 ) return n
let a=1;
let b = 1;
let sum=2;
for(i=2; i< n; i++){
let c = (a+b);
a=b;
b=c;
if (c>n) break;
if (c%2!==0){
sum +=c}
}
return sum
}
{
let sum=0;
let n1=1;
let n2=0;
let n3=n1+n2;
while (n3<=n){
if (n3%2!=0)
{
sum+=n3;
}
n1=n2;
n2=n3;
n3=n1+n2;
}
return sum;
}
let a = 0;
let b = 1;
let answ = 0;
while (a + b <= n){
let c = a + b;
a = b;
b = c;
answ += c % 2 == 1 ? c : 0;
}
return answ + 1;
}
let prev = 0
let curr = 1
let sum = 0
while (curr <= n) {
if (curr % 2 === 1) sum += curr;
[prev, curr] = [curr, curr + prev]
}
return sum
}
let sum = 0;
for(i = 1 ; fib(i)<=n;i++){
if(fib(i)%2!=0)
sum+=fib(i)
}
return sum;
}
function fib(n){
if(n< 3)
return 1;
return fib(n-1)+fib(n-2);
}
if (n< 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a+b;
if (c>n) break;
a = b;
b = c;
if (c%2 !== 0) sum += c;
}
return sum;
}
if (a< 3) return 1;
return fib(a-1)+fib(a-2)
}
function f(n){
let sum=0;
let i=1;
while (fib(i)<=n){
if (fib(i)%2==1) sum+=fib(i)
i++
}
return sum;
}
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
{
var a = 1
var b = 1
var c
var d = 2
for (var i = 3; i <= n; i ++)
{
c = a + b
a = b
b = c
if (((c % 2)!== 0) && (c <= n))
d += c
}
return d
}
{
let x = 0;
let y = 1;
let sum =0;
for (let i = 1; i <= n && y <= n; i++)
{
if(y % 2)
{
sum += y;
}
let s = x + y;
x = y;
y = s;
}
return sum;
}
let first_n = 0;
let last_n = 1;
let semi_n = 0;
let sum = 0;
while (last_n<=n) {
if (last_n %2 !=0) {
sum+=last_n;
}
semi_n = last_n;
last_n += first_n;
first_n = semi_n;
}
return sum
}
{
let a = 0;
let b = 0;
let sum = 0;
for (let i = 1;i <= n;b = i, i += a,a = b)
{
if (i % 2 != 0)
{
sum += i;
}
}
return sum;
}
if (n <= 2) {
return 2;
}
let f1 = 1;
let f2 = 1;
let sum = 2;
while (f1 + f2 <= n) {
let f3 = f1 + f2;
if (f3 % 2 == 1) {
sum += f3;
}
f1 = f2;
f2 = f3;
}
return sum;
}
let a=1,b=1,c=0,d=2
while(c< n){
c=a+b
if(c>n){
break
}
if(c%2!=0){
d=d+c
}
a=b
b=c
}
return d;
}
let a = 0;
let b = 1;
let sum = 0;
while (b <= n) {
if (b % 2 !== 0) sum += b;
let temp = a;
a = b;
b = temp + b;
}
return sum;
}
let result = f(100);
console.log(result);
let a = 0, c = 0 , b = 1, sum = 1
while(c < n){
if (c%2 !== 0){
sum += c;
}
c = a + b;
a = b;
b = c;
}
return sum;
}
let i = 1;
let num1 = 0;
let num2 = 1;
let num3 = num2 + num1;
while (num3 <= n) {
if ((num3 % 2) != 0 ) {
i += num3;
}
num1 = num2;
num2 = num3;
num3 = num1 + num2;
}
return (i)
}
let Fib = 1, a = 0, b = 0, sum = 0;
while (Fib < n) {
if (Fib % 2 != 0)
sum += Fib;
a = Fib;
Fib = a + b;
b = Fib - (Fib - a);
}
return sum;
}
let g = 1;
let i = 0;
let b = 1;
let k = 1;
while (g <= n)
{
g = i + b;
if (g <= n && g % 2 != 0)
{
k = k + g;
}
i = b;
b = g;
}
return k;
}
let x = 0, y = 1, sum = 0;
while(y < n) {
let a = y+x;
x = y;
y = a;
if(x % 2 != 0)
sum += x;
}
return sum;
}
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){
sum+=i;
}
}
return sum;
}
if (n <= 0) return [];
if (n === 1 ) return [0];
const array = [0,1];
while (true) {
const sum = array[array.length - 2] + array[array.length - 1];
if (sum >= n) break;
array.push(sum);
}
let b = 0;
for(let i = 0; i < array.length;i++){
if(array[i] % 2 == 1)
b += array[i]
}
return b;
}
console.log(f(5))
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
{
let sum = 0
let cur = 0
let prev = 0
for (let i = 1; i <= n; cur=i, i+=prev, prev=cur)
{
if (i % 2 != 0)
{
sum += i
}
}
return sum
}
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
let past = 0;
let t = 1;
let res = 0;
for (let i = 1; i <= n; t = i, i += past, past = t) {
if ((i% 2) != 0){
res += i;
}
}
return res;
}
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
let a = 1;
let a1 = 1;
let a2 = 1;
if (n == 1) return 2;
while(a2 <= n) {
if (a2 % 2 != 0) a += a2;
[a1, a2] = [a2, a1+a2];
}
return a;
}
let sum = 2;
let a = 1;
let b = 1;
let c = a + b;
for(let i = 3; i <= n; i++){
c = a + b;
if( c % 2 == 1 && c < n){
sum += c
}
a = b;
b = c;
}
return sum;
}
{
let a = 0;
let b = 1;
let c = 0;
for (let d = 1; d <= n; b = d, d += a, a = b)
{
if ((d % 2) != 0)
{
c += d;
}
}
return c;
}
let pre = 0;
let r = 0;
let sum = 0;
for(let i =1;i<=n;r=i, i+=pre,pre=r){
if(i%2!=0){sum+=i;}
}
return sum;
}
console.log(f(1000));
let t = 0, q = 0, sum = 0;
for(let fib = 1; fib <= n; q = fib, fib += t, t = q){
if(fib%2!=0){
sum += fib;
}
}
return sum;
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let num1 = 0;
let num2 = 1;
let result = 0;
let sum = num1;
while(num2 <= n){
result = num1 + num2;
if(num2 % 2 == 1){
sum = sum + num2;
}
num1 = num2;
num2 = result;
}
return sum;
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let sum = 1 + 1
let x = 1
let q
let i = 1
while (i<=n) {
q = i
i+= x
x = q
if (i%2 !== 0 && i<=n) {
sum += i
}
}
return sum
}
let a = 0, c = 0 , b = 1, sum = 1;
while(c < n)
{
if (c % 2 !== 0)
sum += c;
c = a + b;
a = b;
b = c;
}
return sum;
}
let back1 = 1;
let back2 = 1;
let sum = 2;
let i = 1;
while(back2 <= n){
i = back1 + back2;
back1 = back2;
back2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
if (n< 3) return n;
let sum =2;
let a =1;
let b=1;
for (let i = 2; i < n; i++) {
let c=a+b;
if (c>n) break;
a=b;
b=c;
if (c%2 !==0) sum +=c;
}
return sum;
}
let n1 = 0, n2 = 1;
let arr = [];
let sum = 0;
arr.push(n1, n2);
do{
let tmp = n1;
n1 = n2;
n2 = tmp + n2;
arr.push(n2);
}while(n2 < n);
for(let i = 0; i < arr.length - 1; i++){
if(arr[i] % 2 != 0){
sum += arr[i];
}
}
return sum;
}
{
let previous = 1, current = 1, sum = 1;
let next;
while (current <= n)
{
if (current % 2 != 0){
sum += current;
}
next = current + previous;
previous = current;
current = next;
}
return (sum);
}
if (n < 3) return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++) {
let c = a + b;
if (c > n) break;
a = b;
b = c;
if (c % 2 !== 0) sum += c;
}
return sum;
}
let num1 = 1;
let num2 = 1;
let sum = 2;
let i = 1;
while(num2 <= n){
i = num1 + num2;
num1 = num2;
num2 = i;
if(i % 2 != 0 && i <= n){
sum += i
}
}
return sum;
}
let prev = 0;
let next = 1;
let sum = 1;
let number = 0;
for (let i = 0; i < n; i++){
number = prev + next;
if ( number % 2 !== 0 && number < n) {
sum += number;
}
prev = next;
next = number;
}
return sum;
}
let num1 = 0
let num2 = 1
let sum = num2
let num3 = num1 + num2
while (num3 <= n){
num3 = num1 + num2
if (num3 <= n){
if (num3 % 2 != 0) sum = sum + num3
num1 = num2
num2 = num3
}
}
return sum
}
let teraz = 0 ;
let przed = 0 ;
let tu = 1 ;
let int ;
let i = 1 ;
let sum = 0 ;
while (i <= n){
int = tu ;
teraz = tu + przed ;
przed = tu ;
tu = teraz ;
i ++ ;
if (int <= n & int % 2 ==1 ){
sum += int ;
}
}
return sum ;
}
if (n< 3) return n;
let sum =2;
let a =1;
let b=1;
for (let i = 2; i < n; i++) {
let c=a+b;
if (c>n) break;
a=b;
b=c;
if (c%2 !==0) sum +=c;
}
return sum;
}
let sum = 0;
let i =0;
let f =0;
while(f<=n){
f = fib(i);
if(f%2==1 && f<=n){
sum+=f;
//console.log("-"+f);
}
i++;
}
return sum;
}
function fib(n) {
if(n==0){
return 0;
}
let a = 1;
let b = 1;
for (let i = 3; i <= n; i++) {
let c = a + b;
a = b;
b = c;
}
return b;
}
let i = f(4);
//console.log(i)
console.log(f(1)); // 2
console.log(f(5)); // 10
console.log(f(1000)); // 1785
let pre = 0;
let g = 0;
let sum = 0;
for(let i =1;i<=n;g=i, i+=pre,pre=g){
if(i%2!=0){sum+=i;}
}
return (sum);
}
let first = 0;
let second = 1;
let sum = 0;
//debugger;
while(second<=n){
if(second%2!=0){
sum += second;
}
let tmp = first;
first = second;
second = tmp+second;
}
return(sum);
}
{if (n< 3) return n
let sum = 2
let a = 1
let b = 1
for (let i = 2; i< n; i++)
{let c = a+b
if (c > n) break
a=b
b=c
if (c%2 !== 0) sum += c}
return sum}
if (n == 1)
return 1;
let sum = 2;
let v1 = v2 = 1;
for (let i = 2; i <= n; i++){
[v1, v2] = [v2, v1 + v2];
if (v2 % 2 == 1 && v2 <= n)
sum += v2;
}
return sum;
}
let a = 0;b =1; sum = 0
for (let i = 1; i <= n && b<=n; i++)
{
if(b % 2 != 0)
{
sum += b;
}
let c = a + b;
a = b;
b = c;
}
return sum;
}
let fib = [0,1]
let sum = 1;
while(fib[0] + fib[1] <= n)
{
fib[2] = fib[0] + fib[1];
fib[0] = fib[1];
fib[1] = fib[2];
if(fib[2] % 2 != 0) {
sum += fib[2];
}
}
return sum;
}
let prev = 1,
current = 1,
next;
let sum = 0;
while (prev < n) {
if (prev % 2 != 0) sum += prev;
next = prev + current;
prev = current;
current = next;
}
return sum;
}
var a = [1];
var c =1;
var b = 0;
var b =[]
for (var x = 0 ;x< n*2 ;x++){
a.push(c);
c=a[a.length-2]+a[a.length-1];
}
c=0
for (var x=0 ;x< a.length-1 ;x++){
if (a[c]%2!=0){
b.push(a[c])
c=c+1;
}
else{
c=c+1;
}
if (c>n){
break
}
}
c=0
for (x =0 ;x< b.length; x++){
c=c+b[x];
if (b[x+1]>=n){
break;
}
}
return c;
}
let sum = 0;
let cur = 0;
let prev = 0;
for(let i = 1;i <= n; cur=i, i+=prev,prev=cur){
if(i % 2 != 0){
sum += i;
}
}
return sum;
}
if (n < 3)
return n;
let sum = 2;
let a = 1;
let b = 1;
for (let i = 2; i < n; i++){
let c = a + b;
if (c > n)
break;
a = b;
b = c;
if (c % 2 !== 0)
sum += c;
}
return sum;
}