UVA 11900 - Boiled Eggs UVA • Sep 1, 2020 Problem PDFSolution:#include int main() { int n,i,k,a,b,c,d[1000],t=1; scanf("%d",&n); while(t<=n) { int s=0; scanf("%d %d %d",&a,&b,&c); i=1; while(i<=a) { scanf("%d",&d[i]); i++; } k=0; for(i=1;i<=a && i<=b;i++) { s+=d[i]; if(s>c) break; k++; } printf("Case %d: %d\n",t,k); t++; } return 0; } https://github.com/Shipu/OnlineJudgeProblemSolutionWithCPlusPlus/tree/master/uva/11900/11900.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