关闭

LightOJ 1294:Positive Negative Sign

61人阅读 评论(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 ≤ 109, 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

2

12 3

4 1

Sample Output

Case 1: 18

Case 2: 2

题意:求前n项的和,可以发现每2m项的和为一个常数。经过推导最终结果为m*n/2。

代码如下:

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

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:16362次
    • 积分:1866
    • 等级:
    • 排名:千里之外
    • 原创:181篇
    • 转载:0篇
    • 译文:0篇
    • 评论:3条
    最新评论