Codeforce 1175A From Hero to Zero

题目链接：http://codeforces.com/problemset/problem/1175/A

---

AC代码：

 #include<cstdio>
 #include<iostream>
 #include<set>
 using namespace std;
 int main()
 {
     int t;
     scanf("%d",&t);
     while(t--)
     {
         long long n;
         long long k;
         long long ans = ;
         scanf("%lld %lld",&n,&k);
         while(n)
         {
             if(n % k)
             ans += n%k, n = n/k*k;
             else
             {
                 ans++;
                 n /= k;
             }

         }
         cout << ans << endl;
     }

     return ;
 }