Problem A - Sum Kind Of Problem 2015 ACM/ICPC Greater New York Region

签到题开始没看懂题意。。>< 开始总是以为first N odd integers是[0,N]中弄出来的。。

#include<iostream>
#include<stdio.h>
#include<cstdio>
#include<string>
#include<cmath>
#include<stdlib.h>
#include<algorithm>
#include<string.h>
#include<cstring>
#include<vector>
#include<queue>
#include<map>

using namespace std;
const int maxn=20010;
int P;
int K;
int N;
long long sump[maxn];
long long sumo[maxn];
long long sume[maxn];
void init()
{
    memset(sump,0,sizeof(sump));
    memset(sump,0,sizeof(sumo));
    memset(sump,0,sizeof(sume));
    for(int i=1;i<maxn;i++)
    {
        sump[i]=sump[i-1]+i;
        if(i%2==1)
        {
            sumo[i/2+1]=sumo[i/2]+i;

        }
        if(i%2==0)
        {
           // cout<<i<<" "<<i/2<<" "<<i/2+1<<" "<<su<<endl;
            sume[i/2]=sume[i/2-1]+i;
        }
    }
}
int main()
{
    //freopen("input.txt","r",stdin);
    init();
    scanf("%d",&P);
    for(int ca=0;ca<P;ca++)
    {
        scanf("%d %d",&K,&N);
        printf("%d %lld %lld %lld\n",K,sump[N],sumo[N],sume[N]);

    }
}