Problem Link: Click Here
Source Code in C++:
#include<bits/stdc++.h>
#define lli long long int
#define scf(n) scanf("%lld",&n)
#define nl prllif("\n")
#define spc prllif(" ")
#define file freopen("in.txt","rt",stdin)
#define pii pair<lli,lli>
#define love printf("Nahar")
using namespace std;
int main()
{
//file;
lli test,n,m,d;
lli ans;
scanf("%lld",&test);
for(lli i=1;i<=test;i++)
{
scanf("%lld%lld",&n,&m);
ans = m*m;
d = n/(2*m);
ans = d*ans;
for(lli j=d*2*m+1,k=1;j<=n;j++,k++)
{
love;
if(k<=m)
{
ans-=j;
}
else
{
ans+=j;
}
}
printf("Case %lld: %lld\n",i,ans);
}
return 0;
}
Source Code in C++:
#include<bits/stdc++.h>
#define lli long long int
#define scf(n) scanf("%lld",&n)
#define nl prllif("\n")
#define spc prllif(" ")
#define file freopen("in.txt","rt",stdin)
#define pii pair<lli,lli>
#define love printf("Nahar")
using namespace std;
int main()
{
//file;
lli test,n,m,d;
lli ans;
scanf("%lld",&test);
for(lli i=1;i<=test;i++)
{
scanf("%lld%lld",&n,&m);
ans = m*m;
d = n/(2*m);
ans = d*ans;
for(lli j=d*2*m+1,k=1;j<=n;j++,k++)
{
love;
if(k<=m)
{
ans-=j;
}
else
{
ans+=j;
}
}
printf("Case %lld: %lld\n",i,ans);
}
return 0;
}