# Light oj 1294 Positive Negative Sign

185人阅读 评论(0)

T - T
Time Limit:2000MS     Memory Limit:32768KB     64bit IO Format:%lld & %llu

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 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 nintegers 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 nis 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

light oj不支持%i64d......醉了，再一次被坑到这了。。。。

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

0
0

* 以上用户言论只代表其个人观点，不代表CSDN网站的观点或立场
个人资料
• 访问：155137次
• 积分：8288
• 等级：
• 排名：第2804名
• 原创：704篇
• 转载：2篇
• 译文：0篇
• 评论：19条
最新评论