Problem:
Find the number of subsequences of the form aibjck, i.e., it consists of i number of ’a’ characters, followed by j i number of ’b’ characters, followed by k i number of ’c’ characters where i >= 1, j >=1 and k >= 1 from a given string S.
|
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 |
#include <stdio.h> #include <string.h> int main() { //code int t,i,aCount,bCount,cCount; char s[10000]; scanf("%d",&t); while(t--) { scanf("%s",s); cCount=0; bCount=0; aCount=0; for(i=0;i<strlen(s);i++) { if(s[i]=='a') { aCount=1+2*aCount; } if(s[i]=='b') { bCount=aCount+2*bCount; } if(s[i]=='c') { cCount=bCount+2*cCount; } } printf("%d\n",cCount); } return 0; } |