LightOj1294 Positive Negative Sign



Positive Negative Sign

Crawling in process...Crawling failedTime Limit:2000MS    Memory Limit:32768KB     64bit IO Format:%lld & %llu

Submit Status

Description

Given two integers: n and m andn is divisible by 2m, you have to write down the firstn natural numbers in the following form. At first take first m integers and make their sign negative, then take next m integers and make their sign positive, the nextm integers should have negative signs and continue this procedure until all then integers have been assigned a sign. For example, let n be12 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 thatn is divisible by 2*m.

Output

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

Sample Input

2

12 3

4 1

Sample Output

Case 1: 18

Case 2: 2

思路1：  由于题上说是n能被2*m整除，所以说，n/m后得到的是偶数，那么也就是后面的m组数，减去前面的m组数得到的是m*m，然后看有多少个m*m,也就是将n/m得到的结果除以2就是m*m的个数，然后相乘就是想要的结果！

     思路2：直接将n/2代表的是后面那个数加上前面那个负数所得的值（也就是m）的个数，然后用n/2*m就是结果了！

      记住用long long型，否则会出错！

代码：

#include<stdio.h>
int main()
{
	int t,k=1;
    long long n,m;
	scanf("%d",&t);
	while(t--)
	{
		scanf("%lld%lld",&n,&m);
		printf("Case %d: %lld\n",k++,n*m/2);
	}
}