Palindrome Function

Time Limit: 8000/4000 MS (Java/Others)    Memory Limit: 256000/256000 K (Java/Others)
Total Submission(s): 662    Accepted Submission(s): 351

Problem Description

As we all know,a palindrome number is the number which reads the same backward as forward,such as 666 or 747.Some numbers are not the palindrome numbers in decimal form,but in other base,they may become the palindrome number.Like 288,it’s not a palindrome number under 10-base.But if we convert it to 17-base number,it’s GG,which becomes a palindrome number.So we define an interesting function f(n,k) as follow:
f(n,k)=k if n is a palindrome number under k-base.
Otherwise f(n,k)=1.
Now given you 4 integers L,R,l,r,you need to caluclate the mathematics expression ∑Ri=L∑rj=lf(i,j) .
When representing the k-base(k>10) number,we need to use A to represent 10,B to represent 11,C to repesent 12 and so on.The biggest number is Z(35),so we only discuss about the situation at most 36-base number.

Input

The first line consists of an integer T,which denotes the number of test cases.
In the following T lines,each line consists of 4 integers L,R,l,r.
(1≤T≤105,1≤L≤R≤109,2≤l≤r≤36)

Output

For each test case, output the answer in the form of “Case #i: ans” in a seperate line.

Sample Input

3

1 1 2 36

1 982180 10 10

496690841 524639270 5 20

Sample Output

Case #1: 665

Case #2: 1000000

Case #3: 447525746

Source

2017中国大学生程序设计竞赛 - 网络选拔赛

//题意:给出四个整数，L,R,l,r, ∑(L<=i<=R)∑(l<=j<=r) f(i,j) , f(i,j)代表 i 在 j 进制下是否为回文数，是为 k，否则值为 1。

//题解:枚举进制，那么就变为 cal(R,k) - cal(L-1,k) { cal(i,j)表1--i，在k进制下的回文数个数*k+其余数的个数 } 的累加了

计算小于等于一个数的回文数个数并不难，想清楚就好，如果某数前半部分小于该数的前半部分，那一定能构造出来，所以等于时特判一下即可

 # include <cstdio>
 # include <cstring>
 # include <cstdlib>
 # include <iostream>
 # include <vector>
 # include <queue>
 # include <stack>
 # include <map>
 # include <bitset>
 # include <sstream>
 # include <set>
 # include <cmath>
 # include <algorithm>
 # pragma  comment(linker,"/STACK:102400000,102400000")
 using namespace std;
 # define LL          long long
 # define pr          pair
 # define mkp         make_pair
 # define lowbit(x)   ((x)&(-x))
 # define PI          acos(-1.0)
 # define INF         0x3f3f3f3f3f3f3f3f
 # define eps         1e-
 # define MOD         

 inline int scan() {
     int x=,f=; char ch=getchar();
     while(ch<''||ch>''){if(ch=='-') f=-; ch=getchar();}
     while(ch>=''&&ch<=''){x=x*+ch-''; ch=getchar();}
     return x*f;
 }
 inline void Out(int a) {
     if(a<) {putchar('-'); a=-a;}
     if(a>=) Out(a/);
     putchar(a%+'');
 }
 #define MX 500
 /**************************/

 LL cal(LL x,LL k)
 {
     int len=;
     LL temp=x;
     int dat[];
     while (temp)
     {
         dat[len++]=temp%k;
         temp/=k;
     }

     LL ans = ,sum = k-,base=;
     for (int i=;i<len;i++)
     {
         ans+=sum-base;
         if (i%==)
         {
             base=sum;
             sum=sum*k+k-;
         }
     }
     LL sb=;
     for (int i=len-;i>=len/;i--)
         sb = sb*k+dat[i];
     LL now=sb;
     int wei;
     if (len%) wei=len/+;
     else wei = len/;
     for (int i=wei;i<len;i++)
         sb = sb*k+dat[i];

     if (sb<=x)
         ans+=now-base;
     else
         ans+=now-base-;
     return ans*(k-)+x;
 }

 int main()
 {
     int T = scan();
     for (int cnt=;cnt<=T;cnt++)
     {
         int L,R,l,r;
         scanf("%d%d%d%d",&L,&R,&l,&r);
         LL ans = ;
         for (int i=l;i<=r;i++)
         {
             ans +=cal(R,i)-cal(L-,i);
         }
         printf("Case #%d: %lld\n",cnt,ans);
     }
     return ;
 }