LightOJ 1294 Positive Negative Sign 求和的升级版 暑期练习T

1294 - Positive Negative Sign

PDF (English)

Statistics

Forum

Time Limit: 2 second(s)

Memory Limit: 32 MB

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 m integers 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	Output for Sample Input
2 12 3 4 1	Case 1: 18 Case 2: 2

 

---

PROBLEM SETTER: JANE ALAM JAN

题意：

就是给定1-n 的数字，每 m 个是一组，- + - + - +的交接。最后求和。

 

思路：

水题昂，怎么放在最后一道了。。。

如图

 

 

代码：

/*=============================AC情况===============================*/
/*题目网址:   */
/*时间： */
/*心得：  */

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#define G 100

int main() {
	int T;
	long long ans,n,m;
	scanf("%d",&T);
	for(int j=1; j<=T; j++) {
		scanf("%lld%lld",&n,&m);
		ans=n*m/2;
		printf("Case %d: %lld\n",j,ans);
	}
	return 0;
}

/*********************************测试数据*********************************


**************************************************************************/

Bug:

也是够了，总是。。。。

 不知道干嘛的自己。。。