Submission #3270962

---

Source Code Expand

#include "bits/stdc++.h"
#define ll long long
#define rep2(i,a,b) for(int i=a;i<=b;++i)
#define rep(i,n) for(int i=0;i<n;i++)
#define pii pair<int,int>
#define pll pair<ll,ll>
#define tii tuple<int,int,int>
#define pq priority_queue<int>
#define pqg priority_queue<int,vector<int>,greater<int>>
#define pb push_back
#define edge(v,a,b) v[a].pb(b);v[b].pb(a);
ll MOD=1e9+7;
#define INF 2*1e9
#define N 1000010
#define MAX_V 900010
using namespace std;
ll pow1(ll n,ll x){
  ll res=1;
  rep(i,x)res*=n;
  return res;
}
main(){
    ll n,k;
    cin>>n>>k;
    if(k%2){
        cout<<pow1((n/k),3);
    }
    else{
        k/=2;
        cout<<pow1((n/k+1)/2,3)+pow1((n/k)/2,3);
    }
}

Submission Info

Judge Result