10783 - Odd Sum UVa Online Judge || UVa 10783 Odd Sum Solution || UVa Online Judge 10783 Solution in C C++ Java Python
Problem name: UVa 10783 Odd Sum
Judge: UVa Online Judge
Problem link: UVa 10783 Odd Sum
Solution on GitHub: UVa 10783 Odd Sum
UVa Online Judge 10783 Odd Sum Solution in C C++ Cpp
#include <iostream>
using namespace std;
int main()
{
int t, count = 0;
cin >> t;
while (t--)
{
int var1, var2, sum = 0;
cin >> var1 >> var2;
for (int i = var1; i <= var2; i++)
{
if (i % 2 != 0)
{
sum = sum + i;
}
}
count++;
printf("Case %d: %d\n", count, sum);
}
return 0;
}
Tags: uva 10783, uva 10783 solution in c, uva 10783 solution in c++,
uva 10783 solution in cpp, uva 10783 solution in java, uva 10783 solution in
python, uva 10783 solution in c#, uva, uva online judge, online judge
solutions, uva solutions, odd sum uva, odd sum uva solution, uva odd sum
solution in c, 10783 - odd sum solution in c, uva 10783, uva online
judge, uva online judge down, uva online judge registration, acm problem
solving, acm uva problem set, online judge the programming challenges robot
judge
