Count subsequences of type a^i b^j c^k

problem link :--http://practice.geeksforgeeks.org/problems/count-subsequences-of-type-ai-bj-ck/0

code:--

#include <bits/stdc++.h>

using namespace std;
#define ll   long long
#define      pii               std::pair<int,int>
#define      vi                std::vector<int>
#define      vll               std::vector<long long>
#define      mp(a,b)           make_pair(a,b)
#define      pb(a)             push_back(a)
#define sc(x)   scanf("%d",&x)
#define scll(x)   scanf("%lld",&x)
#define sc2(x,y)   scanf("%d%d",&x,&y)
#define sc3(x,y,z)   scanf("%d%d%d",&x,&y,&z)
#define     pf(x)   printf("%d ",x)
#define     pf2(x,y)   printf("%d %d ",x,y)
#define     pf3(x,y,z)   printf("%d %d %d ",x,y,z)
#define pfnl()   putchar('\n');
#define      each(it,s)        for(auto it = s.begin(); it != s.end(); ++it)
#define      rep(i, n)         for(int i = 0; i < (n); ++i)
#define rep2(i,j,n)   for(int i = j; i < (n); ++i)
#define      fill(a)           memset(a, 0, sizeof (a))
#define      sortA(v)          sort(v.begin(), v.end())
#define      sortD(v)          sort(v.begin(), v.end(), greater<auto>())
#define      X                 first
#define      Y                 second

#define debug(x) cerr<<"debug->"<<#x<<"::"<<x<<endl
#define debug2(x,y) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\n"
#define debug3(x,y,z) cerr<<#x<<" :: "<<x<<"\t"<<#y<<" :: "<<y<<"\t"<<#z<<" :: "<<z<<"\n"
#define MOD 1000000007

string str;

int magic()
{
int dp[4][105]={0};
rep(i,str.length()+1) dp[0][i]=1;
int i=0;
while(str[i]!='\0')
{
for(int j=1;j<=3;++j)
dp[j][i+1]=(str[i]=='`'+j)?(2*dp[j][i]+dp[j-1][i+1]):(dp[j][i]);
++i;
}
return dp[3][str.length()];
}

int main(int argc, char **argv) {
//std::ios::sync_with_stdio(false);
int t,ans;
sc(t);
while(t--)
{
cin>>str;
ans=magic();
pf(ans);
pfnl();
}
return 0;
}