标签:clu time otto scanf exce you fir namespace --
传送门:http://acm.hdu.edu.cn/showproblem.php?pid=1250
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 12952 Accepted Submission(s): 4331
#include<bits/stdc++.h> using namespace std; #define max_v 10005 string add(string s1,string s2) { if(s1.length()<s2.length()) { string temp=s1; s1=s2; s2=temp; } int i,j; for(i=s1.length()-1,j=s2.length()-1;i>=0;i--,j--) { s1[i]=char(s1[i]+(j>=0?s2[j]-‘0‘:0)); //注意细节 if(s1[i]-‘0‘>=10) { s1[i]=char((s1[i]-‘0‘)%10+‘0‘); if(i) s1[i-1]++; else s1=‘1‘+s1; } } return s1; } int main() { int n; while(~scanf("%d",&n)) { string p[n+5]; if(n<=4) { printf("1\n"); continue; } p[1]="1"; p[2]="1"; p[3]="1"; p[4]="1"; for(int i=5; i<=n; i++) { p[i]=add(p[i-1],add(p[i-2],add(p[i-3],p[i-4]))); } cout<<p[n]<<endl; } return 0; }
HDU 1250 Hat's Fibonacci(大数相加)
标签:clu time otto scanf exce you fir namespace --
原文地址:https://www.cnblogs.com/yinbiao/p/9326353.html