UVA 11878 - Homework Checker UVA • Sep 1, 2020 Problem PDFSolution:#include<cstdio> #include<cstring> #include<string> #include<cmath> #include<iostream> #include<cctype> #include<map> #include<stack> #include<cstdlib> #include <queue> #include <vector> #include<algorithm> #define ll long long #define sc scanf #define pf printf #define Pi 2*acos(0.0) using namespace std; int main() { int a,b,count=0; char sine,c[1000],no; while(sc("%d%c%d=%s",&a,&sine,&b,c)==4) { if(sine=='+') { if(a+b==atoi(c)) count++; } else if(sine=='-') { if(a-b==atoi(c)) count++; } } pf("%d\n",count); return 0; }https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11878/11878.cpp Tags UVA Competitive Programming Shipu Ahamed Recommended for you UVA UVA 913 - Joana and the Odd Numbers 4 years ago • 1 min read UVA UVA 871 - Counting Cells in a Blob 4 years ago • 3 min read UVA UVA 866 - Intersecting Line Segments 4 years ago • 3 min read