LightOJ 1294
来源:互联网 发布:mac文稿无端占内存 编辑:程序博客网 时间:2024/06/06 04:21
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能被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>
- Lightoj --1294
- LightOJ 1294
- LightOJ 1294
- LightOJ 1294
- LightOJ 1294 (规律)
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- [LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- LightOJ
- 爸爸又来纪流水账了。
- HDU 1599 find the mincost route
- LightOJ 1138 Trailing Zeroes (III)
- 杭电-2059 龟兔赛跑 (基础DP)
- 补码,负数比整数多表示一个
- LightOJ 1294
- MySQL锁机制详解及死锁处理方式
- Spark伪分布安装(依赖Hadoop)
- 【C++】fill函数,fill与memset函数的区别
- iOS app上架流程
- 160824--推荐系统中的排序学习
- sklearn pipeline简介
- Java Arrays类的使用
- Binary Tree Zigzag Level Order Traversal