UVA 12403 - Save Setu UVA • Sep 1, 2020 Problem PDFSolution:#include #include int main () { int t,s=0,d=0; char a [100]; scanf ("%d", &t); while ( t-- ) { scanf ("%s", a); if (strcmp (a, "donate")==0) { scanf ("%d", &d); s += d; } else printf ("%d\n", s); } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12403/12403.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