UVa 10783-Odd Sum

最新推荐文章于 2021-08-20 22:25:34 发布

AcToy

最新推荐文章于 2021-08-20 22:25:34 发布

阅读量581

点赞数

分类专栏：数论

本文链接：https://blog.youkuaiyun.com/AcToy/article/details/9047903

版权

数论专栏收录该内容

26 篇文章

订阅专栏

求m，n之间奇数的和

/*************************************************************************
    > File Name: 10783.cpp
    > Author: Toy
    > Mail: ycsgldy@163.com
    > Created Time: 2013年06月07日 星期四 15时23分58秒
 ************************************************************************/

#include <algorithm>
#include <iostream>
#include <iomanip>
#include <cstring>
#include <cstdlib>
#include <climits>
#include <sstream>
#include <fstream>
#include <cstdio>
#include <string>
#include <vector>
#include <queue>
#include <cmath>
#include <stack>
#include <map>
#include <set>

using namespace std;
const int INF = 0x7fffffff;
typedef pair<int,int> II;
typedef vector<int> IV;
typedef vector<II> IIV;
typedef vector<bool> BV;
typedef long long i64;
typedef unsigned long long u64;
typedef unsigned int u32;
#define For(t,v,c) for(t::const_iterator v=c.begin(); v!=c.end(); ++v)
#define IsComp(n) (_c[n>>6]&(1<<((n>>1)&31)))
#define SetComp(n) _c[n>>6]|=(1<<((n>>1)&31))
const int MAXP = 46341; //sqrt(2^31)
const int SQRP = 216; //sqrt(MAX)
int _c[(MAXP>>6)+1];
IV primes;

int Case, n, m;

int main ( ) {
    scanf ( "%d", &Case );
    for ( int cnt = 1; cnt <= Case; ++cnt ) {
        scanf ( "%d%d", &n, &m );
        int sum = 0;
        for ( int i = n; i <= m; ++i )
            if ( i % 2 ) sum += i;
        printf ( "Case %d: %d\n", cnt, sum );
    }
    return 0;
}