SZ Fibonacci Sequence
2014-02-05 10:57
337 查看
描述
Fibonacci Sequence is familiar to you,right?Here comes the SZ fibonaccisequence,with the property like Formula 3.1.1
a, n=1;
b, n=2
F(n)= F(n-1)+F(n-2) n>2 and n is odd;
F(n-1)+F(n-2)+F(n-3) n>3and n is even;
Here a and b are constants.Gaven a,b and n,your task is to calculate the F(n)
输入
First line of input comes a positive integer T(T<=10),indicating the number of test cases.Each test casecontains three positive integer a,b and n(a<=10,b<=10,n<=30).
输出
print one linr containing an integer,i,e.F(n),for each test case.
样例输入
2
1 2 3
1 3 6
样例输出
3
24
Fibonacci Sequence is familiar to you,right?Here comes the SZ fibonaccisequence,with the property like Formula 3.1.1
a, n=1;
b, n=2
F(n)= F(n-1)+F(n-2) n>2 and n is odd;
F(n-1)+F(n-2)+F(n-3) n>3and n is even;
Here a and b are constants.Gaven a,b and n,your task is to calculate the F(n)
输入
First line of input comes a positive integer T(T<=10),indicating the number of test cases.Each test casecontains three positive integer a,b and n(a<=10,b<=10,n<=30).
输出
print one linr containing an integer,i,e.F(n),for each test case.
样例输入
2
1 2 3
1 3 6
样例输出
3
24
#include<iostream> using namespace std; int main(){ __int64 f[31]; int i,t,n; cin>>t; while(t--){ scanf("%I64d %I64d %d",&f[1],&f[2],&n); for(i=3;i<=n;i+=2){ f[i]=f[i-1]+f[i-2]; f[i+1]=f[i]+f[i-1]+f[i-2]; } printf("%I64d\n",f ); } return 0; }
相关文章推荐
- ZOJ3952 Fibonacci Sequence Chicken Edition 【模拟】
- uva 10689 - Yet another Number Sequence(缓存,类Fibonacci)
- 1273 Fibonacci sequence sum
- Fibonacci sequence
- Sicily 1779 Fibonacci Sequence Multiplication
- LeetCode - Fibonacci Sequence/Dynamic Programming - Climbing Stairs
- 17th浙大校赛 ZOJ3952 Fibonacci Sequence Chicken Edition【汇编】
- ZOJ 3952 Fibonacci Sequence Chicken Edition(构造/模拟)
- 【ZOJ3952 The 17th Zhejiang University Programming Contest E】【简单构造 模拟 or汇编】Fibonacci Sequence Chicken
- Recipe 19.3. Generating the Fibonacci Sequence
- POJ3982-The Fibonacci sequence
- Sicily 1779. Fibonacci Sequence Multiplication
- Create pseudo-random numbers based on Fibonacci sequence
- POJ3982-The Fibonacci sequence
- 欧拉项目 Problem 25 of in the Fibonacci sequence to contain 1000 digits
- A Problem With Fibonacci Sequence
- 算法学习笔记--2. Selection sort & Fibonacci sequence
- C# Fibonacci Sequence
- Fibonacci sequence of k order
- ZOJ 3952 Fibonacci Sequence Chicken Edition