poj 2305

#include <string>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <cstdio>

using namespace std;

int main()
{
    int p  ;
    string b , n;
    while(scanf("%d" , &p)!= EOF && p)
    {
        cin >> b >> n;
        //scanf("%c%c" , &b , &n);
        int lenb = b.length();
        int lenn = n.length();
        int N = 0 ;
        for(int i = lenn - 1 , k = 0; i >= 0 ; i -- , k++)
        {
            N += ((n[i] - '0' ) * pow(p * 1.0, k));
        }
        long long B = 0;
        long long sum = 1;
        for(int i = lenb - 1 , k = 0 ; i >= 0 ; i -- , k++)
        {
            if(k != 0) sum = (sum * p) % N ;
            B = (B + ((b[i] - '0') * sum) % N ) % N;
        }
        if(B == 0) 
        {
            cout << "0" << endl;
            continue;
        }
        int num[30];
        int k = 0;
        for(int i = 0 ; B ; i ++ )
        {
            num[i] = B % p;
            B /= p;
            k ++ ;
        }
        for(int i = k - 1 ; i >= 0 ; i --)
        {
            cout << num[i];
        }
        cout << endl;
    }
    return 0;
}