UVA_10783_Odd_Sum

#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#include <string>
#include <cctype>
#include <stack>
#include <queue>
#include <list>
#include <vector>
#include <map>
#include <set>
#include <sstream>
#include <stdlib.h>
#include <cmath>
#define FOR(i,A) for(typeof (A).begin() i = (A).begin() ; i != (A).end() ; i++)
#define mp make_pair
#define debug( x ) cout << #x << " = " << x << endl
#define clr(v,x) memset( v, x , sizeof v )
#define all(x) (x).begin() , (x).end()
#define rall(x) (x).rbegin() , (x).rend()
#define TAM 110

using namespace std;

typedef pair<int,int> ii ;
typedef long long ll ;
typedef long double ld ;
typedef pair<int,ii> pii ;

ll gcd( ll A , ll B ){
    if( !B ) return A ;
    return gcd( B , A % B ) ;
}

ll lcm( ll A , ll B ){
    return A * B / gcd( A , B ) ;
}

int main() {
    int t,in,out;
   int cont=1;
   while(scanf("%d",&t)!=EOF){
    while(t--){
        scanf("%d %d",&in,&out);int sum=0;
        for(int i=in;i<=out;i++){
            if(i%2!=0) sum+=i;
        }
        printf("Case %d: %d\n",cont,sum);cont++;
    }
   }
    return 0;
}