代码

#include <iostream>
#include <algorithm>

using namespace std;
int n, d;

bool isPrime(int x) {
  if (x == 1) return false;
  for (int i = 2 ; i * i <= x; ++i)
    if (!(x % i)) return false;
  return true;
}

string convert(int n, int d) {
  string ans;
  while (n) {
    ans = to_string(n % d) + ans;
    n /= d;
  }
  return ans;
}

int main(void) {
  while (cin >> n >> d, n > 0) {
    string s = convert(n, d);
    reverse(begin(s), end(s));
    if (isPrime(n) && isPrime(stoi(s, 0, d))) puts("Yes");
    else puts("No");
  }
}