题解 | #自守数#

C题解

#include<stdio.h>

int isSelfNumber(int n1, int n2) {
    if(n1 == n2) {
        return 1;
    }
    int m = n1;
    int n = n2;
    int ret = 1;
    while(m > 0) {
        if(m % 10 == n % 10) {
            m /= 10;
            n /= 10;
        } else {
            ret = 0;
            break;
        }
    }
    return ret;
}

int main() {
    int n = 0;
    while(scanf("%d", &n) != -1) {
        int count = 0;
        for (int i = 0; i <= n; i++) {
            int v1 = i;
            int v2 = i * i;
            if(isSelfNumber(v1, v2)) {
                count++;
            }
        }
        printf("%d\n", count);
    }
    return 0;
}