Each digit and seek

#include <iostream>
#include <stack>
using namespace std;
int main()
{
    int r,n,ans=0;
    stack<int>s;
    cin>>n>>r;
    while(n)
    {
        s.push(n%r);
        n/=r;
    }
    while(!s.empty())
    {
        ans+=s.top();
        s.pop();
    }
    cout<<ans<<endl;
    return 0;
}