题目:http://acm.hdu.edu.cn/showproblem.php?pid=1041
这道题,最开始就想到是规律题。后来我打出前10后发现这可能可以用DP做。后来用DP做了发现超范围了。哎,这道题用DP也可以做。不过是多开个维度用来当做大数处理。不过还是用传统大数做了。注释掉的有DP的。只要重开一个维度。也就可以了。不过这道题大数打表是最好的。
#include<bits/stdc++.h>
#define PI 3.1415926
#define INF 1e18
using namespace std ;
typedef long long ll;
typedef unsigned long long ull;
string ans[1005];
string add(string s1,string s2,int p){
int arr1[5000],arr2[5000],arr3[5000];
memset(arr1,0,sizeof(arr1));
memset(arr2,0,sizeof(arr2));
memset(arr3,0,sizeof(arr3));
reverse(s1.begin(),s1.end());
reverse(s2.begin(),s2.end());
int len = max(s1.length(),s2.length());
for(int i = 0 ; i < s1.length() ; i++)
arr1[i] += s1[i]-'0';
for(int i = 0 ; i < s2.length() ; i++)
arr2[i] += s2[i]-'0';
for(int i = 0 ; i < len ; i++)
arr3[i] += arr1[i] + arr2[i];
string ret =string(len+1,'0');
arr3[0]+=p;
for(int i = 0 ; i < len+1 ; i++){
arr3[i+1] += arr3[i]/10;
arr3[i] %= 10;
ret[i] += arr3[i];
}
reverse(ret.begin(),ret.end());
for(int i = 0 ; i < len+1 ; i++)
if(ret[i] != '0'){
ret = ret.substr(i);
break;
}
if (ret==string(len+1,'0')) ret="0";
return ret;
}
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
string s0,s1;
s0="0",s1="0";
for(int i = 1 ; i <= 1000; i++){
if(i&1){
s0 = add(s1,s0,0);
s1 = s0;
}
else{
s0 = add(s0,s0,1);
s1 = add(s1,s1,0);
}
ans[i] = s0;
}
int n ;
while(cin>>n){
cout<<ans[n]<<endl;
}
return 0;
}/*
const ll MAX = 1000+50;
ll dp[MAX][2];
int main(){
memset(dp,0,sizeof(dp));
for(int i = 2 ; i <= MAX ; i++){
if(i%2==1){
dp[i][1]=dp[i-1][0]+dp[i-1][1];
dp[i][0]=dp[i-1][1]+dp[i-1][0];
}
else{
dp[i][1]=2*dp[i-1][1];
dp[i][0]=2*dp[i-1][0]+1;
}
}
int n;
string s1,s2;
s1="1";
s2="";
cin>>n;
int t = 1;
while(t<=n){
for(int i = 0 ; i < s1.length(); i++)
if(s1[i] == '1')
s2+="01";
else
s2+="10";
s1=s2;
s2="";
cout<<s1<<endl;
cout<<dp[t][1]<<" "<<dp[t][0]<<endl;
t++;
}
return 0;
}*/