洛谷P7893 黑白棋

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;

ll T,n,m,p;
ll s[100];

void process(){
    memset(s,0,sizeof(s));
    s[0]=n;
    for(int i=0;s[i]!=0;i++)
        s[i+1]=s[i]/p;
    for(int i=0;s[i]!=0;i++)
        s[i]=s[i]-s[i+1];
}

int main(){
    cin>>T;
    while (T--)
    {
        scanf("%lld%lld",&n,&p);
        if(p==1){cout<<0<<'\n';continue;}
        process();
        ll ans=0;
        for(int i=0;i<=100&&s[i]!=0;i++){
            if(i%2==0)
                ans+=s[i];
        }
        printf("%lld\n",ans);
    }
    //system("pause");
    return 0;
}