8VC Venture Cup 2017 - Elimination Round D. PolandBall and Polygon

#include<bits/stdc++.h>

using namespace std;

#define X first
#define Y second
#define eps 1e-2
#define gcd __gcd
#define pb push_back
#define PI acos(-1.0)
#define lowbit(x) (x)&(-x)
#define bug printf("!!!!!\n");
#define mem(x,y) memset(x,y,sizeof(x))

typedef long long LL;
typedef long double LD;
typedef pair<int,int> pii;
typedef unsigned long long uLL;

#define int long long 

const int N = 1e6+2;
const int INF  = 1<<30;
const int mod  = 1e9+7;

int n,k;

struct BIT{
    
    int n,c[N];
    void init(int _n){
    n=_n;for(int i=1;i<=n;++i) c[i]=0;}
    int Lowbit(int x){
     return x&(-x); }
    int get_sum(int k){
    int ans=c[k];while((k-=Lowbit(k))>0) ans+=c[k];return ans;}
    void add(int t,int v){
    c[t]+=v;while((t+=Lowbit(t))<=n) c[t]+=v;}
}bit1;

int get(int l,int r){
    
    return bit1.get_sum(r)-bit1.get_sum(l-1);
}

void solve(){
    
    scanf("%lld%lld",&n,&k);
    bit1.init(N-1);

    int st=1,ed=1+k,ans=1;
    if(k>n/2) k=n-k;
    for(int i=1;i<=n;i++){
    
        ed=(st+k-1)%n+1;
        // cout<<st<<" "<<ed<<endl;

        if(st>ed){
    
            ans+=1+get(1,ed-1)+get(st+1,n);
        }else{
    
            ans+=1+get(st+1,ed-1);
        }
        bit1.add(st,1);
        bit1.add(ed,1);
        st=ed;
        cout<<ans<<" ";
    }cout<<endl;

    return;
}

int32_t main()
{
    
// freopen("in.txt","r",stdin);
// freopen("out.txt","w",stdout);
// ios::sync_with_stdio(false);
    int t = 1;
    //scanf("%d",&t);
    while(t--){
    
    // printf("Case %d: ",cas++);
        solve();
    }
    return 0;
}