F.A.Q
Hand In Hand
Online Acmers
Problem Archive
Realtime Judge Status
Authors Ranklist
 
     C/C++/Java Exams     
ACM Steps
Go to Job
Contest LiveCast
ICPC@China
Best Coder beta
VIP | STD Contests
    DIY | Web-DIY beta
Author ID 
Password 
 Register new ID

View Compilation Error

0_0_13813341_28359.cpp:1:10: error: #include expects "FILENAME" or <FILENAME>
 #include #include #define Max  2001+3char a[Max],b[Max],c[Max];char fib[1002][Max];void  jia(char str1[],char str2[],char sum[]){    int i,j,k,z;//    char sum[Max];    k=0;z=0;    for(i=strlen(str1)-1,j=strlen(str2)-1;i=0||j=0;i--,j--)    {        if(i=0)            z+=str1[i]-'0';        if(j=0)            z+=str2[j]-'0';       c[k++]=z%10+'0';       z=z/10;    }    if(z) c[k++]='1';    c[k]='/0';    i=0;    for(--k;k=0;k--)        sum[i++]=c[k];    sum[i]='/0';}void Fib(){    *fib[0]='0';    *fib[1]='1';  for(int i=2;i原题http://acm.hdu.edu.cn/showproblem.php?pid=1715大菲波数Time Limit: 1000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 11268    Accepted Submission(s): 3824Problem DescriptionFibonacci数列,定义如下:f(1)=f(2)=1f(n)=f(n-1)+f(n-2) n=3。计算第n项Fibonacci数值。 Input输入第一行为一个整数N,接下来N行为整数Pi(1 Output输出为N行,每行为对应的f(Pi)。 Sample Input512345 Sample Output11235 Source2007省赛集训队练习赛(2)       
          ^


Hangzhou Dianzi University Online Judge 3.0
Copyright © 2005-2024 HDU ACM Team. All Rights Reserved.
Designer & Developer : Wang Rongtao LinLe GaoJie GanLu
Total 0.000000(s) query 1, Server time : 2024-11-25 17:53:11, Gzip enabled