# Anti-Blot System (ABSYS) Program in C++ - Spoj

C++ Program for the anti-blot system problem of spoj is given below. The given solution is accepted by spoj judge.

PROGRAM:

```#include <bits/stdc++.h>
#include <algorithm>
using namespace std;

//function to convert the string into integer
int convert(string s){

int result=0;
for(int i=0;i<s.size();i++){
result=result*10+(s[i]-'0');
}
return result;
}

//function to check which string contains the substring "machula".
void solve(string s1,string s2,string s3){

int result;
if(s3.find("machula")!=std::string::npos){

int num1=convert(s1);
int num2=convert(s2);
result=num1+num2;
cout<<num1<<" + "<<num2<<" = "<<result;
}
else if(s2.find("machula")!=std::string::npos){
int num1=convert(s1);
int num2=convert(s3);
result=num2-num1;
cout<<num1<<" + "<<result<<" = "<<num2;

}
else
{
int num1=convert(s2);
int num2=convert(s3);
result=num2-num1;
cout<<result<<" + "<<num1<<" = "<<num2;
}
}
int main(){

int t;
cin>>t;
while(t--){
string s1,s2,s3;
char operat,equalto;
cin>>s1>>operat>>s2>>equalto>>s3;
solve(s1,s2,s3);
cout<<"\n";

}
return 0;
}```

OUTPUT: