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