/*åè代ç å¦ä¸ï¼*/
#include<stdio.h>
#include<conio.h>
int wide_n(int num)
{
int i,n=0;
for(i = num; i != 0;++n,i = i/10);
return n;
}
int pow_n(int num, int n)
{
int i,s = 1;
for(i=0; i<n; ++i)
s = s*num;
return s;
}
int isshuixian(int num)
{
int i,j,k,n,s=0,t=0;
if(num<100)
return 0;
n = wide_n(num);
for(i = 0, t = num; i < n; ++i){
j = t%10;
t = t/10;
k = pow_n(j, n);
s = s+k;
}
if(num == s)
return 1;
return 0;
}
int numOfShui(int a, int b)
{
int i,j,t;
t = a>b?a:b;
i = a<b?a:b;
for(j = 0;i <= t;++i)
if(isshuixian(i)){
++j;
}
return j;
}
int main()
{
int i, n,a,b, s[100]={0};
scanf("%d",&n);/*nä¸å¤§äº100*/
for(i = 0; i < n; ++i){
scanf("%d%d",&a,&b);/*注æï¼TC2.0ç¼è¯å¨intæ大ä¸è¶
è¿32761*/
s[i]=numOfShui(a,b);
}
for(i = 0; i < n; ++i){
printf("%d\n", s[i]);
}
getch();
return 0;
}
温馨提示:内容为网友见解,仅供参考