UVA 12626 - I ❤ Pizza UVA • Sep 1, 2020 Problem PDFSolution:#include using namespace std; int main() { string nm; int cnt[10],tst,min; cin>>tst; getchar(); while(tst--) { min=100000; memset(cnt,0,sizeof(cnt)); getline(cin,nm); int len=nm.size(); for(int k=0;kcnt[m]) min=cnt[m]; } cout<https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/12626/12626.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