UVA 11875 - Brick Game UVA • Sep 1, 2020 Problem PDFSolution:#include #include #include using namespace std; int main() { int n,i,a[12],t,p,mem; while(scanf("%d",&n)==1) { t=1; while(n--) { scanf("%d",&mem); for(i=0;ihttps://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11875/11875.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