UVa OJ - 10783 Odd Sum

The following program is my ACcepted code for UVA-1724.
It's a for everybody to learn and discuss.
If there is any mistake or comment, please let me know.  :D

此乃UVA 1724的AC code!

歡迎一同討論學習，如有錯誤與任何建議請留言 : )

點這裡看題目 Click here to see this Problem!

//This program is for UVA 10783 Odd Sum
//題目來源 Problem link: http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=19&page=show_problem&problem=1724

#include<stdio.h>
#include<stdlib.h>
using namespace std;

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

Please feel free to use it after adding this blog as an reference. (http://autekroy.blogspot.tw) If there is any mistake or comment, please let me know. :D 

歡迎使用與分享任何內容，但請記得標示此部落格為出處。(http://autekroy.blogspot.tw/) 如果有發現任何的錯誤與建議請留言或跟我連絡。 : )