LightOJ 1294

du2715249700

于 2016-08-24 09:12:37 发布

阅读量213

点赞数 1

分类专栏：比赛练习

本文链接：https://blog.csdn.net/du2715249700/article/details/52296642

版权

比赛练习专栏收录该内容

14 篇文章 0 订阅

订阅专栏

Description

Given two integers: n and m and n is divisible by 2m, you have to write down the first n natural numbers in the following form. At first take first mintegers and make their sign negative, then take next m integers and make their sign positive, the next m integers should have negative signs and continue this procedure until all the n integers have been assigned a sign. For example, let n be 12 and m be 3. Then we have

-1 -2 -3 +4 +5 +6 -7 -8 -9 +10 +11 +12

If n = 4 and m = 1, then we have

-1 +2 -3 +4

Now your task is to find the summation of the numbers considering their signs.

Input

Input starts with an integer T (≤ 10000), denoting the number of test cases.

Each case starts with a line containing two integers: n and m (2 ≤ n ≤ 10⁹, 1 ≤ m). And you can assume that n is divisible by 2*m.

Output

For each case, print the case number and the summation.

Sample Input

12 3

4 1

Sample Output

Case 1: 18

Case 2: 2

题解：要注意n能被2*m整除

<span style="font-family:SimSun;">#include<cstdio>
int main()
{
	long long m,n;
	int t,cnt=1;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld%lld",&n,&m);
		n/=2;
		printf("Case %d: %lld\n",cnt++,n*m);
	}
	return 0;
}</span>