OJ Board

I am going to crazy for this problem
My code passed all the data on this thread, and I could not find whether there is an error with my dijkstra+heap.
More test data, please.

I first calculate all the prime numbers between 1 and 10⁶
then for every prime numbers below low and high, I add all the log below and high to the base of the prime number as a and b. Then b-a is the answer.
But it is really inefficient, can anyone tell me some efficient algorithm.
I ...

thank you very much!
i know why i wrong

i also use DP but got many WA...
here is my code
could someone give me some tricky test data
i am nearly crazy!

#include <iostream>
#include <cstring>
#define N 120
using namespace std;

char str[N],ans;
int s[N][N][3],from[N][N][3],l[N][N][3],r[N][N][3],n;
int table[3][3]={{1,1,0},{2,1,0},{0,2,2 ...