Exercise 10-1 judge the three digits that meet the conditions

exercises 10-1 Judge the three digits that meet the conditions (15 branch )

This question requests to realize a function , Count the complete square number with the same two digits in the three digits in a given interval （ Such as 144、676） The number of .

Function interface definition ：

int search( int n );

Parameters passed in int n Is a three digit positive integer （ Highest digit non 0）. function search return [101, n] The number of all the numbers that satisfy the conditions in the interval .

Sample referee test procedure ：

#include <stdio.h>
#include <math.h>

int search( int n );

int main()
{
    int number;

    scanf("%d",&number);
    printf("count=%d\n",search(number));
        
    return 0;
}


/*  Your code will be embedded here  */

sample input ：

500

sample output ：

count=6

int search( int n ){
    int count=0,m,x,a,b,c;
    for(m=11;m*m<=n;m++){
        x=m*m;
        a=x%10;
        b=x/10%10;
        c=x/100;
        if(a==b||a==c||b==c){
            count++;
        }
    }
    return count;
}