Light OJ 1294 - Positive Negative Sign 【规律 水题】

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 mintegers 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

 

恩，简单的规律，除了2*m之后若有余数，判断余数与m大小，分两种情况用等差数列求和

呃，之前没仔细读题，n是整除2*m的。。。。

 

#include<cstdio>
int main()
{
    int t,cnt=0;
    long long n,m,s;
    scanf("%d",&t);
    while(t--)
    {
        scanf("%lld%lld",&n,&m);
        s=(n/(2*m))*m*m;
        printf("Case %d: %lld\n",++cnt,s);
    }
    return 0;
}

 

#include <iostream>
#include<cstdio>
#include<cstring>
using namespace std;

int main()
{
    int t,n,m,cnt=0;
    long long s;
    scanf("%d",&t);
    while(t--)
    {
        s=0;
        scanf("%d%d",&n,&m);
        s=n/(2*m);
        s=s*m*m;
        int tem=n%(2*m);
        if(tem)
        {
            long long l=0;
            long long k=n-tem+1;
            if(tem<=m)
            {
                l=k*(n-k+1)+(n-k)*tem/2;
                s=s-l;
            }
            else
            {
                l=k*m+m*(m-1)/2;
                s=s-l;
                tem=tem-m;
                k=n-tem+1;
                l=k*(n-k+1)+(n-k)*(n-k+1)/2;
                s=s+l;
            }
        }
        printf("Case %d: %lld\n",++cnt,s);
    }
    return 0;
}