C Sleepy Kaguya

链接：https://ac.nowcoder.com/acm/contest/338/C
来源：牛客网

题目描述

Houraisan☆Kaguya is the princess who lives in Literally House of Eternity. However, she is very playful and often stays up late. This morning, her tutor, Eirin Yagokoro was going to teach her some knowledge about the Fibonacci sequence. Unfortunately, the poor princess was so sleepy in class that she fell asleep. Angry Eirin asked her to complete the following task:

This sequence can be described by following equations:
1.F[1]=F[2]=1

2.F[n]=F[n-1]+F[n-2] (n>2)

Now, Kaguya is required to calculate F[k+1]*F[k+1]-F[k]*F[k+2] for each integer k that does not exceed 10^18.

Kaguya is so pathetic. You have an obligation to help her.

(I love Houraisan Kaguya forever!!!)

image from pixiv,id=51208622

输入描述:

InputOnly one integer k.

输出描述:

OutputOnly one integer as the result which is equal to F[k+1]*F[k+1]-F[k]*F[k+2].

示例1

输入

复制

输出

复制

说明

F[2]=1,F[3]=2,F[4]=3

2*2-1*3=1

备注:

0 < k ≤ 1^18If necessary, please use %I64d instead of %lld when you use "scanf", or just use "cin" to get the cases.

The online judge of HNU has the above feature, thank you for your cooperation.

找规律 -1 1

#include<stdio.h>
#include<iostream>
using namespace std;
int main()
{unsigned long long int n;cin >> n;if(n&1)cout<<"-1"<<"\n";elsecout<<"1"<<"\n";
}

View Code

转载于:https://www.cnblogs.com/DWVictor/p/10229982.html

C Sleepy Kaguya相关推荐

Sleepy Kaguya
https://ac.nowcoder.com/acm/contest/338/C 题解:验算一下,发现其实只有1和-1两个答案.奇数为-1,偶数为1: 演算过程: G(k)=F[k+1]*F[k+1 ...
UVA10427 Naughty Sleepy Boys【数学】
Hasan and Tanveer are two naughty boys of the class. They spent most of their class time playing 'Ti ...
P5200 [USACO19JAN]Sleepy Cow Sorting
P5200 [USACO19JAN]Sleepy Cow Sorting 题目描述 Farmer John正在尝试将他的N头奶牛(1≤N≤10^5),方便起见编号为1-N,在她们前往牧草地吃早餐之前排 ...
LG5200 「USACO2019JAN」Sleepy Cow Sorting 树状数组
\(\mathrm{Sleepy Cow Sorting}\) 问题描述 LG5200 题解树状数组. 设\(c[i]\)代表\([1,i]\)中归位数. 显然最终的目的是将整个序列排序为一个上升序 ...
Codeforces937D Sleepy Game
题意:两个人在有向上进行博弈,先手先下,后手在睡觉,所以后手由先手代下,每个人每次要沿着边移动,不能移动的人输,问最后先手是赢还是输还是平局,赢的话输出路径题解:两个人进行博弈,先手帮后手下,所以先 ...
P5200 [USACO19JAN]Sleepy Cow Sorting 牛客假日团队赛6 D 迷路的牛（贪心）
链接:https://ac.nowcoder.com/acm/contest/993/E 来源:牛客网对牛排序时间限制:C/C++ 1秒,其他语言2秒空间限制:C/C++ 32768K,其他语言 ...
CodeForces - 937D Sleepy Game
传送门:CodeForces - 937D 题意:两人进行一场走棋子的游戏,如果有人无法再继续走下去,那么他就输了.Petya先走,且如果petya的胜负优先级为:WIN>DRAW>LOS ...
Codeforces Round #467 (Div. 1): B. Sleepy Game（BFS+有向图判环）
题意(经过转换):给你一个n个点m条边的有向图,再给你一个起点x,问存不存在一条路径满足①路径中有奇数条边:②终点的出度为0,如果存在输出Win,并在第二行输出这个路径(可能不唯一输出任意一种),否则 ...
P5200 [USACO19JAN]Sleepy Cow Sorting G
题目描述 Farmer John正在尝试将他的 NN 头奶牛(1\le N\le 10^51≤N≤105),方便起见编号为 1\ldots N1-N,在她们前往牧草地吃早餐之前排好顺序. 当前,这些奶 ...
Sleepy Cow Herding
题目描述 Farmer John的三头获奖奶牛Bessie.Elsie和Mildred,总是会迷路走到农场上遥远的地方去!他需要你帮助将她们一起赶回来. 农场的草地大体是一块狭长的区域--我们可以将其 ...

C Sleepy Kaguya

题目描述

输入描述:

输出描述:

输入

输出

说明

备注:

C Sleepy Kaguya相关推荐

最新文章

热门文章