棰樼洰鍦板潃 :
http://acm.hdu.edu.cn/showproblem.php?pid=1250
棰樼洰鎻忚堪:
Hat's Fibonacci
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 2208 Accepted Submission(s): 684
F(1) = 1, F(2) = 1, F(3) = 1,F(4) = 1, F(n>4) = F(n - 1) + F(n-2) + F(n-3) + F(n-4)
Your task is to take a number as input, and print that Fibonacci number.
100
4203968145672990846840663646 Note: No generated Fibonacci number in excess of 2005 digits will be in the test data, ie. F(20) = 66526 has 5 digits.
/*
Mail to : miyubai@gamil.com
MyBlog : baiyun.me
Link : http://www.cnblogs.com/MiYu || http://m.shnenglu.com/MiYu
Author By : MiYu
Test : 1
Complier : g++ mingw32-3.4.2
Program : Hat's Fibonacci
Doc Name : HDU_1250
*/
/*
楂樼簿搴︾殑姘撮 , JAVA 姘磋繃, 褰撶劧 鐢ㄦā鏉夸篃涓鏍?nbsp;
*/
package main;
import java.util.*;
import java.math.*;
import java.io.*;
public class Main {
public static void main(String[] args) {
Scanner cin = new Scanner ( System.in );
while ( cin.hasNext() ) {
int N = cin.nextInt();
if ( N <= 4 ) {
System.out.println ( 1 );
} else {
BigInteger one = new BigInteger ( "1" );
BigInteger two = new BigInteger ( "1" );
BigInteger three = new BigInteger ( "1" );
BigInteger four = new BigInteger ( "1" );
BigInteger res = new BigInteger ( "1" );
BigInteger temp = new BigInteger ( "1" );
for ( int i = 4; i < N; ++ i ) {
res = one.add(two).add(three).add(four);
temp = res;
one= two;
two = three;
three = four;
four = temp;
}
System.out.println( res );
}
}
}
}
]]>
棰樼洰鍦板潃: http://acm.hdu.edu.cn/showproblem.php?pid=1063
棰樼洰鎻忚堪:
Exponentiation
Time Limit: 1000/500 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 1696 Accepted Submission(s): 376
This problem requires that you write a program to compute the exact value of Rn where R is a real number ( 0.0 < R < 99.999 ) and n is an integer such that 0 < n <= 25.
95.123 12 0.4321 20 5.1234 15 6.7592 9 98.999 10 1.0100 12
548815620517731830194541.899025343415715973535967221869852721 .00000005148554641076956121994511276767154838481760200726351203835429763013462401 43992025569.928573701266488041146654993318703707511666295476720493953024 29448126.764121021618164430206909037173276672 90429072743629540498.107596019456651774561044010001 1.126825030131969720661201
榪欎袱澶╃獊鐒舵兂瀛︿範(fàn)涓婮AVA 鐨勫ぇ鏁?nbsp; 灝卞涔?fàn)浜?jiǎn)涓涓? 榪欓亾棰樺湪PKU A鎺変簡(jiǎn)鐨? 涓嶈繃鍦?HDU 涓鐩存病榪? 涓嶇煡閬撴湁浠涔堟伓蹇?jī)鐨勬暟鎹妸鎴懢l欐伓蹇?jī)鎺変? 寰堥儊闂?
涓嶈繃 鐢↗AVA鐩存帴 1 A 浜?.......... 寰堢畝鍗曠殑璇?/p>
浠ｇ爜濡備笅 :
/*
* To change this template, choose Tools | Templates
* and open the template in the editor.
*/
import java.util.Scanner;
import java.math.*;
/**
*
* @author baiyun
*/
public class Main {
/**
* @param args the command line arguments
*/
public static void main(String[] args) {
Scanner in = new Scanner ( System.in );
BigDecimal num;
int exp;
while ( in.hasNext() ){
num = in.nextBigDecimal();
exp = in.nextInt();
num = num.pow ( exp );
num = num.stripTrailingZeros();
String out = num.toPlainString();
if ( out.charAt(0) == '0' )
out = out.substring(1);
System.out.println( out );
}
}
}
]]>
棰樼洰鍦板潃:
http://acm.hdu.edu.cn/showproblem.php?pid=1715
棰樼洰鎻忚堪:
Fibonacci鏁板垪錛屽畾涔夊涓嬶細(xì)
f(1)=f(2)=1
f(n)=f(n-1)+f(n-2) n>=3銆?br>璁＄畻絎琻欏笷ibonacci鏁板箋?br>
Input
杈撳叆絎竴琛屼負(fù)涓涓暣鏁癗錛屾帴涓嬫潵N琛屼負(fù)鏁存暟Pi錛?/span>1<=Pi<=1000錛夈?br>
Output
杈撳嚭涓篘琛岋紝姣忚涓哄搴旂殑f(Pi)銆?br>
Sample Input
5
1
2
3
4
5
Sample Output
1
1
2
3
5
鐪嬮鐩氨鐭ラ亾鏄ぇ鏁頒簡(jiǎn)..........鐩存帴妯℃澘鍚?.娌′粈涔堝ソ璇寸殑.
浠ｇ爜濡備笅:
#include <string>
using namespace std;
string Add(string fNum,string sNum)
{
if( fNum.length() < sNum.length() ) fNum.swap(sNum);
string A = "0";
A += fNum;
for ( int i=1;i<=fNum.length();i++)
if(i<=sNum.length())
A[A.length()-i]+=sNum[sNum.length()-i]-'0';
for( int i=1;i<A.length();i++)
{
if(A[A.length()-i]>'9')
{ A[A.length()-i]-=10;A[A.length()-i-1]+=1; }
}
while(A[0]=='0') A.erase(0,1);
return A;
}
string F[1001] = { "0", "1", "1" };
void setNum ()
{
for ( int i = 3; i != 1001; ++ i )
{
F[i] = Add ( F[i-1] , F[i-2] ) ;
}
}
int main ()
{
int T;
setNum ();
while ( cin >> T )
{
while ( T -- )
{
int N;
cin >> N;
cout << F[N] << endl;
}
}
return 0;
}
]]>