#include <cstdio> #include <iostream> using namespace std; typedef long long ll; ll dp[100]={0}; ll digui(ll n){ if(n==1||n==2){ return n; } else{ if(dp[n]==0){ dp[n]=digui(n-1)+digui(n-2); } return dp[n]; } } int main(){ int t; cin>>t; for(int i=0;i<t;i++){ string ss; cin>>ss; ll len=ss.length(); cout<<digui(len)<<endl; } } |
Double click to view unformatted code.