Cmexpr

[herevgo_sof]

Guys please help me with some test cases for "CMEXPR"!!
Thanks

[leppyr64]

8
(a+(b*c))
((a+b)*c)
(a*(b*c))
(a*(b/c)*d)
((a/(b/c))/d)
((x))
(a+b)-(c-d)-(e/f)
(a+b)+(c-d)-(e+f)

I can guess test cases for this problem, your code would probably return the correct answer, then you would ask for more. That sounds like a waste of time for me. If you want help, post your code and we could help you find an issue with it.

[codingcapo]

I am also getting WA Can anyone give a test case where I go wrong. . Pls. . THanks

#include<string.h>
#include<iostream>
using namespace std;
struct listrecord
 {
   char data;
   int val;
 };
int main()
 {
   int n,i,j,len,p,k,add,sub,mul,div;
   cin>>n;
   char post,pre,*str;
   listrecord list[250];
   for(i=0;i<n;i++)
    {
      str=new char[250];
      cin>>str;
      len=strlen(str);
      for(j=0;j<len;j++)
        {
          list[j].data=str[j];
          list[j].val=1;
        }  
      for(j=0;j<len;j++)
       {
         if(str[j]==')')
          {
            add=sub=mul=div=0;
            for(k=j;str[k]!='(';k--)
             {
                      if(str[k]=='+')
                       {
                          add=1;
                          continue;
                       }
                      if(str[k]=='-')
                       {
                          sub=1;
                          continue;
                       }
                      if(str[k]=='*')
                       {
                          mul=1;
                          continue;
                       } 
                      if(str[k]=='/')
                       {
                          div=1;
                          continue;
                       }
             }  
               if(j==len-1&&k==0)
                {
                  list[0].val=list[j].val=0;
                  break;
                }  
               if(k==0) 
                {
                  post=str[j+1];
                  switch(post)
                              {
                                case '+' : list[k].val=list[j].val=0;
                                           break;
                                case '-' : list[k].val=list[j].val=0;
                                           break;
                                case '*' : if(add+sub==0)
                                            list[k].val=list[j].val=0;
                                           break;
                                case '/' : if(add+sub==0)
                                            list[k].val=list[j].val=0;
                                           break;
                                case ')' : list[k].val=list[j].val=0;
                                           break;
                               }
                  continue;
                }               
               pre=str[k-1];
               switch(pre)
                {
                  case '+' : list[k].val=list[j].val=0;
                             break;
                  case '-' : if(add+sub==0)
                               list[k].val=list[j].val=0;
                             break;
                  case '*' : if(add+sub==0)
                               list[k].val=list[j].val=0;
                             break;
                  case '/' : if(add+sub+mul+div==0)
                               list[k].val=list[j].val=0;
                             break;
                  case '(' : post=str[j+1];
                             switch(post)
                              {
                                case '+' : list[k].val=list[j].val=0;
                                           break;
                                case '-' : list[k].val=list[j].val=0;
                                           break;
                                case '*' : if(add+sub==0)
                                            list[k].val=list[j].val=0;
                                           break;
                                case '/' : if(add+sub==0)
                                            list[k].val=list[j].val=0;
                                           break;
                                case ')' : list[k].val=list[j].val=0;
                                           break;
                               }
                             break;                                                                     
                }
               for(p=k;p<=j;p++)
                 str[p]='.';                    
          }
       } 
     for(j=0;j<len;j++)
       if(list[j].val)
         cout<<list[j].data;
     cout<<"\n";    
//     delete[] list;
     delete[] str; 
    }
   return 0;
 }