Light oj 1294 Positive Negative Sign
来源:互联网 发布:linux redhat中文乱码 编辑:程序博客网 时间:2024/06/06 01:46
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;}
- light oj 1294 - Positive Negative Sign【规律】
- Light oj 1294 Positive Negative Sign
- LIGHT OJ-1294 Positive Negative Sign
- 【Light】[1294]Positive Negative Sign
- Light OJ 1294 - Positive Negative Sign 【规律 水题】
- light--oj--1294-- Positive Negative Sign(数学规律)
- Light OJ:1297 Positive Negative Sign(规律,数学)
- LightOJ 1294:Positive Negative Sign
- lightoj 1294 - Positive Negative Sign
- lightoj 1294 Positive Negative Sign
- LIGHTOJ-1294 - Positive Negative Sign
- LightOJ 1294 Positive Negative Sign
- LightOJ 1294:Positive Negative Sign
- LightOJ 1294:Positive Negative Sign
- LOJ 1294 - Positive Negative Sign
- 【lightoj】-1294 Positive Negative Sign
- 【LightOJ】1294 - Positive Negative Sign
- LightOJ 1294 - Positive Negative Sign
- vSphere 查看FC HBA的WWNN和WWPN
- QT学习笔记
- 第9章:中位数和顺序统计量
- Quartz2教程(一)——quatz的介绍与基本概念
- JavaScript学习笔记07 BOM
- Light oj 1294 Positive Negative Sign
- RSpec Trial
- typedef block
- 全排列(含有重复元素)
- 1094. The Largest Generation (25)
- CodeForces - 675C Money Transfers (map&技巧)
- 如何使用定时器settimeout、setInterval执行能传递参数的函数
- java多线程---等待/唤醒以及生产者消费者经典同步synchronized的实现
- spring的基础知识