【lightoj】-1294 Positive Negative Sign
2016-06-10 11:43
387 查看
Positive Negative Sign
ime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status
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
这道题真的是一个忧伤的故事!!!呜呜,wa了六次,因为没有好好看题,虽然想多了吧,但是类型用的不对啊!!!看题啊!!!!
#include<cstdio>
int main()
{
int t;
int j=1;
scanf("%d",&t);
while(t--)
{
long long n,m,y;
long long z=0;
scanf("%lld%lld",&n,&m);
y=n/m;
z=m*m*(y/2);
printf("Case %d: %lld\n",j,z);
j++;
}
return 0;
}
ime Limit:2000MS Memory Limit:32768KB 64bit IO Format:%lld & %llu
Submit Status
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
这道题真的是一个忧伤的故事!!!呜呜,wa了六次,因为没有好好看题,虽然想多了吧,但是类型用的不对啊!!!看题啊!!!!
#include<cstdio>
int main()
{
int t;
int j=1;
scanf("%d",&t);
while(t--)
{
long long n,m,y;
long long z=0;
scanf("%lld%lld",&n,&m);
y=n/m;
z=m*m*(y/2);
printf("Case %d: %lld\n",j,z);
j++;
}
return 0;
}
相关文章推荐
- Java三种判断字母大小写的方法
- tableview旋转90度不能对齐
- 【BZOJ4510】[Usaco2016 Jan]Radio Contact【DP】
- 蓝桥杯 李白打酒-递归
- 如何辨别数清冲突域和广播域
- iOS CGRectInset
- 设计模式系列:合成复用原则
- 在串口通信开发中实现自动查找串口端口的方法
- 蛇形矩阵
- 设计模式系列:迪米特法则
- android /system/vold源码分析(2)
- zookeeper简介
- 设计模式系列:接口隔离原则
- 设计模式系列:依赖倒置原则
- CTF【每日一题20160609】
- Android RxJava操作符一览
- 对堆栈的认识
- python 基础之确认文件是否存在
- 设计模式系列:里氏替换原则
- NOI10超级玛丽游戏