G - Fibonacci(2020 ICPC Asia Shanghai Regional Contest)

最新推荐文章于 2022-11-20 10:08:27 发布

sdut_you

最新推荐文章于 2022-11-20 10:08:27 发布

阅读量339

点赞数

分类专栏： SDUT 组队赛

本文链接：https://blog.csdn.net/weixin_45714118/article/details/111404854

版权

SDUT 组队赛专栏收录该内容

4 篇文章 0 订阅

订阅专栏

In mathematics, the Fibonacci numbers, commonly denoted as fn, is a sequence such that each number is the sum of the two preceding numbers, starting with 1 and 1. That is, f1=1,f2=1 and fn=fn−2+fn−1 (n≥3).

Thus, the beginning of the sequence is 1,1,2,3,5,8,13,21,…

Given n, please calculate ∑ni=1∑nj=i+1g(fi,fj), where g(x,y)=1 when x⋅y is even, otherwise g(x,y)=0.

Input
The only line contains one integer n (1≤n≤109).

Output
Output one number – ∑ni=1∑nj=i+1g(fi,fj).

Examples

Input

Output

Input

Output

Input

Output

#include <bits/stdc++.h>
#define ll long long
using namespace std;
int main()
{
    ll n;
    scanf("%lld",&n);
    ll m=((n-1)*n)/2;
    ll k=n/3*2;
    if(n%3==1)
        k+=1;
    if(n%3==2)
        k+=2;
     k=((k-1)*k)/2;
    cout<<m-k<<endl;
    return 0;
}