uva 10783 (Odd Sum)

Algorithm used : Ad hoc

#include <stdio.h>
int main(){
unsigned long long int a,b,c,d,e,sum,x,y;
scanf("%llu",&a);
for(b=0;b<a;b++){
scanf("%llu %llu",&c,&d);
sum=0;
if(c>d){
    x=d;
    y=c;
}
else if(c<d){
x=c;
y=d;

}
else if(c==d){
x=c;
y=d;
}
for(e=x;e<=y;e++){
if(e%2==1){
sum=sum+e;
}
else if(e%2==0)sum=sum;

}
printf("Case %llu: %llu\n",(b+1),sum);

}
return 0;



}

Tagged: 10783, solution, uva